el-grammar — pure-Rust DFA token masking for grammar-constrained
decoding (Grammar Constraint context, docs/ddd/bounded-contexts/04).
A grammar is compiled to a deterministic automaton over token ids (the alphabet). Each decode step, the masker replays the committed tokens to find the current state and allows only tokens with a valid transition — the exact token-level masking mechanism that XGrammar/llguidance implement, here for regular grammars in pure Rust.
Scope: this covers regular grammars over an explicit token alphabet. Full
context-free / JSON-schema grammars + a real tokenizer environment are the
el-grammar-llguidance production scale-up.