Skip to content

Refer to "evergreen" rather than "living" tech reports #344

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jasone merged 2 commits into from
Jul 6, 2026
Merged

Refer to "evergreen" rather than "living" tech reports #344

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4f1961e
Refer to "evergreen" rather than "living" tech reports
Jul 6, 2026
6f1f6d2
Use shortened canonicalized URLs for technical reports
Jul 6, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions doc/reports/aplr1/aplr1.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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,
Expand Down Expand Up @@ -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]:
Expand Down
4 changes: 2 additions & 2 deletions doc/reports/ielr1/ielr1.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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
Expand Down Expand Up @@ -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]:
Expand Down
Loading