A new method for compiler code generation
R. Steven Glanville, Susan L. Graham · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · 1978
An algorithm is given to translate a relatively low-level intermediate representation of a program into assembly code or machine code for a target computer. The algorithm is table driven. A construction algorithm is used to produce the table from a functional description of the target machine. The method produces high quality code for many commercially available computers. By replacing the table, it is possible to retarget a compiler for another kind of computer. In addition techniques are given to prove the correctness of the translator.
Cited by 174 works. doi:10.1145/512760.512785
Authors
References
- Principles of Compiler Design
- Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
- The design of an optimizing compiler
- Optimal Code Generation for Expression Trees
- Deterministic parsing of ambiguous grammars
- The problem of programming communication with changing machines
- The problem of programming communication with changing machines
- A pascal compiler for ICL 1900 series computers
- A Machine Independent Algorithm for Code Generation and Its Use in Retargetable Compilers
- Code-generation technique for large-language compilers