Transformation Rules

In the following sections, the compiler <> will be described with a system of transformation rules; these rules can be of the following forms:

(A)

Rules of form A map an directly into an instruction sequence .

(B)

In rules of form B, recursive calls to <> are expressed by < expression > parts on the right-hand side of the rules.

(C)

If recursive calls of <> require the environment of local variables to be extended (as in defun and let), these variables are added as an index to <> as in < expression .

• 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