// Logic thread static class LThread { new L statements; new HashMap m; // current variable assignments L ops; int opIdx; new L output; L log; *(Lisp code) { ops = splitOps(code); } boolean done() { ret opIdx >= l(ops); } // returns false if failed boolean step() { Lisp code = ops.get(opIdx++); boolean ok = stepImpl(code); if (log != null) log.add((ok ? "[OK] ": "[FAIL] ") + " step " + snlFromTree(code) + " with " + structure(m)); ret ok; } void say(Lisp b) { output.add(snlApply(b, m)); } boolean stepImpl(Lisp code) { if (code.isic("if *", "and *", "assume *")) { Lisp a = code.get(0); Lisp b = snlApply(a, m); // try all statements known for (Lisp s : statements) { S x; if (snlMatchX(b, s, m)) ret true; } // try the low-level engine pcall { if (yo(b, m)) // todo: rename vars ret true; } if (code.isic("assume *")) say(snlToTree("assumption < failed < : < [" + snlFromTree(b) + "]")); // Not matched, fail ret false; } if (code.isic("say *")) { Lisp b = code.get(0); //print ("m: " + structure (m) + ", b: " + structure (b)); say(b); ret true; } if (code.isic("memorize *")) { Lisp b = snlApply(code.get(0), m); callOpt(mc(), "memorize", b); ret true; } // unknown code say(snlToTree("unknown < instruction < : < [" + snlFromTree(code) + "]")); ret false; } // true if succeeded, false if failed boolean run() { while (!done()) if (!step()) { print("fail"); ret false; } ret true; } // split smth like "if * then *" into "if *" and "then *" L splitOps(Lisp code) { S ops = code.head; L tok = codeTokensOnly(javaTok(ops)); new L out; for (int i = 0; i < l(tok); i += 2) { S op = tok.get(i); assertEquals("*", tok.get(i+1)); out.add(lisp(op + " *", code.get(i/2))); } print("splitOps => " + structure(out)); ret out; } }