An efficient context-free parsing algorithm
Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
A practical method for constructing LR (k) processors
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
PAL—a language designed for teaching programming linguistics
ACM '68 Proceedings of the 1968 23rd ACM national conference
Formal languages and their relation to automata
Formal languages and their relation to automata
A new analysis of LALR formalisms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Early error detection in syntax-driven parsers
IBM Journal of Research and Development
A practical arbitrary look-ahead LR parsing technique
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
An efficient augmented-context-free parsing algorithm
Computational Linguistics
The syntax of APL, an old approach revisited
APL '87 Proceedings of the international conference on APL: APL in transition
On the (non-) relationship between SLR(1) and NQLALR(1) grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient construction of LR(k) states and tables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
LL and LR translators need k1 lookahead
ACM SIGPLAN Notices
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
Journal of the ACM (JACM)
On the relationship between LL(1) and LR(1) grammars
Journal of the ACM (JACM)
Generation of LR parsers by partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Methods for Computing LALR(k) Lookahead
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inessential Error Entries and Their Use in LR Parser Optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Computation of LALR(1) Look-Ahead Sets
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operations on sparse relations
Communications of the ACM
Analyses of deterministic parsing algorithms
Communications of the ACM
Automatic error recovery for LR parsers
Communications of the ACM
Deterministic parsing of ambiguous grammars
Communications of the ACM
Extended LL(k) grammars and parsers
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
A forward move algorithm for LR error recovery
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Deterministic parsing of ambiguous grammars
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Elimination of single productions from LR parsers in conjunction with the use of default reductions
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Foundations of Fast Communication via XML
Annals of Software Engineering
A new approach to teaching a first course in compiler construction
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
Microprogrammed subprocessors for compilation and execution of high-level languages
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
Microinstruction sequencing and structured microprogramming
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
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
Error recovery for Simple LR(k) parsers
ACM '76 Proceedings of the 1976 annual conference
Formal specification and automatic programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Design and implementation of a relational database on a minicomputer
ACM '77 Proceedings of the 1977 annual conference
An integral approach to user assistance
CHI '81 Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems. (Part - II): Human Interface and the User Interface - Volume 1981
On directly constructing LR(k) parsers without chain reductions
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Building collections of LR(K) items with partial expansion of lookahead strings
ACM SIGPLAN Notices
LR parsers for natural languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on 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
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACM SIGPLAN Notices
Securing web application code by static analysis and runtime protection
Proceedings of the 13th international conference on World Wide Web
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evaluating GLR parsing algorithms
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers
IEEE Transactions on Computers
Applications of language theory to compiler design
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Instruction sequencing in microprogrammed computers
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
An efficient context-free parsing algorithm for natural languages
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
AUTOPASS: an automatic programming system for computer controlled mechanical assembly
IBM Journal of Research and Development
Generalized overlap resolvable grammars and their parsers
Journal of Computer and System Sciences
Journal of Computer and System Sciences
LR(1) parser generation system: LR(1) error recovery, oracles, and generic tokens
ACM SIGSOFT Software Engineering Notes
Why automatic error correctors fail
Computer Languages
An LR parsing technique for extended context-free grammars
Computer Languages
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
| Hi-index | 48.28 |
A class of context-free grammars, called the “Simple LR(k)” or SLR(k) grammars is defined. This class has been shown to include weak precedence and simple precedence grammars as proper subsets. How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct comparison proved to be superior to precedence techniques, not only in the range of grammars covered, but also in the speed of parser construction and in the size and speed of the resulting parsers.