论文信息 - Syntax-Directed Transduction

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. Special consideration is given to machines called translators which both transduce and recognize. In particular, some special conditions are investigated under which syntax-directed translations can be performed on (deterministic) pushdown machines. In addition, some time bounds for translations on Turing machines are derived.

Richard Edwin Stearns | Philip M. Lewis | R. Stearns | P. M. Lewis

[1] Journal of the Association for Computing Machinery , 1961, Nature.

[2] Edgar T. Irons,et al. A syntax directed compiler for ALGOL 60 , 1961, CACM.

[3] Anthony G. Oettinger,et al. Automatic syntactic analysis and the pushdown store , 1961 .

[4] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[5] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..

[6] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[7] Jirí Kopriva. Realization of generalized good translation algorithm on computer , 1967, Kybernetika.

[8] K. Culik,et al. WELL TRANSLATABLE GRAMMARS AND ALGOL-LIKE LANGUAGES, , 1968 .