Philippe McLean and R. Nigel Horspool. A faster Earley parser. In Proceedings of the International Conference on Compiler Construction, pages 281-293, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Construction of Efficient Generalized LR Parsers - Alonso, Cabrero, Vilares (1997) (1 citation) (Correct)
.... bounds [9] Some approaches also use transformations in the construction of the LR automaton and in these the treatment of cyclicity is even more complex and so is 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 for arbitrary context free grammars which is derived, in a natural way, from the well known Earley s algorithm, preserving cubic time complexity in the worst case ....
P. McLean and R. N. Horspool. A faster Earley parser. In Proc. of International Conference on Compiler Construction (CC'96), pages 281--293, Linkopen, Sweden, 1996.
Construction of Efficient Generalized LR Parsers - Alonso (1997) (1 citation) (Correct)
.... bounds [10] Some approaches also use transformations in the construction of the LR automaton and in these the treatment of cyclicity is even more complex and so is often avoided [7] In recent years there has been a great interest in knowing how one parsing algorithm can be derived from another [7, 12, 6]. Usually, the start point for this comparison is Earley s algorithm [3] We propose a generalized LR(1) and LALR(1) parsing algorithm for arbitrary context free grammars which is derived, in a natural way, from the well known Earley s algorithm, preserving cubic time complexity in the worst case ....
McLean, P., Horspool, R. N.: A faster Earley parser. Proc. of International Conference on Compiler Construction (1996) 281--293
Practical Earley Parsing - Aycock, Horspool (2002) (2 citations) Self-citation (Horspool) (Correct)
....#. E. AAAA. A AAAA. A A A S a E a E a E 01 2 3 456 7 FIGURE 5. LR(0) # DFA. basis for general parsing algorithms dates back to the early 1970s [17] Traditional types of deterministic parsing automata (e.g. LR and LALR) have been applied with great success in Earley parsers [18] and Earley like parsers [19, 20, 21] Conceptually, this has the effect of precomputing groups of Earley items which must appear together in an Earley set, thus reducing the amount of work the Earley algorithm must perform at parse time. We note that the parsing algorithm described in [16] is ....
....of finite automata in Earley parsers because of a vexing implementation issue: the parser must keep track of which parent pointers and LR(0) items belong together. This leads to complex, inelegant implementations, such as an Earley item being represented by a tuple containing lists inside lists [18]. We have previously shown how to solve this problem by splitting the states of an LR(0) DFA and using a slightly non deterministic LR(0) automaton instead [9] This exploits the fact that an Earley parser is effectively simulating nondeterminism. This state splitting idea may be extended to the ....
McLean, P. and Horspool, R. N. (1996) A faster Earley parser. In Proc. 6th Int. Conf. on Compiler Construction,Linkoping, Sweden, April 24--26. Lecture Notes in Computer Science, 1060, 281--293. Springer, Berlin.
Directly-Executable Earley Parsing - Aycock, Horspool (2001) (2 citations) Self-citation (Horspool) (Correct)
.... F 9 n F T E E T 19 E E T 25 T T F F F 18 T T T F 24 Fig. 5. Partial LR(0) DFA for GE . Shading denotes start states. Returning 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 implementation. However, we realized as a result of Observation 4 that the Predictor really just corresponds to making a transition to a nonkernel state in ....
.... grammar rules, a problem not present in Earley s algorithm (and consequently not present in our Earley parsers) Using deterministic parsers as an ecient basis for general parsing algorithms was suggested by Lang in 1974 [18] However, none of the applications of this idea in Earley parsers [22] and Earley like parsers [2, 6, 26] have explored the bene ts of using an almost deterministic automaton and exploiting Earley s ability to simulate nondeterminism. 7 Future Work By going from DEEP to SHALLOW, we arrived at a parser suited for practical use. This came at a cost, however: as ....
P. McLean and R. N. Horspool. A Faster Earley Parser. Proceedings of the International Conference on Compiler Construction, CC '96, 1996, pp. 281-293.
Extensible Language Implementation - Kolbly (2002) (Correct)
No context found.
Philippe McLean and R. Nigel Horspool. A faster Earley parser. In Proceedings of the International Conference on Compiler Construction, pages 281-293, 1996.
Schrödinger's Token - Aycock, Horspool (2001) (Correct)
No context found.
McLean P, Horspool RN. A faster Earley parser. Proceedings of the 6th International Conference on Compiler Construction, April 1996; 281--293.
A New Approach to the Construction of Generalized LR.. - Alonso, Cabrero, Vilares (1997) (Correct)
No context found.
, pages 281--293, Linkopen, Sweden, 1996.
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