Tabular Parsing

Authors

Nederhof, Mark-Jan

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.
21 pages, 14 figures

Keywords

Computation and Language, F.4.2

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32065

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0404009
http://arxiv.org/abs/cs/0404009
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

Collections