Efficient tabular LR parsing

13Citations
Citations of this article
87Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar transformations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time, is significantly reduced.

Cite

CITATION STYLE

APA

Nederhof, M. J., & Satta, G. (1996). Efficient tabular LR parsing. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1996-June, pp. 239–246). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981863.981895

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free