论文信息 - An Alternative Formulation of Cocke-Younger-Kasami's Algorithm

An Alternative Formulation of Cocke-Younger-Kasami's Algorithm

We provide a reformulation of Cocke-Younger-Kasami's algorithm for recognizing context-free languages in which there are no references either to indices of table entries or to the length of the input string. Some top-down analogues of this functional approach are discussed as well.

Peter R. J. Asveld

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

[2] op den Akker,et al. Recognition methods for context-free languages , 1991 .

[3] Derick Wood,et al. A Supernormal-Form Theorem for Context-Free Grammars , 1983, JACM.

[4] Livio Colussi,et al. A Divide-and-Conquer Approach to General Context-Free Parsing , 1983, Inf. Process. Lett..

[5] Klaas Sikkel,et al. Parsing Schemata , 1997, Texts in Theoretical Computer Science An EATCS Series.

[6] Walter J. Savitch,et al. Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[8] Antinus Nijholt,et al. The CYK approach to serial and parallel parsing , 1990 .

[9] René Leermakers,et al. A Recursive Ascent Earley Parser , 1992, Inf. Process. Lett..

[10] Anton Nijholt. Overview of Parallel Parsing Strategies , 1991 .

[11] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .