Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 237

The DOI matches its Crossref record.

Simple LR(k) grammars

Open access
DeRemer, Franklin L. · 1971 · Communications of the ACM

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/362619.362625

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 237

Metadata

Authors
DeRemer, F. L.
Venue
Communications of the ACM
Published
1971-07
Volume
14
Issue
7
Pages
453-460
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W1984742153
Cited by
237
References
0
FWCI
19.21
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Simple LR(k) grammars. https://app.cochat.ai/papers/10.1145/362619.362625
The paper
DeRemer, F. L. (1971). Simple LR(k) grammars. Communications of the ACM. https://doi.org/10.1145/362619.362625

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.