6.9.0.6
Assignment 1, CSC530, Spring 2017
Write a compiler that accepts terms in the lambda calculus and outputs either JavaScript or Python or (massively harder) C.
Here’s the grammar of the input language:
| LC | = | num | ||
| | | id | |||
| | | (λ (id) LC) | |||
| | | (LC LC) | |||
| | | (+ LC LC) | |||
| | | (* LC LC) | |||
| | | (ifleq0 LC LC LC) | |||
| | | (println LC) |
...where num is a number, and id is an identifier.
1 Partners
Sure, work with a partner if you like.
2 Handin
TBA