In this module we will learn about two related topics: branching structures, such as trees, and mutually recursive data definitions, such as lists of alternating strings and numbers. These two topics combine in the study of S-expressions. S-expressions are nested lists, such as the lists we write when we write Racket programs. S-expressions are one of the great inventions of modern programming. They were the original idea from which things like XML and JSON grew.
Part IV from the textbook.
Last modified: Tue Oct 18 12:21:37 Eastern Daylight Time 2016