Mark-Jan Nederhof
ABSTRACT
We present a new LR algorithm for tree-adjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpler, being very close to traditional LR parsing for context-free grammars. The construction of derived trees and the computation of features also become straightforward.
- A. V. Aho, R. Sethi, and J. D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley. Google Scholar
Digital Library
- 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.Google ScholarCross Ref
- A. Kinyon. 1997. Un algorithme d'analyse LR(0) pour les grammaires d'arbres adjoints lexicalisées. In D. Genthial, editor, Quatriéme conférence annuelle sur Le Traitement Automatique du Langage Naturel, Actes, pages 93--102, Grenoble, June.Google Scholar
- 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. Google ScholarDigital Library
- M.-J. Nederhof. 1998. Linear indexed automata and tabulation of TAG parsing. In Actes des premiéres journées sur la Tabulation en Analyse Syntaxique et Déduction (Tabulation in Parsing and Deduction), pages 1--9, Paris, France, April.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Tomita. 1986. Efficient Parsing for Natural Language. Kluwer Academic Publishers. Google ScholarDigital Library
- An alternative LR algorithm for TAGS
Recommendations
LR parsers for natural languages
ACL '84/COLING '84: Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational LinguisticsMLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a shift-reduce parser which is deterministically guided by a parsing table. A parsing table can be obtained automatically from a ...
A backtracking LR algorithm for parsing ambiguous context-dependent languages
CASCON '06: Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative researchParsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous computer languages requires an ability to generate a parser for arbitrary ...
Parsing extended LR(k) grammars
An extended LR(k) (ELR(k)) grammar is a context free grammar in which the right sides of the productions are regular expressions and which can be parsed from left to right with k symbol look-ahead. We present a practical algorithm for producing small ...
Comments