Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
DOI10.1016/J.TCS.2013.02.007zbMATH Open1291.68214OpenAlexW2072934587MaRDI QIDQ385017FDOQ385017
R. Tchougong, B. Fotsing, Eric Badouel, C. Nkuimi-Jugnia
Publication date: 29 November 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.007
Recommendations
attribute grammarsattribute evaluationcyclic data structuredescriptional compositiontree transducerszipper
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- Attribute grammars and recursive program schemes. I. II
- Attribute Grammars and Mathematical Semantics
- Deforestation: Transforming programs to eliminate trees
- Title not available (Why is that?)
- Semantics of context-free languages
- Increasing modularity and language-independency in automatically generated compilers
- Composition and evaluation of attribute coupled grammars
- The generating power of total deterministic tree transducers
- Using circular programs to deforest in accumulating parameters
- On building cyclic and shared structures in Haskell
- Generalized sequential machine maps
- Attribute Grammars and Categorical Semantics
- Initial Algebra Semantics Is Enough!
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Zipper
- Title not available (Why is that?)
- Composition of functions with accumulating parameters
- Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers
- Mappings and grammars on trees
- Using circular programs to eliminate multiple traversals of data
Cited In (2)
Uses Software
This page was built for publication: Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385017)
