Assignment 1

Due Oct 4th 1999 at 12:00 NOON. (not at midnight)

Using the language specification for a simple language called Floyd. Write the following procedures/predicates:

  1. free-vars that takes a list structure representing an expression in Floyd and returns a set (a list without duplicates) of all the variables that occur free in the expression.
  2. bound-vars that takes a list structure representing an expression in Floyd and returns a set (a list without duplicates) of all the variables that occur bound in the expression.
  3. free? that determines if an expression in Floyd contains a free instance of a particular variable
  4. bound? that determines if an expression in Floyd contains a bound instance of a particular variable
This assignment is in exercises 2.3.1, 2.3.2, 2.3.5, 2.3.6 of our textbook. Turnin instructions will be similar to assignment 0's and will be here soon. Stay tuned.
Sushil Louis
Last modified: Sun Sep 19 12:34:20 PDT 1999