Program Synthesis Search Tree

Program synthesis with LLMs over a domain-specific language turns code generation into a search problem: candidate programs are built one grammar production at a time, a verifier scores each one against an executable spec, and only the best survive to the next round. This simulator makes that beam search visible as a growing 3D tree — each layer is a depth of the grammar, each node a candidate program, and node color shows whether the verifier passed it, kept it in the beam, or pruned it. Tune beam width, branching factor, spec strictness and the counterexample repair loop to see how each one trades search cost against the odds of finding a verified program.