!7 sS input = [[ RULE WasLAB (("was|warum")&&("ist|bedeutet|heißt|soll|meint|nenn(t|en|st)")&&("lab")) )) ]]; sS rules = [[ RULE ( ) = rule // bracketing combines top and bottom ( ) = expX // primitive expressions are also at top level = expX // now come the lower levels = exp3 = exp2 & & = exp2 = exp1 | | = exp1 // lowest level = exp ]]; p { O parsed = parse1(input, rules); print("Parsed as: " + structForUser(call(parsed, "fullMatchClasses"))); //print(call(parsed, "prettierAnalysis")); printStruct(parse1(input, rules)); Explain e = explain(input, rules, "rule"); printStruct(e); printExplainTree(e); }