Soffit grammar for creating combinatorial games (and labeling some games.)

combinatorial_game.json

{
  "version": "0.1",
  "start": "G[game]",
  
  "G[game]": [
    "G[game]; Z[game]; G->Z [left];",
    "G[game]; Z[game]; G->Z [right];"
  ],
  "G[game]; L[game]; G->L[left]": "G[game]; L2[0]; G->L2[left]",
  "G[game]; R[game]; G->R[right]": "G[game]; R2[0]; G->R2[right]",
  
  "G[game]; Z1[0]; Z2[0]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[0]; G->Z1[right]",
  "G[game]; Z1[0]; Z2[0]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[0]; G->Z1[left]",
  "G[game]; Z1[+1]; Z2[+1]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[+1]; G->Z1[right]",
  "G[game]; Z1[+1]; Z2[+1]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[+1]; G->Z1[left]",
  "G[game]; Z1[-1]; Z2[-1]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[-1]; G->Z1[right]",
  "G[game]; Z1[-1]; Z2[-1]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[-1]; G->Z1[left]",
  
  "G[game]; Z1[-1]; Z2[0]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[-1]; G->Z1[right]",
  "G[game]; Z1[-1]; Z2[+1]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[-1]; G->Z1[right]",
  "G[game]; Z1[0]; Z2[+1]; G->Z1[right]; G->Z2[right];": "G[game]; Z1[0]; G->Z1[right]",
  
  "G[game]; Z1[+1]; Z2[0]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[+1]; G->Z1[left]",
  "G[game]; Z1[+1]; Z2[-1]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[+1]; G->Z1[left]",
  "G[game]; Z1[0]; Z2[-1]; G->Z1[left]; G->Z2[left];": "G[game]; Z1[0]; G->Z1[left]",
  
  "P[game]; P->G[right]; G[game]; Z1[0]; Z2[0]; G->Z1[left]; G->Z2[right];": "P[game]; P->G2[right]; G2[*];",
  "P[game]; P->G[left]; G[game]; Z1[0]; Z2[0]; G->Z1[left]; G->Z2[right];": "P[game]; P->G2[left]; G2[*]; ",
  
  "P[game]; P->G[left]; G[game]; Z1[0]; G->Z1[left];": "P[game]; P->G2[left]; G2[+1]",
  "P[game]; P->G[right]; G[game]; Z1[0]; G->Z1[left];": "P[game]; P->G2[right]; G2[+1]",
  "P[game]; P->G[left]; G[game]; Z1[0]; G->Z1[right];": "P[game]; P->G2[left]; G2[-1];",
  "P[game]; P->G[right]; G[game]; Z1[0]; G->Z1[right];": "P[game]; P->G2[right]; G2[-1];"
}