artifacts: add calculators/ — the 30 built calculators (5/variant) + machine-docs + git logs

calculators/builder-adversary-lean/run-01/calc/evaluator.py

@@ -0,0 +1,38 @@
+from calc.parser import Num, BinOp, Unary
+
+
+class EvalError(Exception):
+    pass
+
+
+def evaluate(node) -> 'int | float':
+    """Walk an AST node and return the numeric result.
+
+    Result type rule: returns int for whole-valued results (including whole-valued
+    division), float for non-whole. Division by zero raises EvalError.
+    """
+    if isinstance(node, Num):
+        return node.value
+    if isinstance(node, Unary):
+        v = evaluate(node.operand)
+        if node.op == '-':
+            return -v
+        raise EvalError(f"unknown unary op {node.op!r}")
+    if isinstance(node, BinOp):
+        left = evaluate(node.left)
+        right = evaluate(node.right)
+        if node.op == '+':
+            return left + right
+        if node.op == '-':
+            return left - right
+        if node.op == '*':
+            return left * right
+        if node.op == '/':
+            if right == 0:
+                raise EvalError("division by zero")
+            result = left / right
+            if isinstance(result, float) and result.is_integer():
+                return int(result)
+            return result
+        raise EvalError(f"unknown binary op {node.op!r}")
+    raise EvalError(f"unknown node type {type(node).__name__!r}")

calculators/builder-adversary-lean/run-01/calc/lexer.py

@@ -0,0 +1,47 @@
+from dataclasses import dataclass
+from typing import Union
+
+
+class LexError(Exception):
+    pass
+
+
+@dataclass
+class Token:
+    kind: str
+    value: Union[int, float, str]
+
+
+_SINGLE = {'+': 'PLUS', '-': 'MINUS', '*': 'STAR', '/': 'SLASH',
+           '(': 'LPAREN', ')': 'RPAREN'}
+
+
+def tokenize(src: str) -> list:
+    tokens = []
+    i = 0
+    n = len(src)
+    while i < n:
+        ch = src[i]
+        if ch in ' \t\n\r':
+            i += 1
+        elif ch in _SINGLE:
+            tokens.append(Token(_SINGLE[ch], ch))
+            i += 1
+        elif ch.isdigit() or ch == '.':
+            j = i
+            has_dot = False
+            while j < n and (src[j].isdigit() or (src[j] == '.' and not has_dot)):
+                if src[j] == '.':
+                    has_dot = True
+                j += 1
+            raw = src[i:j]
+            try:
+                value = float(raw) if has_dot else int(raw)
+            except ValueError:
+                raise LexError(f"invalid number {raw!r} at position {i}")
+            tokens.append(Token('NUMBER', value))
+            i = j
+        else:
+            raise LexError(f"unexpected character {ch!r} at position {i}")
+    tokens.append(Token('EOF', ''))
+    return tokens

calculators/builder-adversary-lean/run-01/calc/parser.py

