The craft of Prolog
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
A comparison of rule-invocation strategies in context-free chart parsing
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bottom-up and left-corner parsers collapse together as in the BUP parser of Matsumoto.