Tree Automata for Code Selection

Tree Automata for Code Selection (1994)

Cached

Download Links

[www.cs.uni-sb.de]

Other Repositories/Bibliography

DBLP

by Christian Ferdinand , Helmut Seidl , Reinhard Wilhelm

Citations:

27 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Tree Automata for Code Selection	user correction - Legacy Corrections
AUTHOR NAME	Christian Ferdinand	user correction - Legacy Corrections
AUTHOR AFFIL	y	user correction - Legacy Corrections
AUTHOR NAME	Helmut Seidl	user correction - Legacy Corrections
AUTHOR NAME	Reinhard Wilhelm	user correction - Legacy Corrections
AUTHOR AFFIL	FB 14-- Informatik, Universitat des Saarlandes	user correction - Legacy Corrections
AUTHOR ADDR	Saarbrucken Germany	user correction - Legacy Corrections
ABSTRACT	We deal with the generation of code selectors in compiler backends. The fundamental concepts are systematically derived from the theory of regular tree grammars and finite tree automata. We use this general approach to construct algorithms that generalize and improve existing methods. 1 Introduction A code generator for a compiler is applied to an intermediate representation (IR) of the input program that has been computed during preceding phases of compilation. This intermediate representation can be viewed as code for an abstract machine. The task of code generation is to translate this code into an efficient sequence of instructions for a concrete machine. Besides register allocation and instruction scheduling (for processors with pipelined architectures), code selection, i.e., the selection of instructions, is one subtask of code generation. It is especially important for CISC (Complex I nstruction Set Computer) architectures where there are usually many possibilities to generat...	user correction - Legacy Corrections
YEAR	1994	user correction - Legacy Corrections
CITATIONS	27 found	ParsCit 1.0