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

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

@@ -0,0 +1,42 @@
+from calc.parser import Num, BinOp, Unary
+
+
+class EvalError(Exception):
+    pass
+
+
+def evaluate(node):
+    """Walk the AST and return int | float.
+
+    Result-type rule: if the value is whole (n == int(n)), return int; else float.
+    Division by zero raises EvalError.
+    """
+    if isinstance(node, Num):
+        return node.value
+    if isinstance(node, Unary):
+        val = evaluate(node.operand)
+        if node.op == '-':
+            return _coerce(-val)
+        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 _coerce(left + right)
+        if node.op == '-':
+            return _coerce(left - right)
+        if node.op == '*':
+            return _coerce(left * right)
+        if node.op == '/':
+            if right == 0:
+                raise EvalError("division by zero")
+            return _coerce(left / right)
+        raise EvalError(f"unknown binary op {node.op!r}")
+    raise EvalError(f"unknown node type {type(node).__name__!r}")
+
+
+def _coerce(value):
+    """Return int if value is whole, float otherwise."""
+    if isinstance(value, float) and value == int(value):
+        return int(value)
+    return value

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

@@ -0,0 +1,59 @@
+from dataclasses import dataclass
+from typing import Union
+
+
+class LexError(Exception):
+    pass
+
+
+@dataclass
+class Token:
+    kind: str
+    value: Union[int, float, str, None]
+
+    def __repr__(self):
+        return f"{self.kind}({self.value!r})"
+
+
+_SINGLE = {
+    '+': 'PLUS',
+    '-': 'MINUS',
+    '*': 'STAR',
+    '/': 'SLASH',
+    '(': 'LPAREN',
+    ')': 'RPAREN',
+}
+
+
+def tokenize(src: str) -> list:
+    tokens = []
+    i = 0
+    while i < len(src):
+        ch = src[i]
+
+        if ch in ' \t':
+            i += 1
+            continue
+
+        if ch in _SINGLE:
+            tokens.append(Token(_SINGLE[ch], ch))
+            i += 1
+            continue
+
+        if ch.isdigit() or ch == '.':
+            j = i
+            while j < len(src) and (src[j].isdigit() or src[j] == '.'):
+                j += 1
+            num_str = src[i:j]
+            if '.' in num_str:
+                value = float(num_str)
+            else:
+                value = int(num_str)
+            tokens.append(Token('NUMBER', value))
+            i = j
+            continue
+
+        raise LexError(f"unexpected character {ch!r} at position {i}")
+
+    tokens.append(Token('EOF', None))
+    return tokens

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

@@ -0,0 +1,105 @@
+from dataclasses import dataclass
+from typing import Union
+
+
+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: object
+    right: object
+
+    def __repr__(self):
+        return f"BinOp({self.op!r}, {self.left!r}, {self.right!r})"
+
+
+@dataclass
+class Unary:
+    op: str
+    operand: object
+
+    def __repr__(self):
+        return f"Unary({self.op!r}, {self.operand!r})"
+
+
+class _Parser:
+    def __init__(self, tokens):
+        self._tokens = tokens
+        self._pos = 0
+
+    def _peek(self):
+        return self._tokens[self._pos]
+
+    def _advance(self):
+        tok = self._tokens[self._pos]
+        self._pos += 1
+        return tok
+
+    def _expect(self, kind):
+        tok = self._peek()
+        if tok.kind != kind:
+            raise ParseError(f"expected {kind!r}, got {tok.kind!r} ({tok.value!r})")
+        return self._advance()
+
+    def parse(self):
+        node = self._expr()
+        tok = self._peek()
+        if tok.kind != 'EOF':
+            raise ParseError(f"unexpected token {tok.kind!r} ({tok.value!r})")
+        return node
+
+    def _expr(self):
+        left = self._term()
+        while self._peek().kind in ('PLUS', 'MINUS'):
+            op = self._advance().value
+            right = self._term()
+            left = BinOp(op, left, right)
+        return left
+
+    def _term(self):
+        left = self._factor()
+        while self._peek().kind in ('STAR', 'SLASH'):
+            op = self._advance().value
+            right = self._factor()
+            left = BinOp(op, left, right)
+        return left
+
+    def _factor(self):
+        tok = self._peek()
+        if tok.kind == 'MINUS':
+            self._advance()
+            operand = self._factor()
+            return Unary('-', operand)
+        if tok.kind == 'NUMBER':
+            self._advance()
+            return Num(tok.value)
+        if tok.kind == 'LPAREN':
+            self._advance()
+            node = self._expr()
+            self._expect('RPAREN')
+            return node
+        raise ParseError(f"unexpected token {tok.kind!r} ({tok.value!r})")
+
+
+def parse(tokens):
+    """Parse a token list from calc.lexer.tokenize() into an AST.
+
+    AST node shapes:
+      Num(value)              — a numeric literal (int or float)
+      BinOp(op, left, right) — binary operation; op is '+', '-', '*', or '/'
+      Unary(op, operand)     — unary minus; op is '-'
+
+    Raises ParseError on malformed input.
+    """
+    return _Parser(tokens).parse()

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

