dandorat
commented
3 years ago The initial program in the form of (begin defines e) is parsed to struct (Prog ds e) and then this is transformed to a struct (Letrec xs es e), where xs is a list of function ids and es is a list of structs (Lam xs e) or (Lam* xs xs* e). Then, lambdas in the program are labelled and the transformed program is compiled. The list of all the lambdas in the program is also formed and lambda definitions for these are compiled. Compilation of letrec and its right-hand-side λs is done with compile-letrec, compile-letrec-λs, and compile-letrec-init, and compilation of other lambdas is done with compile-λ. Compilation of function calls (e es) where e is an expression that evaluates to the address of a lambda on the heap, is done with new functions compile-call, compile-tail-call, and compile-nontail-call.
I did not change the current compilation of the definitions of the library functions by adding something like (define (stdlibs p) (Letrec fs ls p) and then (compile (stdlibs p)), where fs is the list of the ids of all the functions in the libraries (stdlib-ids) and ls are the corresponding lambdas. The library function definitions are still compiled with compile-defines, and functions calls (e es) where e is a member of the stdlib-ids list are still compiled with compile-app, compile-tail-app, and compile-nontail-app.
With the help of the class notes and the codes from the Fall 2019 class, implemented higher order functions. There are some design preferences that we will need to discuss and change if needed. In addition, will need to add implementation of lambda for apply. Will discuss more tomorrow. Thank you!