Pages that link to "Item:Q1157968"
From MaRDI portal
The following pages link to The formal power of one-visit attribute grammars (Q1157968):
Displaying 17 items.
- Simple multi-visit attribute grammars (Q584934) (← links)
- Modular tree transducers (Q807012) (← links)
- A note on one-pass evaluation of attribute grammars (Q1064793) (← 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)
- Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
- Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Tree transducers with external functions (Q1208712) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← 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)
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347) (← links)
- k-visit attribute grammars (Q3928271) (← links)
