Translation Equations.
Saved in:
| Title: | Translation Equations. |
|---|---|
| Authors: | Vere, Steven1 |
| Source: | Communications of the ACM. Feb1970, Vol. 13 Issue 2, p83-89. 7p. 1 Chart. |
| Subjects: | Translators (Computer programs), Machine theory, Translating & interpreting, Parsing (Computer grammar), Fuzzy automata, Semantics |
| Abstract: | Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described, string recognition and parsing may be treated as special cases of the translation problem. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
