A new method for compiler code generation

ABSTRACT

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.

REFERENCES

• 1: A. V. Aho , S. C. Johnson , J. D. Ullman, Deterministic parsing of ambiguous grammars, Communications of the ACM, v.18 n.8, p.441-452, Aug. 1975 [doi>10.1145/360933.360969]
• 2: A. V. Aho , S. C. Johnson, Optimal Code Generation for Expression Trees, Journal of the ACM (JACM), v.23 n.3, p.488-501, July 1976 [doi>10.1145/321958.321970]
• 3: Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
• 4: Michael Kelly Donegan, An approach to the automatic generation of code-generators., 1973
• 5: Elson, M. & Rake, S. T., Code generation techniques for large-language compilers, IBM Sys. J. 9:3 (1970), 166-188.
• 6: Robert Steven Glanville, A machine independent algorithm for code generation and its use in retargetable compilers., 1977
• 7: Meyers, M. J., Linear representations of tree structure: a mathematical theory of parenthesis-free notations, Technical Report STAN-CS-74-222, Computer Science Department, Stanford University, Palo Alto, CA (July 1974).
• 8: P. L. Miller, AUTOMATIC CREATION OF A CODE GENERATOR FROM A MACHINE DESCRIPTION, Massachusetts Institute of Technology, Cambridge, MA, 1971
• 9: Peter C. Poole, Portable and Adaptable Compilers, Compiler Construction, An Advanced Course, 2nd ed., p.427-497, January 1976
• 10: Ritchie, D. M., C Reference Manual, Bell Laboratories, Murray Hill, N.J. (April 1977).
• 11: Steel, T. B. Jr., A first version of UNCOL, Proc. WJCC 19 (1961), 371-378.
• 12: J. Strong , J. Wegstein , A. Tritter , J. Olsztyn , O. Mock , T. Steel, The problem of programming communication with changing machines: a proposed solution, Communications of the ACM, v.1 n.8, p.12-18, Aug. 1958 [doi>10.1145/368892.368915]
• 13: Steven William Weingart, An efficient and systematic method of compiler code-generation., 1973
• 14: Welsh, J. & Quinn, C., A PASCAL compiler for ICL 1900 series computer, Software: Practice and Experience 2:1 (Jan.-Mar. 1972), 73-77.
• 15: Wilcox, T. R., Generating machine code for high-level programming languages, Technical Report 71-103, Department of Computer Science, Cornell University, Ithaca, NY (September 1971).
• 16: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975