Pages that link to "Item:Q1162363"

The following pages link to Attribute grammars and recursive program schemes. I. II (Q1162363):

Displaying 41 items.

• Systematic debugging method for attribute grammar description (Q287103) (← links)
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
• Basic tree transducers (Q579951) (← links)
• Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
• Modular tree transducers (Q807012) (← links)
• Computational and attribute models of formal languages (Q912638) (← links)
• A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
• Extended multi bottom-up tree transducers (Q1038420) (← links)
• An extension to trees of the Sardinas and Patterson algorithm (Q1050318) (← links)
• Macro tree transducers (Q1073576) (← links)
• Pushdown machines for the macro tree transducer (Q1089810) (← links)
• High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
• Classical and incremental attribute evaluation by means of recursive procedures (Q1097705) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
• The IO- and OI-hierarchies (Q1161273) (← links)
• An implementation of syntax directed functional programming on nested- stack machines (Q1194207) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Tree transducers with external functions (Q1208712) (← links)
• Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
• The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
• The generating power of total deterministic tree transducers (Q1281500) (← links)
• Attributed tree grammars (Q1311961) (← links)
• The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
• Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
• Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
• Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
• Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
• A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347) (← links)
• A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
• Tree Transformations and Dependencies (Q3172824) (← links)
• Définitions récursives par cas (Q3675498) (← links)
• Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
• Can we transform logic programs into attribute grammars ? (Q3991299) (← links)
• Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
• Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers (Q5166620) (← links)
• A pumping lemma for output languages of macro tree transducers (Q5878900) (← links)
• Characterizing attributed tree translations in terms of macro tree transducers (Q6104348) (← links)