PRACTICAL TRANSLATORS FOR LR(K) LANGUAGES
Franklin L. DeRemer · DSpace@MIT (Massachusetts Institute of Technology) · 1969
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).