Affiliation:
1. General Electric Research and Development Center, Schenectady, New York
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference9 articles.
1. A syntax directed compiler for ALGOL 60
2. Realization of generalized good translation algorithm on computer. Kybernelika Cislo 5;Rocnik,1967
3. Recognition and parsing of context-free languages in time n;YOUNGER D. H;Inform. Contr.,1967
Cited by
162 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献