BranchTaken

Early this year the Hardly Original Compiler Compiler (Hocc) started seeing some serious use, but unfortunately IELR (inadequacy elimination LR) proved frustratingly slow enough to warrant another round of optimization.

The Hardly Original Compiler Compiler (hocc) is now fully functional!

Work on the hocc parser generator began in early 2022.

The hocc parser generator is incrementally converging on a working IELR(1) [1] implementation, but it is a convoluted process, putting things mildly.

The in-development hocc parser generator recently reached the significant milestone of being capable of generating state tables using any of the LR(1), PGM(1), or LALR(1) algorithms.

Hemlock is (aspirationally) a general-purpose programming language, a category already abundantly populated with options sufficient for almost any task.

The hocc parser generator implementation can now compute the canonical collection of LR(1) items (𝐶𝐶 for short), as briefly introduced in a previous post regarding follow sets.

The hocc parser generator implementation continues to progress, and very nearly all the pieces are in place for computing what the literature commonly calls the “canonical collection of LR(1) items” or 𝐶𝐶 for short [1].

The hocc parser generator implementation is coming along nicely.

Hemlock’s parser implementation relies on the hocc parser generator, which spiritually descends from the Parsing parser generator.