Tabular Parsing
Preprint
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.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Tabulation of Automata for Tree-Adjoining LanguagesGrammars, 2000
- Parsing schemata and correctness of parsing algorithmsTheoretical Computer Science, 1998
- The Philips automatic train timetable information systemSpeech Communication, 1995
- Principles and implementation of deductive parsingThe Journal of Logic Programming, 1995
- Bidirectional context-free grammar parsing for natural language processingArtificial Intelligence, 1994
- Efficient Parsing for Natural Language1986
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- On the translation of languages from left to rightInformation and Control, 1965