Retargetable Compiler Code Generation
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 14 (4), 573-592
- https://doi.org/10.1145/356893.356897
Abstract
A classlficaUon of automated retargetable code generation techniques and a survey of the work on these techmques is presented Retargetable code generation research.is classified into three categories: interpretive code generation, pattern-matched code generation, and table-driven code generatlon. Interpretive code generation approaches generate code for a virtual machine and then expand into real target code Pattern-matched code generation approaches separate the machine description from the code generation algorithm. Tabledriven code generation approaches employ a formal machine description and use a code-' generator generator to produce code generators automatically. An analysis Qf these techniques and a critique of automatic code generation algorithms are presented,Keywords
This publication has 22 references indexed in Scilit:
- Experience with an automatic code generator generatorACM SIGPLAN Notices, 1982
- An overview of the PL.8 compilerACM SIGPLAN Notices, 1982
- Chaining Span-Dependent Jump InstructionsACM Transactions on Programming Languages and Systems, 1980
- Automatic Derivation of Code Generators from Machine DescriptionsACM Transactions on Programming Languages and Systems, 1980
- Machine-independent PASCAL code optimizationACM SIGPLAN Notices, 1979
- Compiler design for efficient code generation and program optimizationACM SIGPLAN Notices, 1979
- Assembling code for machines with span-dependent instructionsCommunications of the ACM, 1978
- The portability of the BCPL compilerSoftware: Practice and Experience, 1971
- The Generation of Optimal Code for Arithmetic ExpressionsJournal of the ACM, 1970
- Peephole optimizationCommunications of the ACM, 1965