论文信息 - A New Top-Down Parsing Algorithm for Left-Recursive DCGs - 字舞流文

A New Top-Down Parsing Algorithm for Left-Recursive DCGs

In this paper we introduce a new parsing algorithm, called cancellation parsing. Deterministic cancellation parsing with lookahead k can handle the C(k) grammars, which include the LL(k) grammars and are contained in the LC(k) grammars.

Mark-Jan Nederhof

[1] Kuniaki Uehara,et al. A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique , 1984, SLP.

[2] Susumu Kuno,et al. The predictive analyzer and a path elimination technique , 1965, CACM.

[3] Pedro Rangel Henriques. A Semantic Evaluator Generating System in Prolog , 1988, PLILP.

[4] David H. D. Warren,et al. Parsing as Deduction , 1983, ACL.

[5] Yuji Matsumoto,et al. A Parsing System Based on Logic Programming , 1987, IJCAI.

[6] 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..

[7] Marc Dymetman. A Generalized Greibach Normal Form for Definite Clause Grammars , 1992, COLING.

[8] René Leermakers,et al. Non-deterministic Recursive Ascent Parsing , 1991, EACL.

[9] Daniel J. Rosenkrantz,et al. Deterministic Left Corner Parsing (Extended Abstract) , 1970, SWAT.

[10] Richard A. Frost. Guarded attribute grammars: top down parsing and left recursive productions , 1992, SIGP.

[11] Mark-Jan Nederhof,et al. Generalized Left-Corner Parsing , 1993, EACL.

[12] Jacques Cohen,et al. Parsing and compiling using Prolog , 1987, TOPL.

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