Syntax directed transduction

A transduction is a mapping from one set of sequences to another. A syntax directed transduction is a particular type of transduction which is defined on the grammar of a context free language and which is meant to be a model of part of the translation process used in many compilers. The transduction is considered from an automata theory viewpoint as specifying the input-output relation of a machine. There is a close relationship between a subclass of these transductions, the simple syntax directed transductions, and push-down machines. This relationship is investigated in detail and conditions for such transductions to be performed on push-down machines are obtained. In addition, some time bounds for transductions on Turing machines are derived.