Efficient retargetable compiler code generation
Philip J. Hatcher, J.W. Tuller
Abstract
Philip J. Hatcher, J.W. Tuller
Abstract
A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler's code generators), that will be space-efficient, and that will make best use of the underlying machine description.>
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler's code generators), that will be space-efficient, and that will make best use of the underlying machine description.>
Key concepts: Compiler, Computer science, Code generation, Programming language, Code (set theory), Generator (circuit theory), Object code, Matching (statistics)