Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Communications of the ACM
A formal semantics for computer languages and its application in a compiler-compiler
Communications of the ACM
A syntax directed compiler for ALGOL 60
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
On the nonexistence of a phrase structure grammar for ALGOL 60
Communications of the ACM
Context-free grammars on trees
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Programming languages for non-numeric processing—1: TMG—a syntax directed compiler
ACM '65 Proceedings of the 1965 20th national conference
Programming languages for non-numeric processing—2: An introduction to the COGENT programming system
ACM '65 Proceedings of the 1965 20th national conference
Syntax directed translations and the pushdown assembler
Journal of Computer and System Sciences
Properties of syntax directed translations
Journal of Computer and System Sciences
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On syntax-directed transduction and tree transducers
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Applications of language theory to compiler design
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Automated generation of program translation and verification tools using annotated grammars
Science of Computer Programming
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
| Hi-index | 0.00 |
Two schemes for the specification of translations on a context-free grammar are proposed. The first scheme, called a generalized syntax directed translation (GSDT), consists of a context free grammar with a set of semantic rules associated with each production of the grammar. In a GSDT an input word is parsed according to the underlying context free grammar, and at each node of the tree, a finite number of translation strings are computed in terms of the translation strings defined at the descendants of that node. The functional relationship between the length of input and length of output for translations defined by GSDT's is investigated. The second method for the specification of translations is in terms of tree automata - finite automata with output, operating on derivation trees of a context free grammar. It is shown that tree automata provide an exact characterization for those GSDT's with a linear relationship between input and output length.