Right nulled GLR parsers

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 4, 2006, Pages 577-618

  Scott, Elizabeth ^a   Johnstone, Adrian ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

General context free grammars; Generalized LR parsing

Indexed keywords

GENERAL CONTEXT-FREE GRAMMARS; GENERALIZED LR PARSING; SHIFT-REDUCE PARSERS;

ALGORITHMS; POLYNOMIALS;

CONTEXT FREE GRAMMARS;

EID: 33747117006     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1146809.1146810     Document Type: Article

References (46)

1. AHO, A. V., JOHNSON, S. C., AND ULLMAN, J. D. 1975. Deterministic parsing of ambiguous grammars. Commun. ACM 18, 8 (Aug.).
2. AHO, A. V., SETHI, R., AND ULLMAN., J. D. 1986. Compilers: Principles Techniques and Tools. Addison-Wesley, Reading, Mass.
3. AHO, A. V. AND ULLMAN, J. D. 1972. The Theory of Parsing, Translation and Compiling. Series in Automatic Computation, vol. 1 - Parsing. Prentice-Hall, Upper Saddle River, N. J.
4. AYCOCK, J. AND HORSPOOL, N. 1999. Paster generalised LR parsing. In Proceedings of the Compiler Construction, 8th International Conference CC'99. LNCS, vol. 1575. Springer, New York 32-46.
5. BILLOT, S. AND LANG, B. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Conference on Association for Computational Linguistics 143-151.
6. BREUER, P. T. AND BOWEN, J. P. 1995. A PREttier compiler-compiler: Generating higher-order parsers in C. Softw. Pract. Exper. 25, 11 (Nov.), 1263-1297.
7. BUNT, H. AND TOMITA, M., eds. 1991. Recent Advances in Parsing Technology. Text speech and language technology, vol. 1. Kluwer Academic, Hingham, Mass.
8. DEREMER, F. L. 1969. Practical translators for LR(k) languages. Ph.D. thesis, Massachusetts Institute of Technology.
9. DEREMER, F. L. 1971. Simple LR(k) grammars. Commun. ACM 14, 7 (July), 453-460.
10. DODD, C. AND MASLOV, V. 1995. http://compilers.iecc.com/comparch/article/ 95-03-044.
11. EARLEY, J. 1970. An efficient context-free parsing algorithm. Commun. ACM 13, 2 (Feb.), 94-102.
12. EGGERT, P. 2003. http://compilers.iecc.com/comparch/article/03-01-005.
13. GRAHAM, S. L. AND HARRISON, M. A. 1976. Parsing of general context-free languages. Adv. Comput. 14, 77-185.
14. GRUNE, D. AND JACOBS, C. 1990. Parsing Techniques: A Practial Guide. Ellis Horwood, Chichester, England, http://www.cs.vu.nl/~dick/PTAPG.html.
15. HANSON, D. R. AND PROEBSTING, T. A. 2003. A research C# compiler. Tech. Rep. MSR-TR-2003-32, Microsoft Research, Redmond, WA.
16. HAYS, D. 1967. Introductions to Computational Linguistics. Elsevier, New York.
17. IRONS, E. 1961. A syntax directed compiler for Algol 60. Commun. ACM 4, 1, 51-55.
18. JOHNSTONE, A. AND SCOTT, E. 1998. Generalized recursive descent parsing and follow determinism. In Proceedings of the 7th International Conference on Compiler Construction (CC'98), LNCS, vol.1383. K. Koskimies, ed. Springer, Berlin, 16-30.
19. JOHNSTONE, A. AND SCOTT, E. 2002. Generalized reduction modified LR parsing for domain specific language prototyping. In Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS02).
20. JOHNSTONE, A. AND SCOTT, E. 2003. Generalized regular parsers. In Proceedings of the Compiler Construction, 12th International Conference, CC'03, G. Hedin, ed. LNCS, vol. 2622. Springer Berlin, 232-246.
21. JOHNSTONE, A., SCOTT, E., AND ECONOMOPOULOS, G. 2004a. Generalized parsing: Some costs. In Proceedings of the Compiler Construction, 13th International Conference, CC'04, E. Duesterwald, ed. LNCS, vol. 2985. Springer Berlin, 89-103.
22. JOHNSTONE, A., SCOTT, E., AND ECONOMOPOULOS, G. 2004b. The grammar tool box: A case study comparing GLR parsing algorithms. In Proceedings of the 4th Workshop on Language Descriptions, Tools and Applications LDTA2004, G. Hedin and E. V. Wick, eds. Also in Electronic Notes in Theoretical Computer Science. Elsevier, New York.
23. KASAMI, T. 1965. An efficient recognition and syntax analysis algorithm for context-free languages. Tech. Rep. AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Mass.
24. KNUTH, D. E. 1965. On the translation of languages from left to right. Inf. Control 8, 6, 607-639.
25. LANG, B. 1974. Deterministic techniques for efficient nondeterministic parsers. In Proceedings of the Automata, Lanugages and Programming 2nd Colloquium. LNCS, vol. 14. Springer, Berlin, 255-269.
26. LEWIS II, P. M. AND STEARNS, R. E. 1968. Syntax directed transduction. J. ACM 15, 3, 465-488.
27. MCPEAK, S. AND NECULA, G. 2004. Elkhound: A fast, practical GLR parser generator. In Proceedings of the Compiler Construction, 13th Internationl. Conference CC'04, E. Duesterwald, ed. LNCS. Springer, Berlin.
28. NEDERHOF, M.-J. 1994. An optimal tabular parsing algorithm. In Proceedings of the 32nd Meeting of the Association for Computational Linguistics. 117-124.
29. NEDERHOF, M.-J. AND SAEBO, J. J. 1996. Increasing the applicability of LR parsing. In Recent Advances in Parsing Technology, H.Bunt and M. Tomita, eds. Kluwer Academic, Amsterdam, the Netherlands, 35-57.
30. NEDEHHOF, M.-J. AND SATTA, G. 1996. Efficient tabular LR parsing. In Proceedings of the 34th Meeting of the Association for Computational Linguistics. 239-246.
31. NEDERHOF, M.-J. AND SATTA, G. 2004. Tabular parsing. In Formal Languages and Applications, Studies in Fuzziness and Soft Computing 148, G. C.Martin-Vide, V.Mitrana, eds. Springer, New York, 529-549.
32. NOZOHOOR-FAHSHI, R. 1991. GLR parsing for e-grammars. In Generalized LR Parsing, M. Tomita, ed. Kluwer Academic, Amsterdam, the Netherlands, 60-75.
33. PARR, T. J. 1996. Language Translation Using PCCTS and C++. Automata Publishing.
34. REKERS, J. G. 1992. Parser generation for interactive environments. Ph.D. thesis, Universty of Amsterdam.
35. SAKAI, I. 1962. Syntax in universal translation. In Proceedings of the 1961 International Conference on Machine Translation of Languages and Applied Language Analysis. 593-608.
36. SCOTT, E. AND JOHNSTONE, A. 2004. Reducing nondeterminism in right nulled GLR parsers. Acta Informatica 40, 459-489.
37. SCOTT, E., JOHNSTONE, A., AND HUSSAIN, S. S. 2000. Tomita-Style generalized LR parsers. Updated version. Tech. Rep. TR-00-12, Royal Holloway, University of London Dec.
38. SHEIL, B. 1976. Observations on context-free parsing. In Statistical Methods in Linguistics. 71-109.
39. STROUSTRUP, B. 1994. The Design and Evolution of C++. Addison-Wesley, Reading, Mass.
40. TOMITA, M. 1986. Efficient Parsing for Natural Language. Kluwer Academic, Boston.
41. UNGER, S. 1968. A global parser for context-free phrase structure grammars. Comm. ACM 11, 4, 240-246.
42. VALIANT, L. 1975. General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10, 308-315.
43. VAN DEN BRAND, M., HEERING, J., KLINT, P., AND OLIVIER, P. 2002. Compiling language definitions: The ASF+SDF compiler. ACM Trans. Program. Languages Syst. 24, 4, 334-368.
44. VISSER, E. 1997. Syntax definition for langauge prototyping. Ph.D. thesis, Universty of Amsterdam.
45. VISSER, E. 2004. Program transformation with Stratego/XT: Rules, strategies, tools, and systems in StrategoXT-0.9. In Domain-Specific Program Generation, C. et al, ed. LNCS, vol. 3016. Springer, Berlin, 216-238.
46. 3. Inform. Control 10, 2 (Feb.), 189-208.