PEG grammars as LLM output constraints. TypeScript-native parser generator with parametric rules.
-
Updated
May 16, 2026 - JavaScript
PEG grammars as LLM output constraints. TypeScript-native parser generator with parametric rules.
Convert a regular expression into a GBNF grammar for constrained decoding with llama.cpp and local LLMs. Zero dependencies.
Twelve AI agents running entirely in the browser via WebGPU. No API key, no server, no data leaves the tab. Schema-constrained output + an honest eval suite.
Add a description, image, and links to the constrained-decoding topic page so that developers can more easily learn about it.
To associate your repository with the constrained-decoding topic, visit your repo's landing page and select "manage topics."