PSC precompiles the acceptance conditions of all vocabulary tokens into one finite-state automaton over parser stacks, making grammar-constrained decoding mask computation independent of vocabulary size at runtime.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Grammar-Constrained Decoding via Parser Stack Classification
PSC precompiles the acceptance conditions of all vocabulary tokens into one finite-state automaton over parser stacks, making grammar-constrained decoding mask computation independent of vocabulary size at runtime.