Compiling LL into the LLAMA

The compiler <> maps LL expressions into LLAMA instructions:

For writing convenience, the function symbol <> will only be used as in:

In this chapter, a precise description of the LL compiler via transformation rules is given (section 6.2). This allows a simple re-implementation in any (functional or imperative) programming language.

In these transformation rules, the compiler environment and the peep-hole optimizer are not included. They are described in section 6.1 and 6.3.

In section 6.4, some examples illustrating the transformation rules are presented.

• The Compiler Environment
• Transformation Rules
  • defun
  • Simple Expressions, Lists, and Structures
  • setq and Relatives
  • funcall and Relatives
  • let and let*
  • if and Relatives
  • Sequential Evaluation
  • Non-local Exits and Loops
  • Simple Builtins
  • User-defined Functions
• The Peep-Hole Optimizer
• Examples