Prolog and natural-language analysis
Prolog and natural-language analysis
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A generalization of the offline parsable grammars
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A symmetrical approach to parsing and generation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A tabulation-based parsing method that reduces copying
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
| Hi-index | 0.00 |
We present, in easily reproducible terms, a simple transformation for offline-parsable grammars which results in a provably terminating parsing program directly top-down interpretable in Prolog. The transformation consists in two steps: (1) removal of empty-productions, followed by: (2) left-recursion elimination. It is related both to left-corner parsing (where the grammar is compiled, rather than interpreted through a parsing program, and with the advantage of guaranteed termination in the presence of empty productions) and to the Generalized Greibach Normal Form for DCGs (with the advantage of implementation simplicity).