Macro tree transducers

doi:10.1016/0022-0000(85)90066-2

Journal of Computer and System Sciences

Volume 31, Issue 1, August 1985, Pages 71-146

https://doi.org/10.1016/0022-0000(85)90066-2 Get rights and content

Under an Elsevier user license

open archive

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.

Cited by (0)

^∗: Current address: University of Leiden, Institute of Applied Mathematics and Computer Science, P.O. Box 9512, 2300 RA Leiden, The Netherlands.

^†: Supported by the “Deutscher Akademischer Austauschdienst” under Grant 311/018/509/2.