Practical earley parsing

Computer Journal

Volumn 45, Issue 6, 2002, Pages 620-630

  Aycock, John ^a   Horspool, R Nigel ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONTEXT FREE GRAMMARS; FINITE AUTOMATA; THEOREM PROVING;

PARSING;

ALGORITHMS;

EID: 0036452840     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.6.620     Document Type: Article

References (24)

1. Earley, J. (1968) An Efficient Context-Free Parsing Algorithm. PhD Thesis, Carnegie-Mellon University.
2. Earley, J. (1970) An efficient context-free parsing algorithm. Commun. ACM, 13, 94-102.
3. Johnson, S.C. (1978) Yacc: yet another compiler-compiler. Unix Programmer's Manual (7th edn), Vol. 2B. Bell Laboratories, Murray Hill, NJ.
4. Willink, E.D. (2000) Resolution of parsing difficulties. Meta-Compilation for C++. PhD Thesis, University of Surrey, Section F.2, pp. 336-350.
5. van den Brand, M., Sellink, A. and Verhoef, C. (1998) Current parsing techniques in software renovation considered harmful. In Proc. 6th Int. Workshop on Program Comprehension, Ischia, Italy, June 24-26, pp. 108-117. IEEE Computer Society Press, Los Alamitos, CA.
6. Glanville, R.S. and Graham, S.L. (1978) A new method for compiler code generation. In Proc. Fifth Ann. ACM Symp. on Principles of Programming Languages, Tucson, AZ, January 23-25, pp. 231-240. ACM Press, New York.
7. Aho, A.V., Sethi, R. and Ullman, J.D. (1986) Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
8. Bouckaert, M., Pirotte, A. and Snelling, M. (1975) Efficient parsing algorithms for general context-free parsers. Inform. Sci., 8, 1-26.
9. Aycock, J. and Horspool, N. (2001) Directly-executable Earley parsing. In CC 2001-10th International Conference on Compiler Construction, Genova, Italy, April 2-6. Lecture Notes in Computer Science, 2027, 229-243. Springer, Berlin.
10. Grune, D. and Jacobs, C.J.H. (1990) Parsing Techniques: A Practical Guide. Ellis Horwood, New York.
11. Aho, A.V. and Ullman, J.D. (1972) The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing. Prentice-Hall, Englewood Cliffs, NJ.
12. Schröer, F.W. (2000) The ACCENT Compiler Compiler, Introduction and Reference. GMD Report 101, German National Research Center for Information Technology.
13. Aycock, J. (1998) Compiling little languages in Python. In Proc. 7th Int. Python Conf., Houston, TX, November 10-13, pp. 69-77. Foretec Seminars, Reston, VA.
14. Appel, A.W. (1998) Modern Compiler Implementation in Java. Cambridge University Press, Cambridge, UK.
15. Fischer, C.N. and LeBlanc Jr., R.J. (1988) Crafting a Compiler. Benjamin/Cummings, Menlo Park, CA.
16. Graham, S.L., Harrison, M.A. and Ruzzo, W.L. (1980) An improved context-free recognizer. ACM Trans. Program. Languages Syst., 2, 415-462.
17. Lang, B. (1974) Deterministic techniques for efficient non-deterministic parsers. In Automata, Languages, and Programming, Saarbrücken, July 29-August 2. Lecture Notes in Computer Science, 14, 255-269. Springer, Berlin.
18. McLean, P. and Horspool, R.N. (1996) A faster Earley parser. In Proc. 6th Int. Conf. on Compiler Construction, Linköping, Sweden, April 24-26. Lecture Notes in Computer Science, 1060, 281-293. Springer, Berlin.
19. Billot, S. and Lang, B. (1989) The structure of shared forests in ambiguous parsing. In Proc. 27th Ann. Meeting of the Association for Computational Linguistics, Vancouver, Canada, June 26-29, pp. 143-151. Association for Computational Linguistics, Morristown, NJ.
20. Vilares Ferro, M. and Dion, B.A. (1994) Efficient incremental parsing for context-free languages. In Proc. 5th IEEE Int. Conf. on Computer Languages, Toulouse, France, May 16-19, pp. 241-252. IEEE Computer Society Press, Los Alamitos, CA.
21. Alonso, M.A., Cabrero, D. and Vilares, M. (1997) Construction of efficient generalized LR parsers. In Proc. 2nd Int. Workshop on Implementing Automata, London, Canada, September 18-20. Lecture Notes in Computer Science, 1436, 131-140. Springer, Berlin.
22. Aho, A.V., Johnson, S.C. and Ullman, J.D. (1975) Deterministic parsing of ambiguous grammars. Commun. ACM, 18, 441-452.
23. Klint, P. and Visser, E. (1994) Using filters for the disambiguation of context-free grammars. In Proc. ASMICS Workshop on Parsing Theory, Milano, Italy, October 12-14, pp. 1-20. Technical Report 12694, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano.
24. Heering, J., Klint, P. and Rekers, J. (1989) Incremental generation of parsers. In Proc. SIGPLAN '89 Conf. on Programming Language Design and Implementation, Portland, OR, June 21-23, pp. 179-191. ACM Press, New York.