Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
A proposal for definitions in ALGOL
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
The introduction of definitional facilities into higher level programming languages
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
A Basis for Looping Extensions to Discriminating-Reverse Parsing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
A Bounded Graph-Connect Construction for LR-regular Parsers
CC '01 Proceedings of the 10th International Conference on Compiler Construction
An Experimental Ambiguity Detection Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Analyzing Context-Free Grammars Using an Incremental SAT Solver
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An experimental ambiguity detection tool
Science of Computer Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity metatheorems for context-free grammar problems
Journal of Computer and System Sciences
On lexicalized well-behaved restarting automata that are monotone
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Conservative ambiguity detection in context-free grammars
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On LR parsing with selective delays
CC'13 Proceedings of the 22nd international conference on Compiler Construction
| Hi-index | 0.01 |
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is allowed before making a parsing decision during the bottom-up syntactical analysis; however, this look-ahead is restricted in that the essential ''look-ahead information'' can be represented by a finite number of regular sets, thus can be computed by a finite state machine. LR-regular grammars can be parsed deterministically in linear time by a rather simple two-scan algorithm. Efficient parsers are constructed for given LR-regular grammars. The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties. Necessary and sufficient conditions for a grammar to be LR-regular are derived and then utilized for developing parser generation techniques for arbitrary grammars.