Journal of the ACM (JACM)
Syntax-directed least-errors analysis for context-free languages: a practical approach
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Formal development of correct algorithms: An example based on earley's recogniser
Proceedings of ACM conference on Proving assertions about programs
Parallel Recognition and Parsing on the Hypercube
IEEE Transactions on Computers
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
VLSI architectures for high speed recognition of context-free languages and finite-state languages
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
TAL recognition in O(M(n2)) time
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several advantages over the original. First, the new algorithm not only is conceptually simpler than Earley's, but also allows significant speed improvements. Second, our algorithm serves to explain the connections between Earley's algorithm and the Cocke-Kasami-Younger algorithm. Third, our algorithm allows an implementation which uses only 0(n2/log n) operations on bit vectors of length n, or 0(n3/log n) operations on a RAM. This makes it the fastest known on-line context free language recognition algorithm.