BEG: a generator for efficient back ends
- 21 June 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 24 (7) , 227-237
- https://doi.org/10.1145/73141.74838
Abstract
This paper describes a system that generates compiler back ends from a strictly declarative specification of the code generation process. The generated back ends use tree pattern matching for code selection. Two methods for register allocation supporting a wide range of target architectures are provided. A general bottom-up pattern matching method avoids problems that occurred with previous systems using LR-parsing. The performance of compilers using generated back ends is comparable to very fast production compilers. Some figures are given about the results of using the system to generate the back end of a Modula-2 compiler.Keywords
This publication has 6 references indexed in Scilit:
- Generalizations of the sethi‐ullman algorithm for register allocationSoftware: Practice and Experience, 1987
- Affix grammar driven code generationACM Transactions on Programming Languages and Systems, 1985
- Experience with a Graham-Glanville style code generatorPublished by Association for Computing Machinery (ACM) ,1984
- Generating MC68000 code for AdaPublished by Association for Computing Machinery (ACM) ,1983
- Retargetable Compiler Code GenerationACM Computing Surveys, 1982
- Experience with an automatic code generator generatorPublished by Association for Computing Machinery (ACM) ,1982