Linear time parsers for classes of non context free languages

Theoretical Computer Science

Volumn 165, Issue 2, 1996, Pages 355-390

  Kulkarni, Sulekha R ^a   Shankar, Priti ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT FREE GRAMMARS; MATHEMATICAL TECHNIQUES; MATHEMATICAL TRANSFORMATIONS; TREES (MATHEMATICS);

DETERMINISTIC PARSERS; TREE ADJOINING GRAMMARS (TAG); TWO LEVEL CONTROL GRAMMARS;

CONTEXT FREE LANGUAGES;

EID: 0346614644     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00231-6     Document Type: Article

References (17)

1. A.V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Vols. 1 and 2 (Prentice-Hall, Englewood Cliffs, NJ, 1972).
2. G. Gazdar, Applicability of indexed grammars to natural languages, in: Natural Language Parsing and Linguistic Theories (Reidel, Dordrecht, 1988) 69-94.
3. A.K. Joshi, How much context-sensitivity is necessary for characterizing structural descriptions - tree adjoining grammars, in: D. Dowty, L. Karttunen and A. Zwicky, eds., Natural Language Processing - Theoretical, Computational and Psychological Perspectives (Cambridge Univ. Press, New York, 1985).
4. A.K. Joshi, L.S. Levy and M. Takahashi, Tree adjunct grammars, J. Comput. System Sci. 10 (1975) 133-163.
5. S.R. Kulkarni, Deterministic parsing algorithms for classes beyond CFLs, M.Sc. (Eng.) Thesis, Indian Institute of Science, 1995.
6. B. Lang, Deterministic techniques for efficient nondeterministic parsers, in: J. Loeckx, ed., Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 14 (Springer, Berlin, 1974) 255-269.
7. M. Palis and S. Shende, Upper bounds on recognition of a hierarchy of non-context-free languages, Theoret. Comput. Sci. 98 (1992) 289-319.
8. C. Pollard, Generalised phrase structure grammars, head grammars and natural language, Ph.D. Thesis, Stanford University, 1984.
9. O. Rambow, K. Vijay-Shanker and D.J. Weir, Parsing D-tree grammars, in: Proc. 4th Internat. Workshop on Parsing Technologies, 1995.
10. Y. Schabes and K. Vijay-Shanker, Deterministic left to right parsing of tree adjoining languages, in: 28th meeting of the Association for Computational Linguistics (ACL'90), Pittsburgh.
11. M.J. Steedman, Combinatory grammars and parasitic gaps, Natural Language Linguistic Theory 5 (1987) 403-439.
12. M. Tomita, An efficient augmented context-free parsing algorithm, Computational Linguistics 13 (1987) 31-46.
13. K. Vijay-Shanker, A study of tree adjoining grammars, Ph.D. Thesis, University of Pennsylvania, 1987.
14. K. Vijay-Shanker and A.K. Joshi, Some computational properties of tree adjoining grammars, in: 23rd Meeting of the Association for Computational Linguistics (ACL'85), Chicago.
15. K. Vijay-Shanker and D.J. Weir, The equivalence of four extensions of context-free grammars, Math. Systems Theory 27 (1994) 511-546.
16. D.J. Weir, A geometric hierarchy beyond context-free languages, Theoret. Comput. Sci. 104 (1992) 235-261.
17. D.J. Weir, Linear iterated pushdowns, Computational Intelligence 10 (1994) 422-430.