Results 1 
5 of
5
Tree Automata for Code Selection
, 1994
"... 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 ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
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...
Treeshifts of finite type
, 2011
"... A onesided (resp. twosided) shift of finite type of dimension one can be described as the set of infinite (resp. biinfinite) sequences of consecutive edges in a finitestate automaton. While the conjugacy of shifts of finite type is decidable for onesided shifts of finite type of dimension one, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A onesided (resp. twosided) shift of finite type of dimension one can be described as the set of infinite (resp. biinfinite) sequences of consecutive edges in a finitestate automaton. While the conjugacy of shifts of finite type is decidable for onesided shifts of finite type of dimension one, the result is unknown in the twosided case. In this paper, we study the shifts of finite type defined by infinite ranked trees. Indeed, infinite ranked trees have a natural structure of symbolic dynamical systems. We prove a Decomposition Theorem for these treeshifts, i.e. we show that a conjugacy between two treeshifts can be broken down into a finite sequence of elementary transformations called insplittings and inamalgamations. We prove that the conjugacy problem is decidable for treeshifts of finite type. This result makes the class of treeshifts closer to the class of onesided shifts of sequences than to the class of twosided ones. Our proof uses the notion of bottomup tree automata. 1
Towards the Tree Automata Workbench MARBLES
, 2009
"... We sketch the conceptual ideas that are intended to become the basis for the Tree Automata Workbench MARBLES, an extensible system that will facilitate the experimentation with virtually any kind of algorithms on tree automata. Moreover, the system will come with a library and an application program ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We sketch the conceptual ideas that are intended to become the basis for the Tree Automata Workbench MARBLES, an extensible system that will facilitate the experimentation with virtually any kind of algorithms on tree automata. Moreover, the system will come with a library and an application programmer’s interface that can be used by anyone wanting to apply such algorithms in research and development.
SyntaxDirected Translations and Quasialphabetic Tree Bimorphisms Revisited
"... Abstract. Quasialphabetic tree bimorphisms [Steinby and Tîrn uc: ..."