Results 1 - 10 of 55

Multi-Return Macro Tree Transducers

by Kazuhiro Inaba, Haruo Hosoya - PLAN-X , 2008
"... Macro tree transducers are a simple yet expressive formal model for XML transformation languages. The power of this model comes from its accumulating parameters, which allow to carry around several output tree fragments in addition to the input tree. However, while each procedure is enabled by this ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
by this facility to propagate intermediate results in a top-down direction, it still cannot do it in a bottom-up direction since it is restricted to return only a single tree and such tree cannot be decomposed once created. In this paper, we introduce multi-return macro tree transducers as a mild extension

The Complexity of Translation Membership for Macro Tree Transducers

by Kazuhiro Inaba, Sebastian Maneth , 2009
"... Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the “translation membership problem ” is studied for mtts. For a fixed translation, the translation membership problem as ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the “translation membership problem ” is studied for mtts. For a fixed translation, the translation membership problem

Programming macro tree transducers

by Patrick Bahr, Laurence E. Day - In WGP ’13 , 2013
"... A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree tra ..."
Abstract - Cited by 5 (5 self) - Add to MetaCart
A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree

Macro tree transducers in Treebag

by Karl Azab , 2005
"... Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
implemented as a component in Treebag. Compared to the top-down tree transducer, the macro tree transducer provides a more powerful model of computation. This thesis describes how Treebag is extended with a macro

Macro Forest Transducers

by Thomas Perst, Helmut Seidl - Information Processing Letters , 2004
"... Abstract Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented as binar ..."
Abstract - Cited by 35 (2 self) - Add to MetaCart
Abstract Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented

XML type checking with macro tree transducers

by S. Maneth, A. Berlea, T. Perst, H. Seidl , 2004
"... The tree transformation language tl is introduced which incorporates full MSO-pattern-matching, arbitrary navigation through the input, and named procedures with accumulating parameters. Thus, tl essentially captures all features offered by existing document processing languages such as Xslt, fxt, ..."
Abstract - Cited by 61 (9 self) - Add to MetaCart
, or XDuce. It is proved that tl, despite its expressiveness, still allows for effective inverse type inference. This result is obtained by means of a translation of tl transformers into compositions of (stay) macro tree transducers.

PUSHDOWN MACHINES FOR THE MACRO TREE transducer

by Joost Engelfriet, Heiko Vogler , 1986
"... The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree transd ..."
Abstract - Cited by 17 (9 self) - Add to MetaCart
The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree

A comparison of pebble tree transducers with macro tree transducers

by Joost Engelfriet, Sebastian Maneth - Acta Informatica , 2003
"... Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation τ of an n-pebble tree transducer can be realized by a composition of n + 1 0-pebble tree transducers. Next, the pebble t ..."
Abstract - Cited by 43 (11 self) - Add to MetaCart
tree transducer is compared with the macro tree transducer, a well-known model for syntax-directed semantics, with decidable type checking. The 0-pebble tree transducer can be simulated by the macro tree transducer, which, by the first result, implies that (2) τ can be realized by an (n+1)-fold

Composition of restricted Macro Tree Transducers

by Janis Voigtländer, Verantwortlicher Hochschullehrer, Prof Dr. -ing, Heiko Vogler, Lehrstuhl Grundlagen , 2001
"... A special class of functional programs can be modelled by Macro Tree Transducers. We present a technique that can be used to solve the efficiency problems due to creation and consumption of intermediate results in such functional programs, by constructing for two given Macro Tree Transducers, with a ..."
Abstract - Cited by 9 (6 self) - Add to MetaCart
A special class of functional programs can be modelled by Macro Tree Transducers. We present a technique that can be used to solve the efficiency problems due to creation and consumption of intermediate results in such functional programs, by constructing for two given Macro Tree Transducers

Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations

by Joost Engelfriet, Sebastian Maneth - Inform. and Comput , 1998
"... A characterization is given of the class of tree translations definable in monadic second order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with reg ..."
Abstract - Cited by 58 (23 self) - Add to MetaCart
A characterization is given of the class of tree translations definable in monadic second order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs
Results 1 - 10 of 55