Notes on LR Parser Design
| dc.creator | Samuelsson, Christer | |
| dc.date | 1996-05-29 | |
| dc.date.accessioned | 2026-07-07T09:10:19Z | |
| dc.date.available | 2026-07-07T09:10:19Z | |
| dc.description | The design of an LR parser based on interleaving the atomic symbol processing of a context-free backbone grammar with the full constraints of the underlying unification grammar is described. The parser employs a set of reduced constraints derived from the unification grammar in the LR parsing step. Gap threading is simulated to reduce the applicability of empty productions. | |
| dc.description | 5 pages, uuncoded, gzipped PostScript | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605033 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605033 | |
| dc.identifier | Coling 94 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151319 | |
| dc.subject | Computation and Language | |
| dc.title | Notes on LR Parser Design | |
| dc.type | text |