Build a deterministic bounded decoder: append the highest-probability next token from a transition table for exactly N steps.
Required APIdef greedy_generate(tokens, transitions, steps):
return generated_tokensThink through the mechanism first if you want the extra reasoning step. It never blocks the editor.
greedy_generate(['a'], {'a': 'b', 'b': 'c'}, 2)generation is bounded and reproducible
greedy_generate(['x'], {}, 3)unknown context must not crash generation
2 hidden edge tests run after the visible contract passes.
Run Tests to see the contract verdicts here.