Answer architecture round 1: calls carry no operands in the grammar, ParseCalc returns its operands, one empty-segment check, sorted token kinds, and file items 110 and 111

This commit is contained in:
2026-10-05 12:25:22 +02:00
committed by Lillem4n
parent 3479f9cf98
commit 6fd7da19e5
14 changed files with 103 additions and 103 deletions
+1 -1
View File
@@ -213,7 +213,7 @@ func (p *valueProof) proveTemplate(t *template) proven {
func (p *valueProof) proveCalc(o op) proven {
body, args := o.Body, o.Args
expr := parsedCalc(args[0])
expr := parsedCalc(args[0]).Expr
nodes := operandNodes(o)
v, doubt := p.proveExpr(expr, func(name string) proven { return p.proveUnion(nodes(name)) })
if doubt == "" && !(magnitude(v) <= calcLimit) {