Summary: 131
Class Notes for CS 819A4 - Spring 2003
6. Trees and Dags
John C. Reynolds
Department of Computer Science
Carnegie Mellon University
Revised May 23, 2003
c
2003 John C. Reynolds

132
S-expressions (a la LISP)
 2 S-exps i
 2 Atoms
or  = ( 1
 2 ) where  1 ;  2 2 S-exps:
Representing S-expressions by Trees
For  2 S-exps, we dene the assertion
tree  (i)
by structural induction:
tree a (i) i emp ^ i = a

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

Collections: Mathematics