Practical Translators for LR(k) Languages
| dc.contributor.advisor | Evans, Arthur | en_US |
| dc.contributor.author | Deremer, Franklin Lewis | en_US |
| dc.date.accessioned | 2023-03-29T14:54:35Z | |
| dc.date.available | 2023-03-29T14:54:35Z | |
| dc.date.issued | 1969-10 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149384 | |
| dc.description.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). | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-065 | |
| dc.relation.ispartofseries | MAC-TR-065 | |
| dc.title | Practical Translators for LR(k) Languages | en_US |
| dc.identifier.oclc | 14184190 |
