Directly-executable earley parsing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2027, Issue , 2001, Pages 229-243

  Aycock, John ^a   Horspool, Nigel ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROGRAM COMPILERS;

DETERMINISTIC METHODS; DETERMINISTIC PARSING; PARSING ALGORITHM; PERFORMANCE GAPS; S-METHOD;

COMPUTATIONAL LINGUISTICS;

EID: 23044527562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45306-7_16     Document Type: Conference Paper

References (26)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. M. A. Alonso, D. Cabrero, and M. Vilares. Construction of Efficient Generalized LR Parsers. Proceedings of the Second International Workshop on Implementing Automata, 1997, pp. 131-140.
3. D. T. Barnard and J. R. Cordy. SL Parses the LR Languages. Computer Languages 13, 2 (1988), pp. 65-74.
4. J. R. Bell. Threaded Code.CACM 16, 6 (June 1973), pp. 370-372.
5. A. Bhamidipaty and T. A. Proebsting. Very Fast YACC-Compatible Parsers (For Very Little Effort). Software: Practice and Experience 28, 2 (February 1998), pp. 181-190.
6. th Annual Meeting of the Association for Computational Linguistics, 1989, pp. 143-151.
7. M. van den Brand, A. Sellink, and C. Verhoef. Current Parsing Techniques in Software Renovation Considered Harmful. International Workshop on Program Comprehension, 1998, pp. 108-117.
8. M. Bouckaert, A. Pirotte, and M. Snelling. Efficient Parsing Algorithms for General Context-free Parsers.Information Sciences 8, 1975, pp. 1-26.
9. J. Earley. An Efficient Context-Free Parsing Algorithm, Ph.D. thesis, Carnegie- Mellon University, 1968.
10. J. Earley. An Efficient Context-Free Parsing Algorithm. CACM 13, 2 (February 1970), pp. 94-102.
11. M. A. Ertl and D. Gregg. Hardware Support for Efficient Interpreters: Fast Indirect Branches (Draft). May, 2000.
12. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. Addison-Wesley, 1996.
13. D. Grune and C. J. H. Jacobs. Parsing Techniques: A Practical Guide. Ellis Hor- wood, 1990.
14. R. N. Horspool and M. Whitney. Even Faster LR Parsing. Software: Practice and Experience 20, 6 (June 1990), pp. 515-535.
15. th edition), volume 2B, 1978.
16. P. Klint. Interpretation Techniques. Software: Practice and Experience 11, 1981, pp. 963-973.
17. nd edition), Addison-Wesley, 1998.
18. B. Lang. Deterministic Techniques for Efficient Non-Deterministic Parsers. In Automata, Languages, and Programming (LNCS #14), J. Loeckx, ed., Springer- Verlag, 1974.
19. R. Leermakers. A recursive ascent Earley parser. Information Processing Letters 41, 1992, pp. 87-91.
20. R. Leermakers. Recursive ascent parsing: from Earley to Marcus. Theoretical Computer Science 104, 1992, pp. 299-312.
21. R. Leermakers. The Functional Treatment of Parsing. Kluwer Academic, 1993.
22. P. McLean and R. N. Horspool. A Faster Earley Parser. Proceedings of the International Conference on Compiler Construction, CC’96, 1996, pp. 281-293.
23. T. J. Pennello. Very Fast LR Parsing. Proceedings of the SIGPLAN’86 Symposium on Compiler Construction, SIGPLAN 21, 7 (1986), pp. 145-151.
24. P. Pfahler. Optimizing Directly Executable LR Parsers. Compiler Compilers, Third International Workshop, CC’90, 1990, pp. 179-192.
25. F. W. Schroer. The ACCENT Compiler Compiler, Introduction and Reference. GMD Report 101, German National Research Center for Information Technology, June 2000.
26. M. Vilares Ferro and B. A. Dion. Efficient Incremental Parsing for Context-Free Languages. Proceedings of the 5th IEEE International Conference on Computer Languages, 1994, pp. 241-252.