Tabular Parsing
<|reference_start|>Tabular Parsing: 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.<|reference_end|>
@article{nederhof2004tabular,
    title={Tabular Parsing},
    author={Mark-Jan Nederhof, Giorgio Satta},
    journal={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},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0404009},
    primaryClass={cs.CL}
}