Defining syntax-directed translations by tree bimorphisms

DOI10.1016/J.TCS.2009.03.009zbMath1191.68747OpenAlexW2113306325MaRDI QIDQ840769

Magnus Steinby, Cătălin Ionuţ Tîrnăucă

Publication date: 14 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.009

zbMATH Keywords

natural language processingtree bimorphismrecognizable tree languagesyntax-directed translation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items (1)

Equational tree transformations

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of extended top-down tree transducers
• Morphismes et bimorphismes d'arbres
• Alphabetic tree relations
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Generalized sequential machine maps
• Tree acceptors and some of their applications
• A syntax directed compiler for ALGOL 60
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions

This page was built for publication: Defining syntax-directed translations by tree bimorphisms