Author

Cooke

Date of Award

4-1986

Degree Name

Master of Science

Department

Computer Science

Access Setting

Masters Thesis-Open Access

Abstract

Syntax-directed transduction of unrestricted grammars is modeled by 2PDA automata with multisymbol matching production rules. Syntax-directed transduction normal form grammars (SDT) are constructed for unrestricted grammars. Transduction of sequences of derivation directives to sequences of derivation steps is defined for SDT grammars. E2PDA, a superset of 2PDA with input, output, and multi-symbol matching production rules, is formalized. The class of languages generated by unrestricted grammars. E2PDA syntax-directed transducers are conducted for SDT grammars.

Share

COinS