Tabular Parsing
| dc.creator | Nederhof, Mark-Jan | |
| dc.creator | Satta, Giorgio | |
| dc.date | 2004-04-05 | |
| dc.date.accessioned | 2026-07-07T03:21:05Z | |
| dc.date.available | 2026-07-07T03:21:05Z | |
| dc.description | This is a tutorial on tabular parsing, on the basis of tabulation of nondeterministic push-down automata. Discussed are Earley's algorithm, the Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse trees, and further issues. | |
| dc.description | 21 pages, 14 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0404009 | |
| dc.identifier | http://arxiv.org/abs/cs/0404009 | |
| dc.identifier | M.-J. Nederhof and G. Satta. Tabular Parsing. In C. Martin-Vide, V. Mitrana, and G. Paun, editors, Formal Languages and Applications, Studies in Fuzziness and Soft Computing 148, pages 529-549. Springer, 2004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32065 | |
| dc.subject | Computation and Language | |
| dc.subject | F.4.2 | |
| dc.title | Tabular Parsing | |
| dc.type | text |