(Enter summary)
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. (Update)
Context of citations to this paper: More
.... often avoided [7] In recent years there has been a great interest in knowing how one parsing algorithm can be derived from another [7, 11, 6]. Usually, the start point for this comparison is Earley s algorithm [3] We propose a generalized LR(1) and LALR(1) parsing algorithm...
.... to Earley parsing, the core Earley items in an Earley set may be represented using one or more states in an LR(0) DFA [22]. The problem with doing so is that keeping track of which parent pointers and LR(0) items belong together results in a complex, inelegant...
Cited by: More
Extensible Language Implementation - Kolbly (2002)
(Correct)
Schrödinger's Token - Aycock, Horspool (2001)
(Correct)
Practical Earley Parsing - Aycock, Horspool (2002)
(Correct)
Active bibliography (related documents): More All
0.1: Construction of Efficient Generalized LR Parsers - Alonso, Cabrero, Vilares (1997)
(Correct)
0.1: Une Approche Formelle pour la Génération.. - Ferro, Vidal, Gil, Pardo (1995)
(Correct)
0.1: Friendly Incremental Prototyping - Ferro, Pardo (1995)
(Correct)
Similar documents based on text: More All
0.7: Directly-Executable Earley Parsing - Aycock, Horspool (2001)
(Correct)
0.7: Faster Generalized LR Parsing - Aycock, Horspool (1999)
(Correct)
0.5: Recognizing Substrings of LR(k) Languages in Linear Time - Bates, Lavie (1994)
(Correct)
Related documents from co-citation: More All
7: An Efficient Context-free Parsing Algorithm (context) - Earley - 1970
4: Efficient Incremental Parsing for Context-Free Languages
- Ferro - 1992
4: YACC: Yet another compiler-compiler
- Johnson - 1979
BibTeX entry: (Update)
McLean, P., Horspool, R. N.: A faster Earley parser. Proc. of International Conference on Compiler Construction (1996) 281--293 http://citeseer.ist.psu.edu/mclean96faster.html More
@inproceedings{ mclean96faster,
author = "Philippe McLean and R. Nigel Horspool",
title = "A Faster Earley Parser",
booktitle = "Proceedings of International Conference on Compiler Construction {CC 1996}",
publisher = "Springer",
series = "Lecture Notes in Computer Science (LNCS), Vol. 1060",
address = "Linkoping, Sweden",
pages = "281-293",
year = "1996"
month = "April",
url = "citeseer.ist.psu.edu/mclean96faster.html" }
Citations (may not include all citations):
271
YACC: Yet Another Compiler-Compiler
- Johnson - 1986
192
An Efficient Context-Free Parsing Algorithm (context) - Earley - 1970
192
An Efficient Context-Free Parsing Algorithm (context) - Earley - 1968
128
Efficient Parsing for Natural Language (context) - Tomita - 1986
14
Parsing Techniques: a practical guide
- Grune, Jacob - 1990
7
Free Software Foundation (context) - Donnelly, Stallman - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csr.uvic.ca/~nigelh/pubs.html): More
Incremental Generation of LR Parsers - Horspool (1989)
(Correct)
Faster Generalized LR Parsing - Aycock, Horspool (1999)
(Correct)
JAZZ: An Efficient Compressed Format for Java Archive Files - Bradley, Horspool, Vitek (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC