Practical Translators for LR(k) Languages
Name
MIT-LCS-TR-065.pdf
Size
5.83 MB
Format
Adobe PDF
Checksum (MD5)
22acacac34d06e58493717f694a3003e
Author(s)
Deremer, Franklin Lewis
Advisor(s)
Evans, Arthur
Date Issued
October 1969
Series/Report no.
MIT-LCS-TR-065
MAC-TR-065
Abstract
A context-free syntactical translator (CFST) is a machine which defines a translation from one context-free language to another. A transduction grammar is a formal system based on a context-free grammar and it specifies a context-free syntactical translation. A simple suffix transduction grammar based on a context-free grammar which is LR(k) specifies a translation which can be defined by a deterministic push-down automation (DPDA).
Persistent DSpace Link
