Generalized bottom up parsers with reduced stack activity

Computer Journal

Volumn 48, Issue 5, 2005, Pages 565-587

  Scott, Elizabeth ^a   Johnstone, Adrian ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CONTEXT FREE GRAMMARS; EMBEDDED SYSTEMS; THEOREM PROVING;

EMBEDDED RECURSION; GENERALIZED BOTTOM UP PARSERS; STACK ACTIVITY;

RECURSIVE FUNCTIONS;

EID: 24144485839     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/bxh102     Document Type: Article

References (29)

1. Rytter, V. (1995) Context-free recognition via shortest paths computation: a version of Valiant's algorithm Theor. Comput. Sci., 143(2), 343-352.
2. Knuth, D.E. (1965) On the translation of languages from left to right Inform. Control, 8(6), 607-639.
3. Stroustrup, B. (1994) The Design and Evolution of C++. Addison-Wesley Publishing Company, Reading, MA.
4. Dodd, C. and Maslov, V. BtYacc home page. http://www.siber.com/btyacc. Last accessed June 2005.
5. Parr, T.J. (1996) Language translation using PCCTS and C++. Automata Publishing Company, San Jose, CA.
6. Parr, T. ANTLR home page. http://www.antlr.org. Last accessed June 2005.
7. JAVACC project home page. http://javacc.dev.java.net. Last accessed June 2005.
8. Breuer, P.T. and Bowen, J.P. (1995) A PREttier Compiler-Compiler: Generating Higher-order Parsers in C Software Pract. Exper., 25 (11), 1263-1297.
9. Earley, J. An efficient context-free parsing algorithm, Commun. ACM, 13(2), 94-102.
10. Tomita, M. (1986) Efficient parsing for natural language, Kluwer Academic Publishers, Boston.
11. Grune, D. and Jacobs, C. (1990) Parsing Techniques: A Practical Guide, Ellis Horwood, Chichester, England. Available at http://www. cs.vu.nl/~dick/PTAPG.html
12. Lang, B. (1974) Deterministic techniques for efficient non-deterministic parsers. In Proc. 2nd Colloquium on Automata, Lanugages and Programming, University of Saarbrüken, July 29-August 2, LANCS, 14, 255-269.
13. Billot, S. and Lang, B. (1989) The Structure of Shared Forests in Ambiguous Parsing. In Proc. 27th Conf. on Association for Computational Linguistics, Vancouver, British Columbia, Canada, June 26-29, 143-151. Association for Computational Linguistics.
14. Gnu Bison home page. http://www.gnu.org/software/bison. Last accessed June 2005.
15. Eggert, P. On Bison's general parser. http://compilers.iecc.com/comparch/ article/03-01-042. Last accessed June 2005.
16. van den Brand, M.G.J., Heering, J., Klint, P. and Olivier, P.A. (2002) Compiling language definitions: the ASF+SDF compiler. ACM Trans. Progr. Lang. Sys., 24(4), 334-368.
17. Nozohoor-Farshi, R. (1991) GLR parsing for ε-grammars. In Tomita, M. (ed.) Generalized LR Parsing, 60-75. Kluwer Academic Publishers, Netherlands.
18. Scott, E., Johnstone, A. and Hussain, S. Tomita-style generalised LR parsers. Updated Version. Technical Report TR-00-12. Computer Science Department, Royal Holloway, University of London, London.
19. Johnstone, A. and Scott, E. (2002) Generalised reduction modified LR parsing for domain specific language prototyping. In Proc. 35th Annual Hawaii Int. Conf. On System Sciences (HICSS02), Big Island, Hawaii, Jandary 7-10, 282-291. IEEE Computer Society. IEEE, New Jersey.
20. Aho, A.V. and Ullman, J.D. (1972) The Theory of Parsing, Translation and Compiling. Series in Automatic Computation, Vol. 1: Parsing. Prentice-Hall. New Jersey.
21. Aycock, J. and Horspool, N. (1999) Faster generalised LR parsing. In Proc. 8th Int. Conf. Compiler Construction, CC 199, Amsterdam, The Netherlands, March 20-28, LNCS, 1575, 32-46. Springer-Verlag. I
22. Aycock, J., Horspool, R.N., Janousek, J. and Melichar, B. (2001) Even faster generalised LR parsing. Acta Inform., 37(8), 633-651.
23. Johnstone, A. and Scott, E. (2003) Generalised regular parsers. In Hedin, G. (ed.) 12th Int. Conf. Comipler Construction, CC'03, Warsaw, Poland, April 5-13, LNCS, 2622, 232-246.
24. Aho, AV, Sethi, R. and Ullman, J.D. (1986) Compilers: principles techniques and tools. Addison-Wesley, Reading, MA.
25. Scott, E. and Johnstone, A. (2002) Table based parsers with reduced stack activity. Technical Report TR-02-08. Computer Science Department, Royal Holloway, University of London, London.
26. Kernighan, B.W. and Ritchie, D.M. (1988) The C programming language (2nd edn). Prentice Hall, Englewood Cliffs, NJ.
27. Lämmel, R. and Verhoef, C. (2001) Semi-automatic Grammar Recovery. Software Pract. Exper., 31(15), 1395-1438.
28. Johnstone, A., Scott, E. and Economopoulos, G. (2004) The grammar tool box: a case study comparing GLR parsing algorithms. In Hedin, G. and Van Wick, E. (eds) Proc. 4th Workshop on Language Descriptions, Tools and Applications LDTA2004, Barcelona, Spain, April 3, Electronic Notes in Theoretical Computer Science, 110, 97-113.
29. Johnstone, A., Scott, E. and Economopoulos, G. (2004) Generalised parsing: some costs. In Duesterwald, E. (ed.) 13th Int. Conf. Compiler Construction, CC'04 Barcelona, Spain, March 29-April 2, LNCS, 2985, 89-103. Springer-Verlag, Berlin.