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

calculators/builder-adversary-min/run-04/calc/evaluator.py

@@ -0,0 +1,41 @@
+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 mathematical value is a whole number, return int;
+    otherwise return float.
+    """
+    if isinstance(node, Num):
+        return node.value
+    if isinstance(node, Unary):
+        v = evaluate(node.operand)
+        if node.op == '-':
+            return _normalize(-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 _normalize(left + right)
+        if node.op == '-':
+            return _normalize(left - right)
+        if node.op == '*':
+            return _normalize(left * right)
+        if node.op == '/':
+            if right == 0:
+                raise EvalError("division by zero")
+            return _normalize(left / right)
+        raise EvalError(f"unknown binary op {node.op!r}")
+    raise EvalError(f"unknown node type {type(node).__name__}")
+
+
+def _normalize(v):
+    if isinstance(v, float) and v == int(v):
+        return int(v)
+    return v

calculators/builder-adversary-min/run-04/calc/lexer.py

@@ -0,0 +1,46 @@
+from dataclasses import dataclass
+from typing import Union
+
+
+class LexError(Exception):
+    pass
+
+
+@dataclass
+class Token:
+    kind: str
+    value: Union[int, float, str, None]
+
+
+_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
+        elif ch in _SINGLE:
+            tokens.append(Token(_SINGLE[ch], ch))
+            i += 1
+        elif ch.isdigit() or ch == '.':
+            j = i
+            while j < len(src) and (src[j].isdigit() or src[j] == '.'):
+                j += 1
+            num_str = src[i:j]
+            value = float(num_str) if '.' in num_str else int(num_str)
+            tokens.append(Token('NUMBER', value))
+            i = j
+        else:
+            raise LexError(f"unexpected character {ch!r} at position {i}")
+    tokens.append(Token('EOF', None))
+    return tokens

calculators/builder-adversary-min/run-04/calc/parser.py

@@ -0,0 +1,106 @@
+from dataclasses import dataclass
+from typing import Any
+from calc.lexer import Token
+
+
+class ParseError(Exception):
+    pass
+
+
+@dataclass
+class Num:
+    value: Any
+
+    def __repr__(self):
+        return f"Num({self.value!r})"
+
+
+@dataclass
+class BinOp:
+    op: str
+    left: Any
+    right: Any
+
+    def __repr__(self):
+        return f"BinOp({self.op!r}, {self.left!r}, {self.right!r})"
+
+
+@dataclass
+class Unary:
+    op: str
+    operand: Any
+
+    def __repr__(self):
+        return f"Unary({self.op!r}, {self.operand!r})"
+
+
+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) -> Token:
+        tok = self._peek()
+        if tok.kind != kind:
+            raise ParseError(f"expected {kind!r}, got {tok.kind!r} ({tok.value!r})")
+        self._pos += 1
+        return tok
+
+    def _advance(self) -> Token:
+        tok = self._tokens[self._pos]
+        self._pos += 1
+        return tok
+
+    def parse(self):
+        if self._peek().kind == 'EOF':
+            raise ParseError("empty input")
+        node = self._expr()
+        if self._peek().kind != 'EOF':
+            tok = self._peek()
+            raise ParseError(f"unexpected token {tok.kind!r} ({tok.value!r})")
+        return node
+
+    # expr → term (('+' | '-') term)*
+    def _expr(self):
+        node = self._term()
+        while self._peek().kind in ('PLUS', 'MINUS'):
+            op = self._advance().value
+            right = self._term()
+            node = BinOp(op, node, right)
+        return node
+
+    # term → unary (('*' | '/') unary)*
+    def _term(self):
+        node = self._unary()
+        while self._peek().kind in ('STAR', 'SLASH'):
+            op = self._advance().value
+            right = self._unary()
+            node = BinOp(op, node, right)
+        return node
+
+    # unary → '-' unary | primary
+    def _unary(self):
+        if self._peek().kind == 'MINUS':
+            self._advance()
+            return Unary('-', self._unary())
+        return self._primary()
+
+    # primary → NUMBER | '(' expr ')'
+    def _primary(self):
+        tok = self._peek()
+        if tok.kind == 'NUMBER':
+            self._advance()
+            return Num(tok.value)
+        if tok.kind == 'LPAREN':
+            self._advance()
+            node = self._expr()
+            self._consume('RPAREN')
+            return node
+        raise ParseError(f"unexpected token {tok.kind!r} ({tok.value!r})")
+
+
+def parse(tokens: list):
+    return _Parser(tokens).parse()

calculators/builder-adversary-min/run-04/calc/test_evaluator.py

@@ -0,0 +1,63 @@
+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_override_precedence(self):
+        self.assertEqual(calc("(2+3)*4"), 20)
+
+    def test_left_assoc_subtraction(self):
+        self.assertEqual(calc("8-3-2"), 3)
+
+    def test_unary_minus(self):
+        self.assertEqual(calc("-2+5"), 3)
+
+    def test_unary_minus_with_multiply(self):
+        self.assertEqual(calc("2*-3"), -6)
+
+
+class TestDivision(unittest.TestCase):
+    def test_true_division(self):
+        self.assertEqual(calc("7/2"), 3.5)
+
+    def test_division_by_zero_raises_eval_error(self):
+        with self.assertRaises(EvalError):
+            calc("1/0")
+
+    def test_division_by_zero_not_bare_zerodivision(self):
+        try:
+            calc("1/0")
+        except EvalError:
+            pass
+        except ZeroDivisionError:
+            self.fail("ZeroDivisionError escaped; expected EvalError")
+
+
+class TestResultType(unittest.TestCase):
+    def test_whole_division_returns_int(self):
+        result = calc("4/2")
+        self.assertEqual(result, 2)
+        self.assertIsInstance(result, int)
+
+    def test_non_whole_division_returns_float(self):
+        result = calc("7/2")
+        self.assertEqual(result, 3.5)
+        self.assertIsInstance(result, float)
+
+    def test_integer_add(self):
+        result = calc("1+1")
+        self.assertEqual(result, 2)
+        self.assertIsInstance(result, int)
+
+
+if __name__ == "__main__":
+    unittest.main()

calculators/builder-adversary-min/run-04/calc/test_lexer.py

@@ -0,0 +1,90 @@
+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):
+        tokens = tokenize("42")
+        self.assertEqual(tokens[0], Token('NUMBER', 42))
+        self.assertEqual(tokens[0].value, 42)
+        self.assertIsInstance(tokens[0].value, int)
+        self.assertEqual(tokens[1].kind, 'EOF')
+
+    def test_float(self):
+        t = tokenize("3.14")
+        self.assertEqual(t[0].kind, 'NUMBER')
+        self.assertAlmostEqual(t[0].value, 3.14)
+        self.assertIsInstance(t[0].value, float)
+
+    def test_leading_dot(self):
+        t = tokenize(".5")
+        self.assertEqual(t[0].kind, 'NUMBER')
+        self.assertAlmostEqual(t[0].value, 0.5)
+
+    def test_trailing_dot(self):
+        t = tokenize("10.")
+        self.assertEqual(t[0].kind, 'NUMBER')
+        self.assertAlmostEqual(t[0].value, 10.0)
+        self.assertIsInstance(t[0].value, float)
+
+
+class TestOperatorsAndParens(unittest.TestCase):
+    def test_1plus2star3(self):
+        self.assertEqual(kinds("1+2*3"),
+                         ['NUMBER', 'PLUS', 'NUMBER', 'STAR', 'NUMBER', 'EOF'])
+
+    def test_all_operators(self):
+        self.assertEqual(kinds("+-*/()"),
+                         ['PLUS', 'MINUS', 'STAR', 'SLASH', 'LPAREN', 'RPAREN', 'EOF'])
+
+
+class TestWhitespaceAndErrors(unittest.TestCase):
+    def test_spaces_skipped(self):
+        self.assertEqual(kinds("  12  +  3 "),
+                         ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_tabs_skipped(self):
+        self.assertEqual(kinds("1\t+\t2"), ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_complex_expression(self):
+        result = values("3.5*(1-2)")
+        self.assertEqual(result, [
+            ('NUMBER', 3.5),
+            ('STAR', '*'),
+            ('LPAREN', '('),
+            ('NUMBER', 1),
+            ('MINUS', '-'),
+            ('NUMBER', 2),
+            ('RPAREN', ')'),
+            ('EOF', None),
+        ])
+
+    def test_invalid_at_raises(self):
+        with self.assertRaises(LexError) as ctx:
+            tokenize("1 @ 2")
+        self.assertIn('@', str(ctx.exception))
+
+    def test_invalid_dollar_raises(self):
+        with self.assertRaises(LexError):
+            tokenize("$10")
+
+    def test_invalid_letter_raises(self):
+        with self.assertRaises(LexError):
+            tokenize("abc")
+
+    def test_error_message_includes_position(self):
+        with self.assertRaises(LexError) as ctx:
+            tokenize("1 @ 2")
+        self.assertIn('2', str(ctx.exception))
+
+
+if __name__ == '__main__':
+    unittest.main()

calculators/builder-adversary-min/run-04/calc/test_parser.py

@@ -0,0 +1,106 @@
+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):
+    def test_mul_over_add(self):
+        # 1+2*3 → BinOp('+', Num(1), BinOp('*', Num(2), Num(3)))
+        result = p("1+2*3")
+        self.assertEqual(result, BinOp('+', Num(1), BinOp('*', Num(2), Num(3))))
+
+    def test_add_over_mul_left(self):
+        # 2*3+4 → BinOp('+', BinOp('*', Num(2), Num(3)), Num(4))
+        result = p("2*3+4")
+        self.assertEqual(result, BinOp('+', BinOp('*', Num(2), Num(3)), Num(4)))
+
+    def test_div_over_sub(self):
+        # 10-6/2 → BinOp('-', Num(10), BinOp('/', Num(6), Num(2)))
+        result = p("10-6/2")
+        self.assertEqual(result, BinOp('-', Num(10), BinOp('/', Num(6), Num(2))))
+
+
+class TestLeftAssociativity(unittest.TestCase):
+    def test_sub_left_assoc(self):
+        # 8-3-2 → BinOp('-', BinOp('-', Num(8), Num(3)), Num(2))
+        result = p("8-3-2")
+        self.assertEqual(result, 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))
+        result = p("8/4/2")
+        self.assertEqual(result, 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))
+        result = p("1+2+3")
+        self.assertEqual(result, BinOp('+', BinOp('+', Num(1), Num(2)), Num(3)))
+
+
+class TestParentheses(unittest.TestCase):
+    def test_parens_override_precedence(self):
+        # (1+2)*3 → BinOp('*', BinOp('+', Num(1), Num(2)), Num(3))
+        result = p("(1+2)*3")
+        self.assertEqual(result, BinOp('*', BinOp('+', Num(1), Num(2)), Num(3)))
+
+    def test_nested_parens(self):
+        # ((4)) → Num(4)
+        result = p("((4))")
+        self.assertEqual(result, Num(4))
+
+    def test_parens_in_sum(self):
+        # 2*(3+4) → BinOp('*', Num(2), BinOp('+', Num(3), Num(4)))
+        result = p("2*(3+4)")
+        self.assertEqual(result, BinOp('*', Num(2), BinOp('+', Num(3), Num(4))))
+
+
+class TestUnaryMinus(unittest.TestCase):
+    def test_simple_negation(self):
+        # -5 → Unary('-', Num(5))
+        result = p("-5")
+        self.assertEqual(result, Unary('-', Num(5)))
+
+    def test_negation_of_group(self):
+        # -(1+2) → Unary('-', BinOp('+', Num(1), Num(2)))
+        result = p("-(1+2)")
+        self.assertEqual(result, Unary('-', BinOp('+', Num(1), Num(2))))
+
+    def test_mul_with_unary(self):
+        # 3 * -2 → BinOp('*', Num(3), Unary('-', Num(2)))
+        result = p("3 * -2")
+        self.assertEqual(result, BinOp('*', Num(3), Unary('-', Num(2))))
+
+    def test_double_negation(self):
+        # --5 → Unary('-', Unary('-', Num(5)))
+        result = p("--5")
+        self.assertEqual(result, Unary('-', Unary('-', Num(5))))
+
+
+class TestErrors(unittest.TestCase):
+    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_numbers(self):
+        with self.assertRaises(ParseError):
+            p("1 2")
+
+    def test_close_before_open(self):
+        with self.assertRaises(ParseError):
+            p(")(")
+
+    def test_empty(self):
+        with self.assertRaises(ParseError):
+            p("")
+
+
+if __name__ == '__main__':
+    unittest.main()