Lambda Calculus and Lisp, part 2 (recursion excursion)

S NP VP N VP N V CP N V Comp S N V Comp NP VP N V Comp N VP N V Comp N V CP N V Comp N V Comp S N V Comp N V Comp NP VP N V Comp N V Comp N VP N V Comp N V Comp N V CP N V Comp N V Comp N V Comp S N V Comp N V Comp N V Comp NP VP N V Comp N V Comp N V Comp N VP N V Comp N V Comp N V Comp N V CP N V Comp N V Comp N V Comp N V Comp S N V Comp N V Comp N V Comp N V Comp NP VP ... I.e., in order (by this method) to calculate Fib(6) , you have to calculate Fib(5) , for which you have to calculate Fib(4)) , for which you have to calculate Fib(3) , for which you have to calculate Fib(2) , which you can then base on rules (1) & (2): you can add 0 and 1 (= Fib(0) and Fib(1)) together to get Fib(2) , and then you can calculate Fib(3) by adding Fib(1) and Fib(2) and so on.