Efficient retargetable compiler code generation

Author

Hatcher, P.J. ; Tuller, J.W.

Author_Institution

Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA

fYear

1988

fDate

9-13 Oct. 1988

Firstpage

25

Lastpage

30

Abstract

A discussion is presented of the design and implementation of a retargetable code generation system, UNH-CODEGEN, specifically designed for the bottom-up tree pattern matching algorithms. The authors describe experiments in which the system has been used to build compilers. These experiments demonstrate that the system can be used to quickly generate a code generator that will run fast (roughly four times the speed of the Portable C Compiler´s code generators), that will be space-efficient, and that will make best use of the underlying machine description.<>

Keywords

application generators; automatic programming; program compilers; software portability; UNH-CODEGEN; bottom-up tree pattern matching algorithms; code generator; compiler building; machine description; retargetable code generation system; space-efficient; Algorithm design and analysis; Computer science; Costs; Dynamic programming; Encoding; Pattern analysis; Pattern matching; Pattern recognition; Performance analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Languages, 1988. Proceedings., International Conference on

Conference_Location

Miami Beach, FL, USA

Print_ISBN

0-8186-0874-9

Type

conf

DOI

10.1109/ICCL.1988.13039

Filename

13039