Reducing non-determinism in right nulled GLR parsers

Acta Informatica

Volumn 40, Issue 6-7, 2004, Pages 459-489

  Scott, Elizabeth ^a   Johnstone, Adrian ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN MATRIX MULTIPLICATION; CHOMSKY NORMAL FORM AND GENERALISED LR (GLR); PARSING ALGORITHMS; RIGHT NULLED (RN); TOMITA'S GRAPH STRUCTURED STACK (GSS);

ALGORITHMS; BOOLEAN ALGEBRA; FINITE AUTOMATA; FORMAL LANGUAGES; LINEAR PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS; SHORT CIRCUIT CURRENTS;

CONTEXT FREE GRAMMARS;

EID: 21144449926     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-004-0137-z     Document Type: Article

References (28)

1. Aycock, J., Horspool, N. (1999) Faster generalised LR parsing. Compiler Construction: 8th International Conference, CC'99, vol. 1575 (Lecture Notes in Computer Science), pp. 32-46. Springer, Berlin Heidelberg New York
2. Aycock, J., Horspool, R.N., Janousek, J., Metichar, B. (2001) Even faster generalised LR parsing. Acta Informatica 37(8): 633-651
3. Aho, A.V., Johnson, S.C., Ullman, J.D. (1975) Deterministic parsing of ambiguous grammars. Communications of the ACM 18(8)
4. Aho, A.V., Sethi, R., Ullman, J.D. (1986) Compilers: principles techniques and tools. Addison-Wesley
5. Cooper, D. (1983) Standard Pascal user reference manual, 1st edn. WW Norton & Co
6. Coppersmith, D., Winograd, S. (1990) Matrix multiplication via arithmetic progressions. J. Symbolic Computation 9: 251-280
7. DeRemer, F.L. (1969) Practical translators for LR(k) languages. PhD thesis, Massachussetts Institute of Technology
8. Barley, J. (1970) An efficient context-free parsing algorithm. Communications of the ACM 13(2): 94-102
9. Johnson, S.C. (1975) Yacc-yet another compiler-compiler. Technical Report 32, AT&T Bell Laboratories
10. Johnstone, A., Scott, E. (1998) Generalised recursive descent parsing and follow determinism. In: Koskimies, K. (ed.) Proc. 7th Intnl. Conf. Compiler Construction (CC'98), (Lecture notes in Computer Science 1383), pp. 16-30. Springer, Berlin Heidelberg New York
11. Johnstone, A., Scott, E. (2002) Generalised reduction modified LR parsing for domain specific language prototyping. Proc. 35th Annual Hawaii International Conference On System Sciences (HICSS02), IEEE Computer Society. IEEE, New Jersey
12. Johnstone, A., Scott, E. (2003) Generalised regular parsers. Computer Construction, 12th Intnl, Conf. CC2003. (Lecture Notes in Computer Science 2622), pp 232-246. Springer, Berlin Heidelberg New York
13. Knuth, D.E. (1965) On the translation of languages from left to right. Information and control 8(6): 607-639
14. Lee, L. (2002) Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM 49: 1-15
15. Nozohoor-Farshi, R. (1991) GLR parsing for ε-grammars. In: Tomita, M. (ed.) Generalized LR parsing, pp. 60-75. Kluwer Academic Publishers, Netherlands
16. Rekers, J.G. (1992) Parser generation for interactive environments. PhD thesis, Universty of Amsterdam
17. Rytter, W. (1995) Context-free recognition via shortest paths computation: a version of Valiant's algorithm. Theoretical Computer Science 143(2): 343-352
18. Scott, E., Johnstone, A. (2002) Reducing non-determinism in reduction modified LR(1)-parsers. Technical Report TR-02-04, Royal Holloway, University of London, Computer Science Department
19. Scott, E.A., Johnstone, A.I.C., Economopolous, G.R. (2003) BRN-table based GLR parsers. Technical Report TR-03-06, Royal Holloway, University of London, Computer Science Department
20. Scott, E., Johnstone, A., Hussain, S.S. (2000) Tomita-style generalised LR parsers. UPDATED VERSION. Technical Report TR-00-12, Royal Holloway, University of London, Computer Science Department
21. Stroustrup, B. (1994) The Design and Evolution of C++. Addison-Wesley Publishing Company
22. Tomita, M., Ng, S.-K. (1991) The generalised LR parsing algorithm. In: Tomita, M. (ed.) Generalized LR parsing, pp. 1-16. Kluwer Academic Publishers, Netherlands
23. Tomita, M. (1986) Efficient parsing for natural language. Kluwer Academic Publishers, Boston
24. Tomita, M. (1991) Generalized LR parsing. Kluwer Academic Publishers, Netherlands
25. Valiant, L. (1975) General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10: 308-315
26. van den Brand, M.G.J., Heering, J., Klint, P., Olivier, P.A. (2002) Compiling language definitions: the ASF+SDF compiler. ACM Transactions on Programming Languages and Systems 24(4): 334-368
27. Visser, E. (1997) Syntax definition for langauge prototyping. PhD thesis, Universty of Amsterdam
28. 3. Inform. Control 10(2): 189-208