Defining syntax-directed translations by tree bimorphisms
From MaRDI portal
Publication:840769
DOI10.1016/J.TCS.2009.03.009zbMATH Open1191.68747OpenAlexW2113306325MaRDI QIDQ840769FDOQ840769
Authors: 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
Recommendations
Cites Work
- A syntax directed compiler for ALGOL 60
- Bottom-up and top-down tree transformations— a comparison
- Title not available (Why is that?)
- 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
- Composition of top-down and bottom-up tree transductions
- Morphismes et bimorphismes d'arbres
- Compositions of extended top-down tree transducers
- Alphabetic tree relations
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Equational tree transformations
- Translations on a context free grammar
- Efficient translation with linear bimorphisms
- Semantic-syntax-directed translation and its application to image processing
- Title not available (Why is that?)
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
Uses Software
This page was built for publication: Defining syntax-directed translations by tree bimorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840769)
