Formal languages
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
A practical method for constructing LR (k) processors
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
Strict deterministic versus LR(0) parsing
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Precedence languages and bounded right context languages
Precedence languages and bounded right context languages
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
On the Decidability of Grammar Problems
Journal of the ACM (JACM)
On the relationship between LL(1) and LR(1) grammars
Journal of the ACM (JACM)
An Iteration Theorem for Simple Precedence Languages
Journal of the ACM (JACM)
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Compiler Construction in Higher Order Logic Programming
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
CL '00 Proceedings of the First International Conference on Computational Logic
Iteration theorems for LL(k) languages (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast context-free parsing requires fast Boolean matrix multiplication
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
A parsing method for strict deterministic grammars is presented and a technique for using it to parse any deterministic language is indicated. An important characterization of the trees of strict deterministic grammars is established. This is used to prove iteration theorems for (strict) deterministic languages, and hence proving that certain sets are not in these families becomes comparatively straightforward. It is shown that every strict deterministic grammar is LR(0) and that any strict deterministic grammar is equivalent to a bounded right context (1, 0) grammar. Thus rigorous proofs that the families of deterministic, LR (k), and bounded right context languages are coextensive are presented for the first time.