Simple LR(k) grammars-Reference-Cited by-同舟云学术

Simple LR(k) grammars

Published:1971-07 Issue:7 Volume:14 Page:453-460
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

DeRemer Franklin L.¹

Affiliation:

1. Univ. of California, Santa Cruz

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/362619.362625

Reference15 articles.

1. Definition and implementation;DeRemer F. L.;CEP Rep.,1970

2. De Remer F. L. Minimal LR(k) parsers (In preparation). De Remer F. L. Minimal LR(k) parsers (In preparation).

3. De Remer F. L. Error recovery using LR(k) techniques (In preparation). De Remer F. L. Error recovery using LR(k) techniques (In preparation).

Cited by 145 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bibliography;Engineering a Compiler;2023

2. Parsers;Engineering a Compiler;2023

3. Faster reachability analysis for LR(1) parsers;Proceedings of the 14th ACM SIGPLAN International Conference on Software Language Engineering;2021-10-17

4. Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement;Journal of Logical and Algebraic Methods in Programming;2019-04

5. Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars;Graph Transformation;2017