Elkhound: A fast, practical GLR parser generator

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

Volumn 2985, Issue , 2004, Pages 73-88

  McPeak, Scott ^a   Necula, George C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; FORMAL LANGUAGES; HIGH LEVEL LANGUAGES;

ASYMPTOTICALLY EFFICIENT; BOTTOM UP; COMPETITIVE PERFORMANCE; CONSTANT FACTORS; GENERALIZED LR PARSING; HYBRID ALGORITHMS; PARSER GENERATORS;

ALGORITHMS;

EID: 35048843789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24723-4_6     Document Type: Article

References (24)

1. Johnson, S.C.: YACC: Yet another compiler compiler. In: UNIX Programmer's Manual (7th edn). Volume 2B. (1979)
2. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley (1986)
3. Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In Loeckx, J., ed.: Automata, Languages and Programming. Volume 14 of Lecture Notes in Computer Science. Springer (1974) 255-269
4. Tomita, M.: Efficient Parsing for Natural Language. Int. Series in Engineering and Computer Science. Kluwer (1985)
5. Rekers, J.: Parser Generation for Interactive Environments. PhD thesis, University of Amsterdam, Amsterdam, The Netherlands (1992)
6. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13 (1970) 94-102
7. Heering, J., Hendriks, P.R.H., Klint, P., Rekers, J.: The syntax definition formalism SDF - reference manual. SIGPLAN Notices 24 (1989) 43-75
8. Donnelly, G., Stallman, R.M.: Bison: the YACC-compatible Parser Generator, Bison Version 1.28. Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139 (1999)
9. McPeak, S.: Elkhound: A fast, efficient GLR parser generator. Technical Report CSD-02-1214, University of California, Berkeley (2002)
10. Knuth, D.E.: On the translation of languages from left to right. Information and Control 8 (1965) 607-639
11. Nozohoor-Farshi, R.: GLR parsing for e-grarnmars. In Tomita, M., ed.: Generalized LR Parsing. Kluwer (1991) 61-75
12. International Organization for Standardization: ISO/IEC 14882:1998: Programming languages -C++. International Organization for Standardization, Geneva, Switzerland (1998)
13. Visser, E.: Scannerless generalized-LR parsing. Technical Report P9707, University of Amsterdam (1997)
14. Alonso, M.A., Cabrero, D., Vilares, M.: Construction of efficient generalized LR parsers. In: WIA: International Workshop on Implementing Automata, LNCS, Springer-Verlag (1997)
15. 3). In Tomita, M., ed.: Generalized LR Parsing. Kluwer (1991) 43-60
16. van den Brand, M., de Jong, H.A., Klint, P., Olivier, P.A.: Efficient annotated terms. Software Practice and Experience 30 (2000) 259-291
17. Earley, J.: Ambiguity and precedence in syntax description. Acta Informatica 4 (1975) 183-192
18. van den Brand, M., Scheerder, J., Vinju, J.J., Visser,'E.: Disambiguation filters for scannerless generalized LR parsers. In: Compiler Construction. (2002) 143-158
19. Wagner, T.A., Graham, S.L.: Incremental analysis of real programming languages. In: ACM Programming Language Design and Implementation (PLDI). (1997) 3143
20. Graham, S.L., Harrison, M.A., Ruzzo, W.L.: An improved context-free recognizer. ACM Transactions on Programming Languages and Systems (TOPLAS) 2 (1980) 415-462
21. McLean, P., Horspool, R.N.: A faster Earley parser. In: Compiler Construction. (1996) 281-293
22. Schröer, F.W.: The ACCENT compiler compiler, introduction and reference. Technical Report 101, German National Research Center for Information Technology (2000)
23. Aycock, J., Horspool, R.N., Janoušek, J., Melichar, B.: Even faster generalized LR parsing. Acta Informatica 37 (2001) 633-651
24. Hutton, G.: Higher-order functions for parsing. Journal of Functional Programming 2 (1992) 323-343