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

DOI10.1016/J.TCS.2013.02.007MaRDI QIDQ385017zbMATH OpenOpenAlexFDO

Authors R. Tchougong, C. Nkuimi-Jugnia, B. Fotsing, 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)

Recommendations

• Attribute grammars as recursion schemes over cyclic representations of zippers
• scientific article; zbMATH DE number 4031017
• Composition and evaluation of attribute coupled grammars
• Tree automata and attribute grammars
• The universality of higher-order attributed tree transducers

Cites work

• 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 482779 (Why is no real title available?)
• scientific article; zbMATH DE number 2080046 (Why is no real title available?)
• Attribute Grammars and Categorical Semantics
• Attribute Grammars and Mathematical Semantics
• Attribute grammars and recursive program schemes. I. II
• Attribute grammars as recursion schemes over cyclic representations of zippers
• Composition and evaluation of attribute coupled grammars
• Composition of functions with accumulating parameters
• Deforestation: Transforming programs to eliminate trees
• Generalized sequential machine maps
• Increasing modularity and language-independency in automatically generated compilers
• Initial Algebra Semantics Is Enough!
• Initial Algebra Semantics and Continuous Algebras
• Mappings and grammars on trees
• On building cyclic and shared structures in Haskell
• Semantics of context-free languages
• The Zipper
• The generating power of total deterministic tree transducers
• Using circular programs to deforest in accumulating parameters
• Using circular programs to eliminate multiple traversals of data

Cited in

(4)

• Opacity of artifacts in a workflow system
• Attribute grammars as recursion schemes over cyclic representations of zippers
• Attributed tree grammars
• Equational semantics

Describes a project that uses

Uses Software

• Haskell

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)