Disambiguating grammars by exclusion of sub-parse trees

Acta Informatica

Volumn 33, Issue 6, 1996, Pages 511-522

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030516124     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050055     Document Type: Article

References (24)

1. Aho, A.V., Johnson, S.C, Ullman, J.D.: Deterministic parsing of ambiguous grammars. Comm. ACM 18, 8 (1975), 441-452.
2. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986.
3. Aho, A.V., Ullman, J.D.: A technique for speeding up LR(k) parsers. SIAM J. Computing 2, 2 (1973), 106-127.
4. Anderson, T., Eve, J., Horning, J.J.: Efficient LR(1) parsers. Acta Informatica 2, 1 (1973), 12-39.
5. Billot, S., Lang, B.: The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics. Vancouver, 1989, pp. 143-151.
6. Blikle, A.: Denotational engineering. Science of Computer Programming 12 (1989), 207-253.
7. Blikle, A., Tarlecki, A., Thorup, M.: On conservative extensions of syntax in system development, Theor. Comp. Sci. 90, 1 (1991), 209-233.
8. DeRemer, F., Pennello, T.: Efficient computation of LALR(1) look-ahead sets. ACM Trans. Progr. Lang. Syst. 4, 4 (1982), 615-649.
9. Garey, M.R., Johnson, S.J.: Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
10. Graham, S.L., Harrison, M.A., Ruzzo, W.L.: An Improved Context-Free Recognizer. ACM Trans. Progr. Lang. Syst. 2, 3 (1980), 415-462.
11. Irons, E.T.: A syntax directed compiler for Algol 60. Comm. ACM 4, 1 (1961), 51-55.
12. Kernighan, B.W., Cherry, J.B.: A system for typesetting mathematics. Comm. ACM 18, 3 (1975), 151-157.
13. Knuth, D.E.: On translation of languages from left to right. Information and Control 8, 6 (1965), 607-639.
14. Maddox, W.: Personal Communication, 1993.
15. McNaughton, R.: Parenthesis grammars. J. ACM 14 (1967), 490-500.
16. Pager, D.: Eliminating unit productions from LR(k) parsers. Acta Informatica 9 (1977), 31-59.
17. Sippu, S., Soisalon-Soininen, E.: Parsing Theory, Vol 1: Languages an Parsing; EATCS Monographs on Theoretical Computer Science 15. Springer-Verlag, Berlin, London, 1988.
18. Sippu, S., Soisalon-Soininen, E.: Parsing Theory, Vol 2: LR(k) and LL(k) Parsing; EATCS Monographs on Theoretical Computer Science 20. Springer-Verlag, Berlin, London, 1990.
19. Soisalon-Soininen, E.: On the space optimizing effect of eliminating single productions from LR parsers. Acta Informatica 14 (1980), 157-174.
20. Soisalon-Soininen, E., Ukkonen, E.: A method for transforming grammars into LL(k) form. Acta Informatica 12 (1979), 339-369.
21. Stockmeyer, L.J.: The set basis problem is NP-complete. Report RC-5431, IBM Research Center, Yorktown Heights, NY, 1975.
22. Thorup, M.: Ambiguity for incremental parsing and evaluation. Technical Report PRG-TR-24-92, Programming Research Group of Oxford University, Oxford, 1992.
23. Thorup, M.: Controlled grammatic ambiguity. ACM Trans. Progr. Lang. Syst. 16, 3 (1994) 1024-1050.
24. Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, 1986.