An efficient augmented-context-free parsing algorithm
Computational Linguistics
On Kilbury's modification of Earley's algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A recursive ascent Earley parser
Information Processing Letters
Generalized steady-state, a system concept in simulation
Proceedings of the 4th international symposium on Systems analysis and simulation
An efficient context-free parsing algorithm
Communications of the ACM
Generalized left corner parsing
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized L.R. Parsing
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
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
Non-deterministic recursive ascent parsing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
LR recursive transition networks for Earley and Tomita parsing
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A practical comparison of parsing strategies
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
Graph-structured Stack and natural language parsing
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Stroing logical form in a shared-packed forest
Computational Linguistics
Surface-marker-based dialog modelling: A progress report on the MAREDI project
Natural Language Engineering
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Computing first and follow functions for feature theoretic grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Improved left-corner chart parsing for large context-free grammars
New developments in parsing technology
Probabilistic parsing strategies
Journal of the ACM (JACM)
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
| Hi-index | 0.00 |
We show how techniques known from generalized LR parsing can be applied to left-corner parsing. The resulting parsing algorithm for context-free grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compact, and the basic parsing technique can more easily be adapted to arbitary context-free grammars.The algorithm can be seen as an optimization of algorithms known from existing literature. A strong advantage of our presentation is that it makes explicit the role of left-corner parsing in these algorithms.