examples/fib.fwd


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

/* heh, this technically speaking works, but I guess the compiler can't collapse
 * frames so the bifurcating nature of fibonacci just gets mapped to a linear
 * sequence of calls, taking up way more stack space than a typical, returning,
 * function  */

fib(int n, (int) res)
{
	if n < 2 {
		res(1);
	} else {
		fib(n - 1) => int f1;
		fib(n - 2) => int f2;
		res(f1 + f2);
	}
}

main()
{
	fib(6) => int n;
	fwd_println(n);
}