Abstract
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. The extension with regular look-ahead is considered.
Original language | English |
---|---|
Pages (from-to) | 71-146 |
Journal | Journal of computer and system sciences |
Volume | 31 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1985 |