Attributed linear intermediate representations for retargetable code generators
- 1 April 1984
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 14 (4) , 347-364
- https://doi.org/10.1002/spe.4380140406
Abstract
This paper illustrates the usefulness of an attributed prefix linear intermediate representation for compiler code generation. In separating the machine‐independent and machine‐dependent aspects of a compiler, we discuss the advantages and disadvantages of an attributed linear intermediate representation with respect to tree‐structured intermediate representations. Some of these issues are relevant to fundamental questions of compiler structure with particular emphasis on retargetability. We discuss our implementation experience using this linear intermediate representation with a table‐driven code generation scheme for a variety of target architectures.Keywords
This publication has 21 references indexed in Scilit:
- Retargetable Compiler Code GenerationACM Computing Surveys, 1982
- Symbolic Debugging of Optimized CodeACM Transactions on Programming Languages and Systems, 1982
- Register allocation & spilling via graph coloringACM SIGPLAN Notices, 1982
- Exploiting machine‐specific pointer operations in abstract machinesSoftware: Practice and Experience, 1982
- Using Peephole Optimization on Intermediate CodeACM Transactions on Programming Languages and Systems, 1982
- Interpretation and code generation based on intermediate languagesSoftware: Practice and Experience, 1980
- Optimal Code Generation for Expression TreesJournal of the ACM, 1976
- The mobile programming system, JanusSoftware: Practice and Experience, 1974
- Abstract machine modelling to produce portable software—a review and evaluationSoftware: Practice and Experience, 1972
- The Generation of Optimal Code for Arithmetic ExpressionsJournal of the ACM, 1970