Article

Attributed linear intermediate representations for retargetable code generators

  1. Mahadevan Ganapathi1,
  2. Charles N. Fischer2

Article first published online: 30 OCT 2006

DOI: 10.1002/spe.4380140406

Issue

Software: Practice and Experience

Software: Practice and Experience

Volume 14, Issue 4, pages 347–364, April 1984

Additional Information

How to Cite

Ganapathi, M. and Fischer, C. N. (1984), Attributed linear intermediate representations for retargetable code generators. Software: Practice and Experience, 14: 347–364. doi: 10.1002/spe.4380140406

Author Information

  1. 1

    Computer Systems Laboratory, Stanford University, Stanford, California 94305, U.S.A.

  2. 2

    Computer Sciences Department, University of Wisconsin-Madison, Madison, Wisconsin 53706, U.S.A.

Publication History

  1. Issue published online: 30 OCT 2006
  2. Article first published online: 30 OCT 2006
  3. Manuscript Revised: 22 JUL 1983
  4. Manuscript Received: 10 JUN 1982

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (1251K)

Keywords:

  • Portable code generation;
  • Intermediate representations;
  • Code-generator generator;
  • Retargetable code generation;
  • Table-driven code generation

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.

Get PDF (1251K)