Function run_sequitur 

pub fn run_sequitur(sequence: &[Symbol]) -> Grammar

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

The result contains a start rule plus zero or more generated R1, R2, … rules. Terminals are emitted as GrammarExpr::Terminal values, generated rule references as GrammarExpr::NonTerminal, and the grammar source format is set to GrammarFormat::Inferred. The grammar accepts exactly the concatenation of the input symbols; later inference stages are responsible for generalising beyond that single sequence.