SPPF-Style Parsing From Earley Recognisers

  title={SPPF-Style Parsing From Earley Recognisers},
  author={Elizabeth Scott},
  journal={Electr. Notes Theor. Comput. Sci.},
In its recogniser form, Earley’s algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave an outline of a method for turning his recognisers into parsers, but it turns out that this method is incorrect. Tomita’s GLR parser returns a shared packed parse forest (SPPF) representation of all derivations of a given string from a given CFG but is worst case unbounded polynomial order. We have given a modified worst… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

BRN-table based GLR parsers

E. A. Scott, A.I.C. Johnstone, G. R. Economopoulos
Technical Report TR-03-06, • 2003
View 10 Excerpts
Highly Influenced

An efficient context-free parsing algorithm for natural languages

IJCAI 1985 • 1985
View 19 Excerpts
Highly Influenced

Parsing Techniques - A Practical Guide

Monographs in Computer Science • 2008
View 1 Excerpt

Graham and Michael A . Harrison . Parsing of general context - free languages

L. Susan
Advances in Computing • 2005

Parser generation for interactive environments

Jan G. Rekers
PhD thesis, University of Amsterdam, • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…