tests/functional/51_recursion_test2.sy


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

int fib(int n) {
	if (n == 0)
		return 0;
	if (n == 1)
		return 1;
	int p;
	p = n - 1;
	int q;
	q = n - 2;
	return fib(p) + fib(q);
}

int main() {
	int tmp;
	tmp = 10;
	return fib(tmp);
}