#!/bin/sh
string=? ; exec mzscheme -g -l core.ss -r $0 "$@"
(load "aux.ss")
(define (index)
(let ((oport (delete-and-open INDEX)))
(current-output-port oport)
(display TOP)
; (file-copy (open-input-file "index"))
(let L ((no 0))
(unless (> no LAST-ASSIGNMENT)
(let* ((aline (call-with-input-file (format "~a" no) read-line))
(title (second (regexp-match TITLE-PATTERN aline))))
(printf ASSIGNMENT no no title)
(L (+ 1 no)))))
(printf BOTTOM)
(close-output-port oport)))
(define INDEX "index.shtml")
(define ASSIGNMENT " Assignment ~a: ~a~n")
(define TOP "
Assignment Menu
Comp 210 Assignments: Fall 1999
For those of you who would like to gain more experience with writing
recursive functions, here are
the problem sets that appeared in an earlier edition of
The Little Schemer.
Use with care: there are a few discrepancies between the terminology of
this old book and the new one.
Be aware of the
The Laws of Homeworks and
grading guidelines.
During the first week of classes, please fill out the adminstrative forms (lab signups, etc)
When you turn in homework, make sure to
- add your name(s) and id number(s) to the first page;
- write your therapy session name on the first page;
- if your homework consists of more than one page,
staple all pages together.
| Kathi Fisler |
Last modified at (none)
|
")
(index)