@@ -0,0 +1,94 @@
+import unittest
+from calc.lexer import tokenize
+from calc.parser import parse
+from calc.evaluator import evaluate, EvalError
+
+
+def calc(s):
+    return evaluate(parse(tokenize(s)))
+
+
+class TestArithmetic(unittest.TestCase):
+    def test_add_mul_precedence(self):
+        self.assertEqual(calc("2+3*4"), 14)
+
+    def test_parens(self):
+        self.assertEqual(calc("(2+3)*4"), 20)
+
+    def test_left_assoc_sub(self):
+        self.assertEqual(calc("8-3-2"), 3)
+
+    def test_unary_minus(self):
+        self.assertEqual(calc("-2+5"), 3)
+
+    def test_unary_minus_mul(self):
+        self.assertEqual(calc("2*-3"), -6)
+
+    def test_add(self):
+        self.assertEqual(calc("1+2"), 3)
+
+    def test_sub(self):
+        self.assertEqual(calc("5-3"), 2)
+
+    def test_mul(self):
+        self.assertEqual(calc("3*4"), 12)
+
+    def test_double_unary(self):
+        self.assertEqual(calc("--3"), 3)
+
+    def test_nested_parens(self):
+        self.assertEqual(calc("((2+3))*4"), 20)
+
+
+class TestDivision(unittest.TestCase):
+    def test_true_division(self):
+        self.assertEqual(calc("7/2"), 3.5)
+
+    def test_division_by_zero(self):
+        with self.assertRaises(EvalError):
+            calc("1/0")
+
+    def test_division_by_zero_expr(self):
+        with self.assertRaises(EvalError):
+            calc("5/(3-3)")
+
+    def test_not_zero_division_error(self):
+        try:
+            calc("1/0")
+        except EvalError:
+            pass
+        except ZeroDivisionError:
+            self.fail("ZeroDivisionError escaped the API — must be EvalError")
+
+    def test_division_chain(self):
+        self.assertEqual(calc("12/4/3"), 1)
+
+
+class TestResultType(unittest.TestCase):
+    def test_whole_division_is_int(self):
+        result = calc("4/2")
+        self.assertEqual(result, 2)
+        self.assertIsInstance(result, int)
+
+    def test_non_whole_division_is_float(self):
+        result = calc("7/2")
+        self.assertEqual(result, 3.5)
+        self.assertIsInstance(result, float)
+
+    def test_int_add_is_int(self):
+        result = calc("1+2")
+        self.assertIsInstance(result, int)
+
+    def test_unary_minus_int(self):
+        result = calc("-3")
+        self.assertEqual(result, -3)
+        self.assertIsInstance(result, int)
+
+    def test_float_literal(self):
+        result = calc("1.5+1.5")
+        self.assertEqual(result, 3)
+        self.assertIsInstance(result, int)
+
+
+if __name__ == '__main__':
+    unittest.main()

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

