Linear-time suffix parsing for deterministic languages

Journal of the ACM

Volumn 43, Issue 3, 1996, Pages 524-554

  Nederhof, Mark Jan ^a   Bertsch, Eberhard ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Languages; Theory; Verification

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; FORMAL LOGIC; PROGRAM PROCESSORS;

DECISION PROCEDURE; DETERMINISTIC LANGUAGES; LINEAR TIME SUFFIX PARSING; SYNTACTIC STRUCTURES; TIME COMPLEXITY; VERIFICATION;

CONTEXT FREE LANGUAGES;

EID: 0030143392     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/233551.233555     Document Type: Article

References (24)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1968. Time and tape complexity of pushdown automaton languages. Inf. Com. 13, 186-206.
2. BATES, J., AND LAVIE, A. 1994. Recognizing substrings of LR(k) languages in linear time. ACM Trans. Prog. Lang. Syst. 16, 3 (May), 1051-1077.
3. BERTSCH, E. 1994. An asymptotically optimal algorithm for noncorrecting LL(1) error recovery. Bericht Nr. 176, Fakultät für Mathematik, Ruhr-Universität Bochum.
4. BILLOT, S., AND LANG, B. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, (Vancouver, British Columbia, Canada, June), pp. 143-151.
5. BOUCKAERT, M., PIROTTE, A., AND SNELLING, M. 1975. Efficient parsing algorithms for general context-free parsers. Inf. Sci. 8, 1-26.
6. CORMACK, G. V. 1989. An LR substring parser for noncorrecting syntax error recovery. SIGPLAN Notices 24, 7, 161-169.
7. EARLEY, J. 1970. An efficient context-free parsing algorithm. Commun. ACM 13,1 (Feb.), 94-102.
8. FISCHER, C. N., AND MAUNEY, J. 1992. A simple, fast, and effective LL(1) error repair algorithm. Acta Inf. 29, 109-120.
9. GRAHAM, S. L., HARRISON, M. A., AND RUZZO, W. L. 1980. An improved context-free recognizer. ACM Trans. Prog. Lang. Syst. 2, 3 (July), 415-462.
10. GRUNE, D., AND JACOBS, C. J. H. 1990. Parsing Techniques, A Practical Guide. Ellis Horwood, Chichester, England.
11. LANG, B. 1974. Deterministic techniques for efficient non-deterministic parsers. In Automata, Languages and Programming, 2nd Colloquium. Lecture Notes in Computer Science, vol. 14. Springer-Verlag, New York, pp. 255-269.
12. LANG, B. 1988. Parsing incomplete sentences. In Proceedings of the 12th International Conference on Computational Linguistics, vol. 1. (Budapest, Hungary, Aug.). pp. 365-371.
13. LANG, B. 1991. Towards a uniform formal framework for parsing. In Current Issues in Parsing Technology, chapter 11, M. Tomita, ed. Kluwer Academic Publishers, pp. 153-171.
14. LAVIE, A., AND TOMITA, M. 1993. GLR* - An efficient noise-skipping parsing algorithm for context free grammars. In Proceedings of the 3rd International Workshop on Parsing Technologies. Tilburg (The Netherlands) and Durbuy (Belgium), pp. 123-134.
15. LEERMAKERS, R. 1992. Recursive ascent parsing: From Earley to Marcus. Theoret. Comput. Sci. 104, 299-312.
16. LEISS, H. 1990. On Kilbury's modification of Earley's algorithm. ACM Trans. Prog. Lang. Syst. 12, 4 (Oct.). 610-640.
17. NEDERHOF, M. J. 1994. Linguistic parsing and program transformations. Ph.D dissertation. Univ. Nijmegen.
18. REKERS, J., AND KOORN, W. 1991. Substring parsing for arbitrary context-free grammars. SIGPLAN Notices 26, 5, 59-66.
19. RICHTER, H. 1985. Noncorrecting syntax error recovery. ACM Trans. Prog. Lang. Syst. 7, 3 (July) 478-489.
20. SAITO, H. 1990. Bi-directional LR parsing from an anchor word for speech recognition. In Papers presented to the 13th International Conference on Computational Linguistics, vol. 3. pp. 237-242.
21. SIPPU, S., AND SOISALON-SOININEN, E. 1990. Parsing Theory, Vol. II: LR(k) and LL(k) Parsing. In EATCS Monographs on Theoretical Computer Science, vol. 20. Springer-Verlag, New York.
22. TOMITA, M. 1986. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Dordrecht, The Netherlands.
23. VALIANT, L. G. 1975. General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10, 308-315.
24. VAN DEUDEKOM, B., AND KOOIMAN, P. 1993. Top-down non-correcting error recovery in LLgen. Report IR-338, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.