Generalized Deterministic Parsers
Generalized deterministic parsers are general breadth-first context-free parsers that gain efficiency by exploiting the methods and tables used by deterministic parsers, even if these tables have conflicts (inadequate states) in them. Viewed alternatively, generalized deterministic parsers are deterministic parsers extended with a breadth- first search mechanism so they will be able to operate with tables with some multiple, conflicting entries. The latter view is usually more to the point.
KeywordsParse Tree Prediction Phase Parsing Algorithm Prediction Tree Inadequate State
Unable to display preview. Download preview PDF.