@@ -0,0 +1,114 @@
+from dataclasses import dataclass
+from typing import Union
+
+from calc.lexer import Token
+
+
+class ParseError(Exception):
+    pass
+
+
+@dataclass
+class Num:
+    value: Union[int, float]
+
+    def __repr__(self):
+        return f"Num({self.value!r})"
+
+
+@dataclass
+class BinOp:
+    op: str
+    left: 'Node'
+    right: 'Node'
+
+    def __repr__(self):
+        return f"BinOp({self.op!r}, {self.left!r}, {self.right!r})"
+
+
+@dataclass
+class Unary:
+    op: str
+    operand: 'Node'
+
+    def __repr__(self):
+        return f"Unary({self.op!r}, {self.operand!r})"
+
+
+Node = Union[Num, BinOp, Unary]
+
+
+class _Parser:
+    def __init__(self, tokens: list):
+        self._tokens = tokens
+        self._pos = 0
+
+    def _peek(self) -> Token:
+        return self._tokens[self._pos]
+
+    def _consume(self, kind: str = None) -> Token:
+        tok = self._tokens[self._pos]
+        if kind and tok.kind != kind:
+            raise ParseError(f"expected {kind!r}, got {tok.kind!r} ({tok.value!r})")
+        self._pos += 1
+        return tok
+
+    def parse(self) -> Node:
+        if self._peek().kind == 'EOF':
+            raise ParseError("empty expression")
+        node = self._expr()
+        if self._peek().kind != 'EOF':
+            raise ParseError(
+                f"unexpected token {self._peek().kind!r} ({self._peek().value!r})"
+            )
+        return node
+
+    def _expr(self) -> Node:
+        node = self._term()
+        while self._peek().kind in ('PLUS', 'MINUS'):
+            op = self._consume().value
+            right = self._term()
+            node = BinOp(op, node, right)
+        return node
+
+    def _term(self) -> Node:
+        node = self._unary()
+        while self._peek().kind in ('STAR', 'SLASH'):
+            op = self._consume().value
+            right = self._unary()
+            node = BinOp(op, node, right)
+        return node
+
+    def _unary(self) -> Node:
+        if self._peek().kind == 'MINUS':
+            op = self._consume().value
+            operand = self._unary()
+            return Unary(op, operand)
+        return self._primary()
+
+    def _primary(self) -> Node:
+        tok = self._peek()
+        if tok.kind == 'NUMBER':
+            self._consume()
+            return Num(tok.value)
+        if tok.kind == 'LPAREN':
+            self._consume()
+            node = self._expr()
+            if self._peek().kind != 'RPAREN':
+                raise ParseError(
+                    f"expected ')' but got {self._peek().kind!r} ({self._peek().value!r})"
+                )
+            self._consume()
+            return node
+        if tok.kind == 'EOF':
+            raise ParseError("unexpected end of expression")
+        raise ParseError(f"unexpected token {tok.kind!r} ({tok.value!r})")
+
+
+def parse(tokens: list) -> Node:
+    """Parse a token list from calc.lexer.tokenize() into an AST.
+
+    Returns one of: Num(value), BinOp(op, left, right), Unary(op, operand).
+    Raises ParseError on malformed input.
+    """
+    return _Parser(tokens).parse()

calculators/builder-adversary-lean/run-01/calc/test_evaluator.py

@@ -0,0 +1,60 @@
+import unittest
+
+from calc.lexer import tokenize
+from calc.parser import parse
+from calc.evaluator import evaluate, EvalError
+
+
+def ev(expr):
+    return evaluate(parse(tokenize(expr)))
+
+
+class TestArithmetic(unittest.TestCase):
+    def test_add_mul_precedence(self):
+        self.assertEqual(ev("2+3*4"), 14)
+
+    def test_paren_override(self):
+        self.assertEqual(ev("(2+3)*4"), 20)
+
+    def test_sub_left_assoc(self):
+        self.assertEqual(ev("8-3-2"), 3)
+
+    def test_unary_leading(self):
+        self.assertEqual(ev("-2+5"), 3)
+
+    def test_unary_in_mul(self):
+        self.assertEqual(ev("2*-3"), -6)
+
+
+class TestDivision(unittest.TestCase):
+    def test_true_division_non_whole(self):
+        self.assertEqual(ev("7/2"), 3.5)
+
+    def test_div_by_zero_literal(self):
+        with self.assertRaises(EvalError):
+            ev("1/0")
+
+    def test_div_by_zero_expr(self):
+        with self.assertRaises(EvalError):
+            ev("5/(2-2)")
+
+
+class TestResultType(unittest.TestCase):
+    def test_whole_div_returns_int(self):
+        result = ev("4/2")
+        self.assertEqual(result, 2)
+        self.assertIsInstance(result, int)
+
+    def test_non_whole_div_returns_float(self):
+        result = ev("7/2")
+        self.assertEqual(result, 3.5)
+        self.assertIsInstance(result, float)
+
+    def test_pure_int_arithmetic_returns_int(self):
+        result = ev("2+3*4")
+        self.assertEqual(result, 14)
+        self.assertIsInstance(result, int)
+
+
+if __name__ == '__main__':
+    unittest.main()

calculators/builder-adversary-lean/run-01/calc/test_lexer.py

