Recursion in F1WAE: Add a simple conditional construct, if0, which succeeds if the term in the first position evaluates to 0, to the F1WAE language of §4.3. This includes:
• BNF for the complete language
• define-type for the complete language
• parse, a parser for the complete language
• subst, a substitution function
• interp, and an interpretation function
Mostly these will be fairly simple modifications to the functions at the end of chapter 4.
Use it: Write some interesting recursive programs in this language, and test them to be sure they work.
Turn in: Put all your files into a folder csci312hw06yourname, zip it, and submit to canvas.
1
