



50 Points Due: Monday, September 11, at 5:00PM
The point value of each problem is shown in square brackets [ ].
Your solutions must be prepared with LaTeX
or other word processing system
and submitted as a stapled printout to a box outside the instructor's
office
(McBryde 638).
This homework is due at 5:00PM on September 11, 2000.
No late homework will be accepted.
Complete each of the following problems and turn in your work:

[25]
Sebesta Chapter 14, Problem 4 (page 602).

[25]
Write a Scheme function atomsetof that takes
an Sexpression as parameter and returns
a list of all the atoms at any level of the Sexpression,
without repetitions.
For example,
(atomsetof 'aabab)
returns
(aabab)
while
(atomsetof '(a (b c) (a d) (d a c (b a) z)))
returns
(a b c z d)
(the order of the atoms in the returned list is irrelevant).
You may want to define auxiliary functions to simplify the main function.