@@ -0,0 +1,101 @@
+import unittest
+from calc.lexer import tokenize, Token, LexError
+
+
+def kinds(src):
+    return [t.kind for t in tokenize(src)]
+
+
+def values(src):
+    return [(t.kind, t.value) for t in tokenize(src)]
+
+
+class TestNumbers(unittest.TestCase):
+    def test_integer(self):
+        toks = tokenize("42")
+        self.assertEqual(len(toks), 2)
+        self.assertEqual(toks[0], Token('NUMBER', 42))
+        self.assertIsInstance(toks[0].value, int)
+        self.assertEqual(toks[1].kind, 'EOF')
+
+    def test_float(self):
+        toks = tokenize("3.14")
+        self.assertEqual(toks[0], Token('NUMBER', 3.14))
+        self.assertIsInstance(toks[0].value, float)
+
+    def test_leading_dot(self):
+        toks = tokenize(".5")
+        self.assertAlmostEqual(toks[0].value, 0.5)
+        self.assertIsInstance(toks[0].value, float)
+
+    def test_trailing_dot(self):
+        toks = tokenize("10.")
+        self.assertAlmostEqual(toks[0].value, 10.0)
+        self.assertIsInstance(toks[0].value, float)
+
+    def test_zero(self):
+        toks = tokenize("0")
+        self.assertEqual(toks[0].value, 0)
+
+
+class TestOperatorsAndParens(unittest.TestCase):
+    def test_simple_expr(self):
+        k = kinds("1+2*3")
+        self.assertEqual(k, ['NUMBER', 'PLUS', 'NUMBER', 'STAR', 'NUMBER', 'EOF'])
+
+    def test_all_ops(self):
+        k = kinds("1-2/3")
+        self.assertEqual(k, ['NUMBER', 'MINUS', 'NUMBER', 'SLASH', 'NUMBER', 'EOF'])
+
+    def test_parens(self):
+        k = kinds("(1)")
+        self.assertEqual(k, ['LPAREN', 'NUMBER', 'RPAREN', 'EOF'])
+
+    def test_complex(self):
+        result = values("3.5*(1-2)")
+        self.assertEqual(result, [
+            ('NUMBER', 3.5),
+            ('STAR', '*'),
+            ('LPAREN', '('),
+            ('NUMBER', 1),
+            ('MINUS', '-'),
+            ('NUMBER', 2),
+            ('RPAREN', ')'),
+            ('EOF', ''),
+        ])
+
+
+class TestWhitespaceAndErrors(unittest.TestCase):
+    def test_spaces_skipped(self):
+        k = kinds("  12  +  3 ")
+        self.assertEqual(k, ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+        toks = tokenize("  12  +  3 ")
+        self.assertEqual(toks[0].value, 12)
+        self.assertEqual(toks[2].value, 3)
+
+    def test_tab_skipped(self):
+        k = kinds("1\t+\t2")
+        self.assertEqual(k, ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_invalid_at(self):
+        with self.assertRaises(LexError) as ctx:
+            tokenize("1 @ 2")
+        self.assertIn('@', str(ctx.exception))
+
+    def test_invalid_dollar(self):
+        with self.assertRaises(LexError) as ctx:
+            tokenize("$")
+        self.assertIn('$', str(ctx.exception))
+
+    def test_invalid_letter(self):
+        with self.assertRaises(LexError):
+            tokenize("abc")
+
+    def test_error_position(self):
+        with self.assertRaises(LexError) as ctx:
+            tokenize("1 @ 2")
+        self.assertIn('2', str(ctx.exception))  # position 2
+
+
+if __name__ == '__main__':
+    unittest.main()

calculators/builder-adversary-lean/run-01/calc/test_parser.py

@@ -0,0 +1,110 @@
+import unittest
+from calc.lexer import tokenize
+from calc.parser import parse, ParseError, Num, BinOp, Unary
+
+
+def p(src):
+    return parse(tokenize(src))
+
+
+class TestPrecedence(unittest.TestCase):
+    """D1 — * and / bind tighter than + and -"""
+
+    def test_add_then_mul(self):
+        # 1+2*3 => BinOp('+', Num(1), BinOp('*', Num(2), Num(3)))
+        self.assertEqual(p('1+2*3'), BinOp('+', Num(1), BinOp('*', Num(2), Num(3))))
+
+    def test_mul_then_add(self):
+        # 2*3+4 => BinOp('+', BinOp('*', Num(2), Num(3)), Num(4))
+        self.assertEqual(p('2*3+4'), BinOp('+', BinOp('*', Num(2), Num(3)), Num(4)))
+
+    def test_sub_mul(self):
+        # 6-2*3 => BinOp('-', Num(6), BinOp('*', Num(2), Num(3)))
+        self.assertEqual(p('6-2*3'), BinOp('-', Num(6), BinOp('*', Num(2), Num(3))))
+
+    def test_div_before_add(self):
+        # 1+6/2 => BinOp('+', Num(1), BinOp('/', Num(6), Num(2)))
+        self.assertEqual(p('1+6/2'), BinOp('+', Num(1), BinOp('/', Num(6), Num(2))))
+
+
+class TestAssociativity(unittest.TestCase):
+    """D2 — same-precedence operators associate left"""
+
+    def test_sub_left_assoc(self):
+        # 8-3-2 => BinOp('-', BinOp('-', Num(8), Num(3)), Num(2))
+        self.assertEqual(p('8-3-2'), BinOp('-', BinOp('-', Num(8), Num(3)), Num(2)))
+
+    def test_div_left_assoc(self):
+        # 8/4/2 => BinOp('/', BinOp('/', Num(8), Num(4)), Num(2))
+        self.assertEqual(p('8/4/2'), BinOp('/', BinOp('/', Num(8), Num(4)), Num(2)))
+
+    def test_add_left_assoc(self):
+        # 1+2+3 => BinOp('+', BinOp('+', Num(1), Num(2)), Num(3))
+        self.assertEqual(p('1+2+3'), BinOp('+', BinOp('+', Num(1), Num(2)), Num(3)))
+
+    def test_mul_left_assoc(self):
+        # 2*3*4 => BinOp('*', BinOp('*', Num(2), Num(3)), Num(4))
+        self.assertEqual(p('2*3*4'), BinOp('*', BinOp('*', Num(2), Num(3)), Num(4)))
+
+
+class TestParentheses(unittest.TestCase):
+    """D3 — parentheses override precedence"""
+
+    def test_parens_override(self):
+        # (1+2)*3 => BinOp('*', BinOp('+', Num(1), Num(2)), Num(3))
+        self.assertEqual(p('(1+2)*3'), BinOp('*', BinOp('+', Num(1), Num(2)), Num(3)))
+
+    def test_nested_parens(self):
+        # ((2+3)) => BinOp('+', Num(2), Num(3))
+        self.assertEqual(p('((2+3))'), BinOp('+', Num(2), Num(3)))
+
+    def test_parens_left_of_mul(self):
+        # 3*(2+1) => BinOp('*', Num(3), BinOp('+', Num(2), Num(1)))
+        self.assertEqual(p('3*(2+1)'), BinOp('*', Num(3), BinOp('+', Num(2), Num(1))))
+
+
+class TestUnaryMinus(unittest.TestCase):
+    """D4 — unary minus"""
+
+    def test_simple_neg(self):
+        self.assertEqual(p('-5'), Unary('-', Num(5)))
+
+    def test_neg_paren(self):
+        # -(1+2) => Unary('-', BinOp('+', Num(1), Num(2)))
+        self.assertEqual(p('-(1+2)'), Unary('-', BinOp('+', Num(1), Num(2))))
+
+    def test_mul_neg(self):
+        # 3 * -2 => BinOp('*', Num(3), Unary('-', Num(2)))
+        self.assertEqual(p('3 * -2'), BinOp('*', Num(3), Unary('-', Num(2))))
+
+    def test_double_neg(self):
+        # --5 => Unary('-', Unary('-', Num(5)))
+        self.assertEqual(p('--5'), Unary('-', Unary('-', Num(5))))
+
+
+class TestErrors(unittest.TestCase):
+    """D5 — ParseError on malformed input"""
+
+    def test_trailing_op(self):
+        with self.assertRaises(ParseError):
+            p('1 +')
+
+    def test_unclosed_paren(self):
+        with self.assertRaises(ParseError):
+            p('(1')
+
+    def test_two_nums(self):
+        with self.assertRaises(ParseError):
+            p('1 2')
+
+    def test_close_before_open(self):
+        with self.assertRaises(ParseError):
+            p(')(')
+
+    def test_empty_string(self):
+        with self.assertRaises(ParseError):
+            p('')
+
+
+if __name__ == '__main__':
+    unittest.main()