From 4f1961ed0b3b9aba4c0afd5c6e996b003e98a210 Mon Sep 17 00:00:00 2001 From: Jason Evans Date: Mon, 6 Jul 2026 12:01:10 -0700 Subject: [PATCH 1/2] Refer to "evergreen" rather than "living" tech reports --- doc/reports/aplr1/aplr1.md | 2 +- doc/reports/ielr1/ielr1.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/reports/aplr1/aplr1.md b/doc/reports/aplr1/aplr1.md index 1235c241e..582e7535f 100644 --- a/doc/reports/aplr1/aplr1.md +++ b/doc/reports/aplr1/aplr1.md @@ -1,6 +1,6 @@ # The APLR(1) Algorithm for Generating Compact LR(1) Parsers is Simpler and More Capable than IELR(1) -[This is a living version of an originally web-published technical report. [^evans2026]] +[This is an evergreen version of an originally web-published technical report. [^evans2026]] The [Hocc](https://github.com/BranchTaken/Hemlock/blob/main/doc/tools/hocc.md) parser generator, which is part of the [Hemlock](https://github.com/BranchTaken/Hemlock) programming language project, diff --git a/doc/reports/ielr1/ielr1.md b/doc/reports/ielr1/ielr1.md index 4108ec65f..c67f2a487 100644 --- a/doc/reports/ielr1/ielr1.md +++ b/doc/reports/ielr1/ielr1.md @@ -1,6 +1,6 @@ # IELR(1) as Implemented by Hocc -[This is a living version of an originally web-published technical report. [^evans2024]] +[This is an evergreen version of an originally web-published technical report. [^evans2024]] The Hocc parser generator, which is part of the [Hemlock](https://github.com/BranchTaken/Hemlock) programming language project, implements several LR(1)-family parser generation algorithms, namely From 6f1f6d223a134416ab971891194234a0288507be Mon Sep 17 00:00:00 2001 From: Jason Evans Date: Mon, 6 Jul 2026 12:04:17 -0700 Subject: [PATCH 2/2] Use shortened canonicalized URLs for technical reports --- doc/reports/aplr1/aplr1.md | 4 ++-- doc/reports/ielr1/ielr1.md | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/doc/reports/aplr1/aplr1.md b/doc/reports/aplr1/aplr1.md index 582e7535f..cbe007369 100644 --- a/doc/reports/aplr1/aplr1.md +++ b/doc/reports/aplr1/aplr1.md @@ -794,14 +794,14 @@ Opinions may differ, but the correct answer is APLR(1). Jason Evans, “IELR(1) as Implemented by Hocc”, BranchTaken LLC, - [https://branchtaken.com/reports/ielr1/ielr1.html](https://branchtaken.com/reports/ielr1/ielr1.html), + [https://branchtaken.com/reports/ielr1/ielr1.html](https://branchtaken.com/reports/ielr1/ielr1), July 2024. [^evans2026]: Jason Evans, “The APLR(1) Algorithm for Generating Compact LR(1) Parsers is Simpler and More Capable than IELR(1)”, BranchTaken LLC, - [https://branchtaken.com/reports/aplr1/aplr1.html](https://branchtaken.com/reports/aplr1/aplr1.html), + [https://branchtaken.com/reports/aplr1/aplr1.html](https://branchtaken.com/reports/aplr1/aplr1), June 2026. [^knuth1965]: diff --git a/doc/reports/ielr1/ielr1.md b/doc/reports/ielr1/ielr1.md index c67f2a487..9a0eb5842 100644 --- a/doc/reports/ielr1/ielr1.md +++ b/doc/reports/ielr1/ielr1.md @@ -680,7 +680,7 @@ grammars with it. Jason Evans, “IELR(1) as Implemented by Hocc”, BranchTaken LLC, - [https://branchtaken.com/reports/ielr1/ielr1.html](https://branchtaken.com/reports/ielr1/ielr1.html), + [https://branchtaken.com/reports/ielr1/ielr1.html](https://branchtaken.com/reports/ielr1/ielr1), July 2024. [^knuth1965]: