Recursive Grammar Rules And Reusable Constraint Patterns

via “regex-based generation with pattern matching”

Microsoft's language for efficient LLM control flow.

Unique: Converts regex patterns into grammar constraints (RegexNode) that guide token-by-token generation, ensuring output matches the pattern without post-processing. Uses the regex engine to validate token sequences in real-time during generation.

vs others: More efficient than regex validation after generation because invalid tokens are prevented from being produced, and more flexible than hardcoded format strings because arbitrary regex patterns can be used.

via “constrained-decoding-with-regex-patterns”

Probabilistic Generative Model Programming

Unique: Uses interleaved finite automata evaluation during token sampling rather than post-hoc validation, enabling hard constraints without rejection sampling or model re-runs. Implements efficient token masking by precomputing valid next tokens for each automata state.

vs others: Faster and more reliable than rejection sampling approaches because constraints are enforced during generation, not after, eliminating wasted computation and guarantee of format compliance

A guidance language for controlling large language models.

Unique: Implements RuleNode grammar constraints that support recursion and parameterization, enabling complex nested structures to be defined concisely. Rules are compiled into the grammar AST and can be referenced multiple times without duplication.

vs others: More maintainable than inline grammar definitions because rules can be reused, and more flexible than hardcoded patterns because rules can be parameterized with arguments.

via “regex-free-pattern-definition”