Abstract
We present a parsing technique which is a hybrid of Earley's method and the LR(k) methods. The new method retains the ability of Earley's method to parse using arbitrary context-free grammars. However, by using precomputed LR(k) sets of items, we obtain much faster recognition speeds while also reducing memory requirements.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Donnelly, C., and Stallman, R. BISON: Reference Manual. Free Software Foundation, Cambridge, MA, 1992.
Earley, J. An Efficient Context-Free Parsing Algorithm. Comm. ACM 13, 2 (Feb. 1970), 94–102.
Earley, J. An Efficient Context-Free Parsing Algorithm. Ph.D. Thesis, Camegie-Mellon University, 1968.
Grune, D., and Jacob, C.J.H. Parsing Techniques: a practical guide. Ellis Horwood, Chichester, 1990.
Johnson, S.C. YACC: Yet Another Compiler-Compiler. UNIX Programmer's Supplementary Documents, vol 1, 1986.
Tomita, M. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McLean, P., Horspool, R.N. (1996). A faster Earley parser. In: Gyimóthy, T. (eds) Compiler Construction. CC 1996. Lecture Notes in Computer Science, vol 1060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61053-7_68
Download citation
DOI: https://doi.org/10.1007/3-540-61053-7_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61053-3
Online ISBN: 978-3-540-49939-8
eBook Packages: Springer Book Archive