Module sequitur 

Sequitur structural compression for a single symbol sequence.

The implementation follows the two invariants from Nevill-Manning and Witten’s Sequitur algorithm: every live digram is unique, and every generated rule is referenced more than once. It uses an index-linked arena rather than reference-counted cells so substitutions and inlining can update local list boundaries directly. The digram table is a BTreeMap to keep emitted rule names and conflict handling deterministic.

Functions

run_sequitur

Runs Sequitur over sequence and emits the compressed hierarchy as grammar IR.

Type Aliases

Symbol

Terminal symbol consumed by run_sequitur.