Homework 3:

RAW MATERIAL: Interpreter code.

Question 1. Complete the intepreter so that is can hanlde the following type of programs:

• (define x 3)
  (define y "hello")
  (define z '(a b c))
  

Note: pay attention to the static function Interpreter.split; you will use it extensively in this homework.

Question 2. Continue to work on the intepreter so that is can handle the following type of programs:

• (if (> x 5) (display "Greater") (display "Not greater"))
  
  

Question 3. Continue to work on the intepreter so that is can hanlde the following type of programs:

• (define f (lambda (n) (+ n x)))
  
  
  Note: to simplify, ignore the 2nd, syntactic-sugared version of function definitions, so don't bother handling this:
  (define (f n) (+ n x))
  Note: the Scheme function "make-lambda" should now do the instantiation of the special class called Lambda
  

• ((lambda (n) (+ n 1)) 3)
  (f 5)

By now your interpreter should be rich enough to evaluate relatively complex programs. 
Show off your work by indicating what programs were you able to evaluate.

DELIVERABLES:
a) an extended running version of the interpreter
b) a text file (plain text, not Word) with the test programs you used

all zipped together in one big happy zip file.

DUE DATE: 2/13 by midnight