Premium
Attributed linear intermediate representations for retargetable code generators
Author(s) -
Ganapathi Mahadevan,
Fischer Charles N.
Publication year - 1984
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380140406
Subject(s) - compiler , computer science , code generation , representation (politics) , programming language , code (set theory) , prefix , intermediate language , variety (cybernetics) , table (database) , scheme (mathematics) , theoretical computer science , parallel computing , artificial intelligence , mathematics , linguistics , mathematical analysis , philosophy , set (abstract data type) , key (lock) , politics , political science , law , data mining , computer security
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.