Write a recursive-loop grammar program; it parses into nested loops and you watch a traversal walk the structure live on the canvas — then export it as a grammar seed.
Writing & loading a program
- Example Packs — pick a ready-made program from the dropdown, or type your own in the Program box.
Load / Reset — parse the program and start the traversal. Any parse/runtime problems appear in the Parse / Runtime Error box.
- Save Current — name and save your program to the Experiment list; the Node ID Cache can be scanned or cleared.
Playback & navigation
Pause/play · Step (advance one tick) · Back Up (ascend a loop level) · Root (jump to the top).
- The path bar and the canvas overlay show which level you're currently inside.
Tuning the run
- Global Speed and per-loop Loop Speeds — how fast the traversal moves.
- Branch Excursion Bias + Declared Bias (Mode
fixed/decaying, Strength, Decay Rate) — weight how branches are chosen, with optional decay over time. The readout shows the live bias.
Readouts & export
- Runtime: tick count, loop completions, current-level loop & edge counts. Loaded Structure and Edge State show the parsed graph.
Export Grammar Seed — emit the current grammar as a seed (usable by the other workbenches).
How to use it
- 1 — Pick an Example Pack (or write a program) →
Load / Reset.
- 2 — Watch the traversal; use
Step/Back Up/Root to move through levels.
- 3 — Tune Global/Loop speeds and the bias to shape behavior.
- 4 —
Export Grammar Seed when you like the result.