MIT 6.001                                       Fall, 1997
Instructor: A. Meyer

                 Recitation #7, Notes for Wed., 12/3/97

Memory structure and correspondence between box&pointer diagrams and 32
bit tagged items in memory.  Example from lecture notes.

Definition of GARBAGE at any moment in a Scheme computation: all bytes in
memory not accessible from the interpreter's STACK.  A node is
"accessible" if there is a path of CAR and CDR pointers to it, starting
from some CONS-cell on the STACK.