-
- P. M. Lewis
- General Electric Research and Development Center, Schenectady, New York
-
- R. E. Stearns
- General Electric Research and Development Center, Schenectady, New York
書誌事項
- 公開日
- 1968-07
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/321466.321477
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p>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.</jats:p>
収録刊行物
-
- Journal of the ACM
-
Journal of the ACM 15 (3), 465-488, 1968-07
Association for Computing Machinery (ACM)