Composing stack-attributed tree transducers
From MaRDI portal
Publication:2272204
Recommendations
- A two-dimensional hierarchy for attributed tree transducers
- Composition closure of linear extended top-down tree transducers
- A characterization of attributed tree transformations by a subclass of macro tree transducers
- Tree automata and attribute grammars
- The universality of higher-order attributed tree transducers
Cites work
- Composition and evaluation of attribute coupled grammars
- Composition of functions with accumulating parameters
- GAG: a practical compiler generator
- High level tree transducers and iterated pushdown tree transducers
- scientific article; zbMATH DE number 3976291 (Why is no real title available?)
- scientific article; zbMATH DE number 4031017 (Why is no real title available?)
- scientific article; zbMATH DE number 3740783 (Why is no real title available?)
- scientific article; zbMATH DE number 3485226 (Why is no real title available?)
- scientific article; zbMATH DE number 1130215 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- Increasing modularity and language-independency in automatically generated compilers
- Macro tree transducers
- Mappings and grammars on trees
- Programming Languages and Systems
- Semantics of context-free languages
- Semantics of context-free languages: Correction
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
This page was built for publication: Composing stack-attributed tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272204)