An alternative LR algorithm for TAGs

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2, Issue , 1998, Pages 946-952

  Nederhof, Mark Jan ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

CONTEXT-FREE GRAMMARS; LR PARSING; SIMPLE++; TREE ADJOINING GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 85149112025     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. A.V. Aho, R. Sethi, and J.D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley.
2. A.K. Joshi. 1987. An introduction to tree adjoining grammars. In A. Manaster-Ramer, editor, Mathematics of Language, pages 87-114. John Benjamins Publishing Company.
3. A. Kinyon. 1997. Un algorithme d'analyse LR(0) pour les grammaires d'arbres adjoints lexicalisees. In D. Genthial, editor, Quatrieme conference annuelle sur Le Traitement Automatique du Langage Naturel, Actes, pages 93-102, Grenoble, June.
4. M.-J. Nederhof and J.J. Sarbo. 1996. Increasing the applicability of LR parsing. In H. Bunt and M. Tomita, editors, Recent Advances in Parsing Technology, chapter 3, pages 35-57. Kluwer Academic Publishers.
5. M.-J. Nederhof. 1998. Linear indexed automata and tabulation of TAG parsing. In Actes des premieres journees sur la Tabulation en Analyse Syntaxique et Deduction (Tabulation in Parsing and Deduction), pages 1-9, Paris, France, April.
6. Y. Schabes and K. Vijay-Shanker. 1990. Deterministic left to right parsing of tree adjoining languages. In 28th Annual Meeting of the ACL, pages 276-283.
7. S. Sippu and E. Soisalon-Soininen. 1990. Parsing Theory, Vol. II: LR(k) and LL(k) Parsing, volume 20 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag.
8. M. Tomita. 1986. Efficient Parsing for Natural Language. Kluwer Academic Publishers.