← Back to all news
arXiv AI By Shuoming Zhang, Ruiyuan Xu, Haofeng Li, Qiuchu Yu, Yangyu Zhang, Chunwei Xia, Xiaobing Feng, Chenxi Wang, Huimin Cui, Jiacheng Zhao

Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments

Read the original on arXiv AI →

arXiv:2607. 18357v1 Announce Type: cross Abstract: Large language models now write a growing share of the world's code, increasingly inside agents and serving systems that compile, execute, or dispatch generated code without line-by-line review.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Jul 15

GRID: Grammar-Railed Decoding for Enterprise SQL Generation

arXiv:2607. 11951v1 Announce Type: new Abstract: Large language models can write SQL, but enterprise deployment demands more than plausible text: outputs must be syntactically valid, must respect per-role and per-schema policy, must carry provable (not best-effort) guarantees, must not slow down as generations grow, and must leave a compliance-grade record of every decision.

By Mohsen Arjmandi
llmsbenchmarksdata-engineering
More like this →
arXiv AI
Aug 25

Withholding the Completing Chunk: Exact Release-Boundary Equivalence for Production Streaming Guardrails

The paper presents a production streaming guardrail system that ensures exact release‑boundary equivalence for language‑model outputs. It compiles regular‑language predicates into persistent NFAs, distinguishes stable from provisional states, and applies document‑order priority to decide before each chunk release. Evaluations on over 200,000 partitioned cases show zero mismatches and demonstrate that incremental matching can outperform native regex at larger chunk sizes while remaining competitive at smaller ones.

By Christopher M. Frost
safety
More like this →