Due by class time Tuesday, October 1
Do exercises 10 through 23 of the Recursively Structured Expressions worksheet from class. These functions recurse over infix, prefix, and postfix expressions. Be sure to use the auto-tester to test your functions as you go.
If you are up for it, do some or all of the Extra Credit Exercises covering lambda calculus expressions. These exercises are a little more challenging — and entirely optional — but will give you additional practice with recursively structured data.
Save all of your function definitions in a single Scheme file called assign6.scm and submit it using the Homework Upload Site. Make sure to include your name and the assignment number in a comment at the top of your file.
If you have questions about anything, don't hesitate to ask!