A language for writing code generators
- 21 June 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 24 (7) , 238-245
- https://doi.org/10.1145/74818.74839
Abstract
Each specification is compiled into a fast, monolithic C program that accepts dags (directed acyclic graphs) annotated with intermediate code, and generates, optimizes, and emits code for the target machine. The code generators are used with a front end for ANSI C. The resulting compilers emit code similar to pcci’s, but they run about twice as fast. The compilers are in use by small research groups at Bell Labs and Princeton University and by classes at Princeton.Keywords
This publication has 10 references indexed in Scilit:
- Quick compilers using peephole optimizationSoftware: Practice and Experience, 1989
- Automatic generation of fast optimizing code generatorsPublished by Association for Computing Machinery (ACM) ,1988
- Optimal code generation for expression trees: an application BURS theoryPublished by Association for Computing Machinery (ACM) ,1988
- Automatic inference and fast interpretation of peephole optimization rules†Software: Practice and Experience, 1987
- An improvement to bottom-up tree pattern matchingPublished by Association for Computing Machinery (ACM) ,1987
- Affix grammar driven code generationACM Transactions on Programming Languages and Systems, 1985
- Efficient tree pattern matching (extended abstract): an aid to code generationPublished by Association for Computing Machinery (ACM) ,1985
- Code selection through object code optimizationACM Transactions on Programming Languages and Systems, 1984
- Experience with a Graham-Glanville style code generatorPublished by Association for Computing Machinery (ACM) ,1984
- Pattern Matching in TreesJournal of the ACM, 1982