Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments
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. This works well for mainstream languages but remains brittle for low-resource programming surfaces such as domain-specific languages, custom library APIs, and command-line tools. Even under grammar-constrained decoding, a model can still produce references invalid in the current environment: a buffer never declared, a column absent from the schema, a function the library does not provide, or an unsupported CLI option. This paper introduces decode-time grammars: grammar fragments instantiated durin...
| Authors | Shuoming Zhang, Ruiyuan Xu, Haofeng Li et al. |
|---|---|
| Primary category | cs.PL |
| Published | 20 July 2026 |
| Last updated at source | 20 July 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.