List of chapters not covered
1.2.5 Greatest Common Divisors
1.2.6 Example: Testing for Primality
2.2.4 Example: A Picture Language
2.3.4 Example: Huffman Encoding Trees
2.5.3 Example: Symbolic Algebra
3.3.4 A Simulator for Digital Circuits
3.3.5 Propagation of Constraints
3.5.4 Streams and Delayed Evaluation
4.4.4 Implementing the Query System
4.4.4.1 The Driver Loop and Instantiation
4.4.4.3 Finding Assertions by Pattern Matching
4.4.4.5 Maintaining the Data Base
4.4.4.7 Query Syntax Procedures
5 Computing with Register Machines
5.1 Designing Register Machines
5.1.1 A Language for Describing Register Machines
5.1.2 Abstraction in Machine Design
5.1.4 Using a Stack to Implement Recursion
5.2 A Register-Machine Simulator
5.2.3 Generating Execution Procedures for Instructions
5.2.4 Monitoring Machine Performance
5.3 Storage Allocation and Garbage Collection
5.3.2 Maintaining the Illusion of Infinite Memory
5.4 The Explicit-Control Evaluator
5.4.1 The Core of the Explicit-Control Evaluator
5.4.2 Sequence Evaluation and Tail Recursion
5.4.3 Conditionals, Assignments, and Definitions
5.5.1 Structure of the Compiler
5.5.4 Combining Instruction Sequences
5.5.5 An Example of Compiled Code
5.5.7 Interfacing Compiled Code to the Evaluator