The formal power of one-visit attribute grammars

Engelfriet, Joost; Filé, Gilberto

doi:10.1007/bf00289307

Cited by 47 publications

(21 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the proof, we use a direct construction which is based on the well-known``tupling-selection trick'' (cf., e.g., Theorem 4.1 of [EF81] or Lemma 5.9 of [EV91]). The idea is roughly as follows.…”

Section: Top-down Simulated By Bottom-upmentioning

confidence: 98%

“…Second, there are no advantages of td-tg transducers over bu-tg transducers, because we can prove that for every tree-generating td-tg transducer T, there is a tree-generating bu-tg transducer B which computes the same tree-to-tree translation as T. The construction involves the well-known tupling-selection trick (e.g., Theorem 4.1 of [EF81] or Lemma 5.9 of [EV91]). Roughly speaking, B computes simultaneously the q-translations of the input subtrees for every state q of T. These translations are arranged into one hypergraph (this is the tupling).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers

Engelfriet

Vogler

1998

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deterministic) bottom-up tree transducer except that it translates trees into hypergraphs rather than trees, using hypergraph substitution instead of tree substitution. If every output hypergraph of the transducer is a jungle, i.e., a hypergraph that can be unfolded into a tree, then the tree-to-graph transducer is said to be tree-generating and naturally defines a tree-to-tree translation. We prove that bottom-up tree-to-graph transducers define the same treeto-tree translations as the previously introduced top-down tree-to-graph transducers. This is in contrast with the well-known incomparability of the usual bottom-up and top-down tree transducers.] 1998Academic Press

show abstract

Section: Top-down Simulated By Bottom-upmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers

Engelfriet

Vogler

1998

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is shown in [7] (see also [8]) that IO context-free tree grammars generate the same tree languages as attribute grammars with one synthesized attribute. As shown in [9], arbitrary attribute grammars generate the same tree languages as jungle generating context-free graph grammars (which generalize context-free jungle grammars).…”

Section: G J If and Only Ifmentioning

confidence: 99%

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars

Drewes¹,

Engelfriet²

2015

Acta Cybern

Self Cite

View full text Add to dashboard Cite

show abstract

“…To obtain precise characterizations, we consider two types of tree transducers that are based on attribute grammars: the relabeling attribute grammar (introduced here) and the attributed tree transducer (see [Fu l,EngFil,FHVV,Ku hVog1,Fu lVog]). We prove that mso term graph transducers have the same power as two-stage attribute grammars, of which the first stage is a relabeling attribute grammar, and the second stage is an attributed tree transducer.…”

Section: Attributed Tree Transducersmentioning

confidence: 99%

A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars

Bloem¹,

Engelfriet²

2000

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in terms of the input tree. The attributed tree transducer is an attribute grammar in which all attributes are trees; it is preceded by a look-ahead phase in which all attributes have finitely many values. The main result is that these formalisms are equivalent, i.e., that the attributed tree transducer with look-ahead is an appropriate implementation model for the tree transductions that are specifiable in mso logic. This result holds for mso graph transducers that produce trees with shared subtrees. If no sharing is allowed, the attributed tree transducer satisfies the single use restriction. Academic Press

show abstract

The formal power of one-visit attribute grammars

Cited by 47 publications

References 17 publications

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars

A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars

Contact Info

Product

Resources

About