论文信息 - How to Cover a Grammar

How to Cover a Grammar

A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-deterministic LR-parsers for RTN grammars.

René Leermakers | R. Leermakers

[1] F. E. J. Kruseman Aretz. A New Approach to Earley's Parsing Algorithm , 1989, Sci. Comput. Program..

[2] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[3] Lisette Appelo,et al. Subgrammars, Rule Classes and Control in the Rosetta Translation System , 1987, EACL.

[4] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[5] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .

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

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

[8] Walter L. Ruzzo,et al. An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[9] Anton Nijholt,et al. Context-free grammars: Covers, normal forms, and parsing , 1980, Lecture Notes in Computer Science.