LLAMA - The LISP light Abstract Machine

The LLAMA is a simple and universal abstract stack machine [\protect\citeauthoryearHenderson1980] which is used as the target machine for the compilation of LL. It is universal in the sense that most functional and many imperative language can easily be compiled into it.

In the following sections, the constituents of the LLAMA,

• the registers and memory organization,
  
• the representation of data structures,
  
• the calling conventions, and
  
• the instructions
  

• Registers and Memory Organization
• The Representation of Data Structures
  • Constants
  • Lists
  • Structures
• Calling Conventions
• The Instructions
  • Constants
  • Lists
  • Structures
  • Equality
  • Stack Manipulation
  • Control Instructions
    • Calling Subroutines
    • Branch Instructions
    • Non-local Exits
  • Higher-Order Instructions
  • Global Variables
  • Numerical and String Builtins
  • I/O Builtins