Generation of efficient LALR parsers for regular right part grammars
Acta Informatica
The translation method of Rosetta
Computers and Translation
A new approach to earley's parsing algorithm
Science of Computer Programming
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Context-Free Grammars: Covers, Normal Forms, and Parsing
Context-Free Grammars: Covers, Normal Forms, and Parsing
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Subgrammars, rule classes and control in the Rosetta translation system
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Computational Linguistics
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Generalized left-corner parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
An extended theory of head-driven parsing
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
Parsing schemata for grammars with variable number and order of constituents
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Probabilistic parsing strategies
Journal of the ACM (JACM)
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A tabular method for island-driven context-free grammar parsing
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.