AWhat changed
LR(k) formalizes unique prefix/lookahead-driven reductions and connects a fixed-k grammar test with finite state-set shift/reduce recognizer construction.
Scientific scope
LR(k) formalizes unique prefix/lookahead-driven reductions and connects a fixed-k grammar test with finite state-set shift/reduce recognizer construction. The LR(k) condition belongs to a grammar with specified lookahead k; two grammars for the same language may differ. Linear parsing claims concern input length for a fixed grammar/parser, and do not bound parser-construction cost or table size. Not all context-free grammars qualify. The whole deterministic-language and unspecified-lookahead undecidability proofs are outside this selected reading.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Donald E. Knuth · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction