University of Virginia, Department of Computer Science
CS200: Computer Science, Spring 2003

Notes: Monday 27 January 2003

How can we compare notations for describing languages?

What is the difference between RTN and BNF?

Music and Recursion

Song ::= Verse VBBD VBBD Better Coda
VBBD ::= Verse Bridge Bridge Dadada (ends on C)
Coda ::= F Eb Bb F Coda
Note: the Coda has no base case, and should continue forever, time permitting.
Challenge Problem

Define a Scheme procedure that can produce the INT and Gplot graphs from GEB Chapter 5. Hint: you may need to think about curves differently from PS2. (A solution is worth two gold stars.)


CS 200

CS 200: Computer Science
Department of Computer Science
University of Virginia
Using these Materials