
TL;DR
This tutorial explains tabular parsing techniques for context-free grammars, covering algorithms like Earley's, CKY, and LR parsing, along with parse tree construction and related issues.
Contribution
It provides a comprehensive overview of tabular parsing methods based on nondeterministic push-down automata, integrating multiple algorithms and practical considerations.
Findings
Detailed explanation of Earley's algorithm
Comparison of CKY and LR parsing methods
Guidance on parse tree construction
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · DNA and Biological Computing
