Two well-known formalism for the specification and computation of tree transduction are compared f the Mso graph transducer and the attributed tree transducer with look-ahead, respectively. The Mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in terms of the input tree. The attributed tree transducer is an attribute grammar in which all attributes are trees; it is preceded by a look-ahead phase in which all attributes have finitely many values. The main result is that these formalisms are equivalent, i.c., that the attributed tree transducer with look-ahead is an appropriate implementation model for the tree transductions that are specifiable in Mso logic. This result holds for Mso graph transducers that produce trees with shared subtrees. If no sharing is allowed, the attributed tree transducer satisfies the sing1e use restriction.
展开▼
