Abstract
Stack-attributed tree transducers extend attributed tree transducers with a pushdown stack device for attribute values, which make them strictly more powerful. This paper presents an algorithm for the composition of stack-attributed tree transducers with attributed tree transducers. The algorithm is an extension of the existing method to compose attributed tree transducers. It leads to some natural closure properties of the corresponding classes of tree transformations.
Original language | English |
---|---|
Pages (from-to) | 1-38 |
Number of pages | 38 |
Journal | Theory of Computing Systems |
Volume | 44 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2009 Jan 1 |
Externally published | Yes |
Keywords
- Attribute grammar
- Deforestation
- Descriptional composition
- Event-driven model
- XML stream transformation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics