Results 11  20
of
21
Hasse diagrams for classes of deterministic bottomup treetotreeseries transformations
 Theoret. Comput. Sci
, 2005
"... The relationship between classes of treetotreeseries and otreetotreeseries transformations, which are computed by restricted deterministic bottomup weighted tree transducers, is investigated. Essentially, these transducers are deterministic bottomup tree series transducers, except that the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The relationship between classes of treetotreeseries and otreetotreeseries transformations, which are computed by restricted deterministic bottomup weighted tree transducers, is investigated. Essentially, these transducers are deterministic bottomup tree series transducers, except that the former are defined over monoids whereas the latter are defined over semirings and only use the multiplicative monoid thereof. In particular, the common restrictions of nondeletion, linearity, totality, and homomorphism can equivalently be defined for deterministic bottomup weighted tree transducers. Using wellknown results of classical tree transducer theory and also new results on deterministic weighted tree transducers, classes of treetotreeseries and otreetotreeseries transformations computed by restricted deterministic bottomup weighted tree transducers are ordered by set inclusion. More precisely, for every commutative monoid and all sensible combinations of the above mentioned restrictions, the inclusion relation of the classes of treetotreeseries and otreetotreeseries transformations is completely conveyed by means of Hasse diagrams.
Compositions of bottomup tree series transformations
 UNIVERSITY OF SZEGED
, 2005
"... Tree series transformations computed by bottomup tree series transducers are called bottomup tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottomup tree series transformations over commutative and ...complete semirings are clos ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Tree series transformations computed by bottomup tree series transducers are called bottomup tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottomup tree series transformations over commutative and ...complete semirings are closed under leftcomposition with linear bottomup tree series transformations and rightcomposition with boolean deterministic bottomup tree series transformations.
OORS: An ObjectOriented Rewrite System with Applications in Retargetable Code Generation and Optimization
 Proceedings of the 1st Workshop on Advances in Programming Languages (WAPL’07
, 2007
"... Abstract. Retargeting a compiler’s back end to a new architecture is a timeconsuming process. This becomes an evident problem in the area of programmable graphics hardware (graphics processing units, GPUs) or embedded processors, where architectural changes are faster than elsewhere. We propose the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Retargeting a compiler’s back end to a new architecture is a timeconsuming process. This becomes an evident problem in the area of programmable graphics hardware (graphics processing units, GPUs) or embedded processors, where architectural changes are faster than elsewhere. We propose the objectoriented rewrite system OORS to overcome this problem. Using the OORS language, a compiler developer can express the code generation and optimization phase in terms of costannotated rewrite rules supporting complex nonlinear matching and replacing patterns. Retargetability is achieved by organizing rules into profiles, one for each supported target architecture. Featuring a rule and profile inheritance mechanism, OORS makes the reuse of existing specification possible. This is an improvement regarding traditional approaches. Altogether OORS increases the maintainability of the compiler’s back end and thus both decreases the complexity and reduces the effort of the retargeting process. To show the potential of this approach, we have implemented a code generation and a code optimization pattern matcher supporting different target architectures using the OORS language and introduced them in a GPU compiler. 1
Ambiguity, Valuedness and Costs
, 1992
"... This survey reports results on the ambiguity of finite tree automata, the valuedness of bottomup finite state tree transducers and boundedness of cost automata. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This survey reports results on the ambiguity of finite tree automata, the valuedness of bottomup finite state tree transducers and boundedness of cost automata.
Code Generation = A* + BURS
 Compiler Construction
, 1996
"... A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is redeveloped, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived fro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is redeveloped, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived from the term rewrite system to direct the search. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence.
Optimal regular tree pattern matching using pushdown automata
, 1998
"... Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionallygenerated tree pattern matching automaton. Our technique can handl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionallygenerated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed byconventional methods, and has been tested on some input problem instances representing instruction sets for processors. 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.
Induction Diagrams for Classes of Deterministic Bottomup TreetoTreeSeries Transformations
, 2004
"... In this paper we investigate the relationship between classes of treetotreeseries (for short: tts) and otreetotreeseries (for short: otts) transformations computed by restricted deterministic bottomup weighted tree transducers (for short: deterministic buwtt). Essentially, deterministic ..."
Abstract
 Add to MetaCart
In this paper we investigate the relationship between classes of treetotreeseries (for short: tts) and otreetotreeseries (for short: otts) transformations computed by restricted deterministic bottomup weighted tree transducers (for short: deterministic buwtt). Essentially, deterministic buwtt are deterministic bottomup tree series transducers [EFV02, FV03, ful, FGV04], but the former are de ned over monoids whereas the latter are de ned over semirings and only use the multiplicative monoid thereof. In particular, the common restrictions of nondeletion, linearity, totality, and homomorphism [Eng75] can equivalently be de ned for deterministic buwtt. Using wellknown results of classical tree transducer theory (cf., e.g., [Eng75, Fül91]) and also new results on deterministic buwtt, we order classes of tts and otts transformations computed by restricted deterministic buwtt by set inclusion. More precisely, for every commutative monoid we completely specify the inclusion relation of the classes of tts and otts transformations for all sensible combinations of restrictions by means of inclusion diagrams.
Extending GrahamGlanville Techniques for Optimal Code Generation
"... We propose a new technique for constructing codegenerator generators, which combines the advantages of the GrahamGlanville parsing technique and the bottomup tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton ..."
Abstract
 Add to MetaCart
We propose a new technique for constructing codegenerator generators, which combines the advantages of the GrahamGlanville parsing technique and the bottomup tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton as the matching device. This device is able to handle ambiguous grammars, and can be used to generate locally optimal code without the use of heuristics. Cost computations are performed at preprocessing time. The class of regular tree grammars augmented with costs that can be handled by our system properly includes those that can be handled by bottomup systems based on finitestate tree parsing automata. Parsing time is linear in the size of the subject tree. We have tested the system on specifications for some systems and report table sizes.