Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

DOI10.1016/j.tcs.2013.02.007zbMath1291.68214OpenAlexW2072934587MaRDI QIDQ385017

R. Tchougong, B. Fotsing, C. Nkuimi-Jugnia, Eric Badouel

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

zbMATH Keywords

attribute grammarsattribute evaluationcyclic data structuredescriptional compositiontree transducerszipper

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using circular programs to eliminate multiple traversals of data
• Deforestation: Transforming programs to eliminate trees
• Increasing modularity and language-independency in automatically generated compilers
• Composition and evaluation of attribute coupled grammars
• Attribute grammars and recursive program schemes. I. II
• 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!
• Attribute Grammars and Mathematical Semantics
• Initial Algebra Semantics and Continuous Algebras
• The Zipper
• Composition of functions with accumulating parameters
• Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers
• Semantics of context-free languages
• Mappings and grammars on trees