论文信息 - Generalized LR parsing for extensions of context-free grammars

Generalized LR parsing for extensions of context-free grammars

We present a Generalized LR parsing algorithm for extensions of context-free grammars. It diiers from previous approaches in the use of dynamic programming techniques to cope with non determin-ism, instead of a graph-structured stack. The steps for deriving the algorithm from the classical Earley's parsing algorithm are shown.

Manuel Vilares | Miguel Á. Alonso Pardo | David Cabrero

[1] Klaas Sikkel,et al. Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms , 2002 .

[2] Eric Villemonte de la Clergerie. Automates a piles et programmation dynamique dyalog : une application a la programmation en logique , 1993 .

[3] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[4] Arturo Trujillo. Computing First And Follow Functions For Feature-Theoretic Grammars , 1994, COLING.

[5] Mark-Jan Nederhof,et al. Increasing the Applicability of LR Parsing , 1993, IWPT.

[6] J. Rekers,et al. Parser Generation for Interactive Environments , 1992 .

[7] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.

[8] Bernard Lang,et al. Towards a Uniform Formal Framework for Parsing , 1991 .

[9] Stuart M. Shieber,et al. Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[10] David H. D. Warren,et al. Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..