@@ -0,0 +1,125 @@
+import unittest
+from calc.lexer import tokenize, Token, LexError
+
+
+def kinds(src):
+    return [t.kind for t in tokenize(src)]
+
+
+def tok(src):
+    return [(t.kind, t.value) for t in tokenize(src)]
+
+
+class TestNumbers(unittest.TestCase):
+    def test_integer(self):
+        result = tokenize("42")
+        self.assertEqual(result, [Token('NUMBER', 42), Token('EOF', None)])
+
+    def test_float(self):
+        result = tokenize("3.14")
+        self.assertEqual(len(result), 2)
+        self.assertEqual(result[0].kind, 'NUMBER')
+        self.assertAlmostEqual(result[0].value, 3.14)
+        self.assertEqual(result[1].kind, 'EOF')
+
+    def test_float_leading_dot(self):
+        result = tokenize(".5")
+        self.assertEqual(result[0].kind, 'NUMBER')
+        self.assertAlmostEqual(result[0].value, 0.5)
+
+    def test_float_trailing_dot(self):
+        result = tokenize("10.")
+        self.assertEqual(result[0].kind, 'NUMBER')
+        self.assertAlmostEqual(result[0].value, 10.0)
+
+    def test_number_value_is_int_for_integer(self):
+        result = tokenize("42")
+        self.assertIsInstance(result[0].value, int)
+
+    def test_number_value_is_float_for_float(self):
+        result = tokenize("3.14")
+        self.assertIsInstance(result[0].value, float)
+
+
+class TestOperatorsAndParens(unittest.TestCase):
+    def test_plus(self):
+        self.assertIn(('PLUS', '+'), tok("+"))
+
+    def test_minus(self):
+        self.assertIn(('MINUS', '-'), tok("-"))
+
+    def test_star(self):
+        self.assertIn(('STAR', '*'), tok("*"))
+
+    def test_slash(self):
+        self.assertIn(('SLASH', '/'), tok("/"))
+
+    def test_lparen(self):
+        self.assertIn(('LPAREN', '('), tok("("))
+
+    def test_rparen(self):
+        self.assertIn(('RPAREN', ')'), tok(")"))
+
+    def test_expression_kinds(self):
+        self.assertEqual(
+            kinds("1+2*3"),
+            ['NUMBER', 'PLUS', 'NUMBER', 'STAR', 'NUMBER', 'EOF']
+        )
+
+    def test_complex_expression(self):
+        self.assertEqual(
+            kinds("3.5*(1-2)"),
+            ['NUMBER', 'STAR', 'LPAREN', 'NUMBER', 'MINUS', 'NUMBER', 'RPAREN', 'EOF']
+        )
+
+
+class TestWhitespaceAndErrors(unittest.TestCase):
+    def test_whitespace_skipped(self):
+        self.assertEqual(
+            kinds("  12  +  3 "),
+            ['NUMBER', 'PLUS', 'NUMBER', 'EOF']
+        )
+
+    def test_whitespace_values(self):
+        tokens = tokenize("  12  +  3 ")
+        self.assertEqual(tokens[0].value, 12)
+        self.assertEqual(tokens[2].value, 3)
+
+    def test_tab_skipped(self):
+        self.assertEqual(kinds("1\t+\t2"), ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_invalid_at_raises(self):
+        with self.assertRaises(LexError):
+            tokenize("1 @ 2")
+
+    def test_invalid_dollar_raises(self):
+        with self.assertRaises(LexError):
+            tokenize("$")
+
+    def test_invalid_letter_raises(self):
+        with self.assertRaises(LexError):
+            tokenize("a")
+
+    def test_lexerror_message_contains_char(self):
+        try:
+            tokenize("1 @ 2")
+            self.fail("Expected LexError")
+        except LexError as e:
+            self.assertIn('@', str(e))
+
+    def test_lexerror_message_contains_position(self):
+        try:
+            tokenize("1 @ 2")
+            self.fail("Expected LexError")
+        except LexError as e:
+            self.assertIn('2', str(e))
+
+    def test_complex_with_parens_values(self):
+        tokens = tokenize("3.5*(1-2)")
+        self.assertAlmostEqual(tokens[0].value, 3.5)
+        self.assertEqual(tokens[3].value, 1)
+        self.assertEqual(tokens[5].value, 2)
+
+
+if __name__ == '__main__':
+    unittest.main()

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

@@ -0,0 +1,170 @@
+import unittest
+from calc.lexer import tokenize
+from calc.parser import parse, ParseError, Num, BinOp, Unary
+
+
+def tree(src):
+    return repr(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(
+            tree('1+2*3'),
+            "BinOp('+', Num(1), BinOp('*', Num(2), Num(3)))",
+        )
+
+    def test_mul_then_add(self):
+        # 2*3+1 -> BinOp('+', BinOp('*', Num(2), Num(3)), Num(1))
+        self.assertEqual(
+            tree('2*3+1'),
+            "BinOp('+', BinOp('*', Num(2), Num(3)), Num(1))",
+        )
+
+    def test_sub_then_div(self):
+        # 10-6/2 -> BinOp('-', Num(10), BinOp('/', Num(6), Num(2)))
+        self.assertEqual(
+            tree('10-6/2'),
+            "BinOp('-', Num(10), BinOp('/', Num(6), Num(2)))",
+        )
+
+    def test_div_then_sub(self):
+        # 6/2-1 -> BinOp('-', BinOp('/', Num(6), Num(2)), Num(1))
+        self.assertEqual(
+            tree('6/2-1'),
+            "BinOp('-', BinOp('/', Num(6), Num(2)), Num(1))",
+        )
+
+
+class TestLeftAssociativity(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(
+            tree('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(
+            tree('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(
+            tree('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(
+            tree('2*3*4'),
+            "BinOp('*', BinOp('*', Num(2), Num(3)), Num(4))",
+        )
+
+
+class TestParentheses(unittest.TestCase):
+    """D3 — parens override precedence."""
+
+    def test_paren_overrides_mul(self):
+        # (1+2)*3 -> BinOp('*', BinOp('+', Num(1), Num(2)), Num(3))
+        self.assertEqual(
+            tree('(1+2)*3'),
+            "BinOp('*', BinOp('+', Num(1), Num(2)), Num(3))",
+        )
+
+    def test_paren_overrides_div(self):
+        # 8/(2+2) -> BinOp('/', Num(8), BinOp('+', Num(2), Num(2)))
+        self.assertEqual(
+            tree('8/(2+2)'),
+            "BinOp('/', Num(8), BinOp('+', Num(2), Num(2)))",
+        )
+
+    def test_nested_parens(self):
+        # ((3)) -> Num(3)
+        self.assertEqual(tree('((3))'), 'Num(3)')
+
+    def test_paren_in_sub(self):
+        # 10-(3+2) -> BinOp('-', Num(10), BinOp('+', Num(3), Num(2)))
+        self.assertEqual(
+            tree('10-(3+2)'),
+            "BinOp('-', Num(10), BinOp('+', Num(3), Num(2)))",
+        )
+
+
+class TestUnaryMinus(unittest.TestCase):
+    """D4 — unary minus."""
+
+    def test_unary_simple(self):
+        self.assertEqual(tree('-5'), "Unary('-', Num(5))")
+
+    def test_unary_grouped(self):
+        self.assertEqual(
+            tree('-(1+2)'),
+            "Unary('-', BinOp('+', Num(1), Num(2)))",
+        )
+
+    def test_unary_in_mul(self):
+        # 3 * -2 -> BinOp('*', Num(3), Unary('-', Num(2)))
+        self.assertEqual(
+            tree('3 * -2'),
+            "BinOp('*', Num(3), Unary('-', Num(2)))",
+        )
+
+    def test_double_unary(self):
+        # --5 -> Unary('-', Unary('-', Num(5)))
+        self.assertEqual(
+            tree('--5'),
+            "Unary('-', Unary('-', Num(5)))",
+        )
+
+    def test_unary_in_add(self):
+        # 1 + -2 -> BinOp('+', Num(1), Unary('-', Num(2)))
+        self.assertEqual(
+            tree('1 + -2'),
+            "BinOp('+', Num(1), Unary('-', Num(2)))",
+        )
+
+
+class TestErrors(unittest.TestCase):
+    """D5 — malformed input raises ParseError."""
+
+    def _raises(self, src):
+        with self.assertRaises(ParseError):
+            parse(tokenize(src))
+
+    def test_trailing_operator(self):
+        self._raises('1 +')
+
+    def test_unclosed_paren(self):
+        self._raises('(1')
+
+    def test_two_numbers(self):
+        self._raises('1 2')
+
+    def test_close_open_paren(self):
+        self._raises(')(')
+
+    def test_empty_string(self):
+        self._raises('')
+
+    def test_just_operator(self):
+        self._raises('+')
+
+    def test_mismatched_paren(self):
+        self._raises('(1+2')
+
+    def test_extra_close_paren(self):
+        self._raises('1+2)')
+
+
+if __name__ == '__main__':
+    unittest.main()