Context-Free Grammars: Covers, Normal Forms, and Parsing

Efficient algorithms for automatic construction and compactification of parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)

Grammatical abstraction and incremental syntax analysis in a language-based editor

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation

Semiring parsing

Computational Linguistics

How to cover a grammar

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics

Compact non-left-recursive grammars using the selective left-corner transform and factoring

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1

NARA: a two-way simultaneous interpretation system between Korean and Japanese-a methodological study

COLING '86 Proceedings of the 11th coference on Computational linguistics

Efficient probabilistic top-down and left-corner parsing

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics

Probabilistic parsing strategies

Journal of the ACM (JACM)

Probabilistic parsing strategies

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics

Optimal reduction of rule length in linear context-free rewriting systems

NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics

On LR parsing with selective delays

CC'13 Proceedings of the 22nd international conference on Compiler Construction

Finding the smallest binarization of a CFG is NP-hard

Journal of Computer and System Sciences