Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient incremental LR parsing for syntax-directed editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Formalization of Transition Diagram Systems
Journal of the ACM (JACM)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
A practical algorithm for generating LR parsers maintaining immediate error detection (abstract)
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
ACM Computing Surveys (CSUR)
An algorithm for the construction of bounded-context parsers
Communications of the ACM
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized left corner parsing
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
GLR parsing with multiple grammars for natural language queries
ACM Transactions on Asian Language Information Processing (TALIP)
PCFG Learning by Nonterminal Partition Search
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
The lane tracing algorithm for constructing LR(k) parsers
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A technique for speeding up LR(k) parsers
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The care and feeding of LR(k) grammars
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the construction of LR(k) analyzers
ACM '71 Proceedings of the 1971 26th annual conference
On directly constructing LR(k) parsers without chain reductions
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Empirical comparison of LR(k) and precedence parsers
ACM SIGPLAN Notices
Learning grammars for different parsing tasks by partition search
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Applications of language theory to compiler design
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Journal of Computer and System Sciences
| Hi-index | 48.25 |
A practical method for constructing LR(k) processors is developed. These processors are capable of recognizing and parsing an input during a single no-backup scan in a number of steps equal to the length of the input plus the number of steps in its derivation.The technique presented here is based on the original method described by Knuth, but decreases both the effort required to construct the processor and the size of the processor produced. This procedure involves partitioning the given grammar into a number of smaller parts. If an LR(k) processor can be constructed for each part (using Knuth's algorithm) and if certain conditions relating these individual processors are satisfied, then an LR(k) processor for the entire grammar can be constructed for them. Using this procedure, an LR(1) parser for ALGOL has been obtained.