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

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

@@ -0,0 +1,42 @@
+"""Evaluator for calc AST nodes.
+
+evaluate(node) -> int | float
+
+Result-type rule: whole-valued results are returned as int;
+fractional results as float. So 4/2 -> 2, 7/2 -> 3.5.
+"""
+
+from calc.parser import Num, BinOp, Unary
+
+
+class EvalError(Exception):
+    pass
+
+
+def _normalize(value):
+    """Convert a whole-valued float to int; leave everything else alone."""
+    if isinstance(value, float) and value.is_integer():
+        return int(value)
+    return value
+
+
+def evaluate(node):
+    """Walk an AST node and return its numeric value."""
+    if isinstance(node, Num):
+        return _normalize(node.value)
+    if isinstance(node, Unary):
+        return _normalize(-evaluate(node.operand))
+    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 node type: {type(node).__name__}')

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

@@ -0,0 +1,54 @@
+import re
+
+_NUMBER_RE = re.compile(r'\d+\.?\d*|\.\d+')
+
+_SINGLE = {
+    '+': 'PLUS',
+    '-': 'MINUS',
+    '*': 'STAR',
+    '/': 'SLASH',
+    '(': 'LPAREN',
+    ')': 'RPAREN',
+}
+
+
+class LexError(Exception):
+    pass
+
+
+class Token:
+    __slots__ = ('kind', 'value')
+
+    def __init__(self, kind: str, value):
+        self.kind = kind
+        self.value = value
+
+    def __repr__(self):
+        return f'Token({self.kind}, {self.value!r})'
+
+    def __eq__(self, other):
+        return isinstance(other, Token) and self.kind == other.kind and self.value == other.value
+
+
+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
+        m = _NUMBER_RE.match(src, i)
+        if m:
+            raw = m.group()
+            value = float(raw) if '.' in raw else int(raw)
+            tokens.append(Token('NUMBER', value))
+            i = m.end()
+            continue
+        raise LexError(f"unexpected character {ch!r} at position {i}")
+    tokens.append(Token('EOF', None))
+    return tokens

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

@@ -0,0 +1,127 @@
+"""Recursive-descent parser for calc expressions.
+
+Grammar:
+    expr    := term (('+' | '-') term)*
+    term    := factor (('*' | '/') factor)*
+    factor  := '-' factor | primary
+    primary := NUMBER | '(' expr ')'
+
+Node shapes:
+    Num(value)              — a numeric literal; value is int or float
+    BinOp(op, left, right)  — op is one of '+' '-' '*' '/'
+    Unary(op, operand)      — op is '-'
+"""
+
+
+class ParseError(Exception):
+    pass
+
+
+class Num:
+    __slots__ = ('value',)
+
+    def __init__(self, value):
+        self.value = value
+
+    def __repr__(self):
+        return f'Num({self.value!r})'
+
+    def __eq__(self, other):
+        return isinstance(other, Num) and self.value == other.value
+
+
+class BinOp:
+    __slots__ = ('op', 'left', 'right')
+
+    def __init__(self, op, left, right):
+        self.op = op
+        self.left = left
+        self.right = right
+
+    def __repr__(self):
+        return f'BinOp({self.op!r}, {self.left!r}, {self.right!r})'
+
+    def __eq__(self, other):
+        return (isinstance(other, BinOp) and self.op == other.op
+                and self.left == other.left and self.right == other.right)
+
+
+class Unary:
+    __slots__ = ('op', 'operand')
+
+    def __init__(self, op, operand):
+        self.op = op
+        self.operand = operand
+
+    def __repr__(self):
+        return f'Unary({self.op!r}, {self.operand!r})'
+
+    def __eq__(self, other):
+        return (isinstance(other, Unary) and self.op == other.op
+                and self.operand == other.operand)
+
+
+class _Parser:
+    def __init__(self, tokens):
+        self._tokens = tokens
+        self._pos = 0
+
+    def _peek(self):
+        return self._tokens[self._pos]
+
+    def _consume(self, kind=None):
+        tok = self._tokens[self._pos]
+        if kind and tok.kind != kind:
+            raise ParseError(f'expected {kind}, got {tok.kind!r}')
+        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':
+            raise ParseError(f'unexpected token {self._peek().kind!r}')
+        return node
+
+    def _expr(self):
+        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 = self._factor()
+        while self._peek().kind in ('STAR', 'SLASH'):
+            op = self._consume().value
+            right = self._factor()
+            node = BinOp(op, node, right)
+        return node
+
+    def _factor(self):
+        if self._peek().kind == 'MINUS':
+            self._consume()
+            operand = self._factor()
+            return Unary('-', operand)
+        return self._primary()
+
+    def _primary(self):
+        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'unclosed parenthesis, got {self._peek().kind!r}')
+            self._consume()
+            return node
+        raise ParseError(f'unexpected token {tok.kind!r}')
+
+
+def parse(tokens):
+    """Parse a token list from tokenize() and return an AST node."""
+    return _Parser(tokens).parse()

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

@@ -0,0 +1,126 @@
+import subprocess
+import sys
+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):
+    """D1 — arithmetic correctness."""
+
+    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_sub_left_assoc(self):
+        self.assertEqual(calc('8-3-2'), 3)
+
+    def test_unary_minus_simple(self):
+        self.assertEqual(calc('-2+5'), 3)
+
+    def test_unary_minus_in_mul(self):
+        self.assertEqual(calc('2*-3'), -6)
+
+    def test_simple_add(self):
+        self.assertEqual(calc('1+2'), 3)
+
+    def test_simple_sub(self):
+        self.assertEqual(calc('10-4'), 6)
+
+    def test_simple_mul(self):
+        self.assertEqual(calc('3*4'), 12)
+
+
+class TestDivision(unittest.TestCase):
+    """D2 — division and EvalError."""
+
+    def test_true_division(self):
+        self.assertAlmostEqual(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_exception(self):
+        try:
+            calc('1/0')
+            self.fail('expected EvalError')
+        except EvalError:
+            pass
+        except ZeroDivisionError:
+            self.fail('ZeroDivisionError escaped the API')
+
+
+class TestResultType(unittest.TestCase):
+    """D3 — result type: whole -> int, fractional -> float."""
+
+    def test_whole_division_returns_int(self):
+        result = calc('4/2')
+        self.assertIsInstance(result, int)
+        self.assertEqual(result, 2)
+
+    def test_fractional_division_returns_float(self):
+        result = calc('7/2')
+        self.assertIsInstance(result, float)
+        self.assertEqual(result, 3.5)
+
+    def test_int_arithmetic_returns_int(self):
+        self.assertIsInstance(calc('2+3'), int)
+
+    def test_whole_float_input_normalizes(self):
+        result = calc('2.0+1.0')
+        self.assertIsInstance(result, int)
+        self.assertEqual(result, 3)
+
+
+class TestCLI(unittest.TestCase):
+    """D4 — CLI behaviour."""
+
+    def _run(self, expr):
+        return subprocess.run(
+            [sys.executable, 'calc.py', expr],
+            capture_output=True, text=True,
+            cwd=__file__.replace('/calc/test_evaluator.py', ''),
+        )
+
+    def test_valid_expression_exits_zero_and_prints_result(self):
+        r = self._run('2+3*4')
+        self.assertEqual(r.returncode, 0)
+        self.assertEqual(r.stdout.strip(), '14')
+
+    def test_invalid_expression_exits_nonzero_and_stderr(self):
+        r = self._run('1 +')
+        self.assertNotEqual(r.returncode, 0)
+        self.assertTrue(r.stderr.strip())
+
+    def test_division_by_zero_exits_nonzero_and_stderr(self):
+        r = self._run('1/0')
+        self.assertNotEqual(r.returncode, 0)
+        self.assertTrue(r.stderr.strip())
+
+    def test_parens_result(self):
+        r = self._run('(2+3)*4')
+        self.assertEqual(r.returncode, 0)
+        self.assertEqual(r.stdout.strip(), '20')
+
+    def test_true_division_result(self):
+        r = self._run('7/2')
+        self.assertEqual(r.returncode, 0)
+        self.assertEqual(r.stdout.strip(), '3.5')
+
+    def test_whole_division_no_dot_zero(self):
+        r = self._run('4/2')
+        self.assertEqual(r.returncode, 0)
+        self.assertEqual(r.stdout.strip(), '2')
+
+
+if __name__ == '__main__':
+    unittest.main()

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

@@ -0,0 +1,120 @@
+import unittest
+from calc.lexer import tokenize, Token, LexError
+
+
+def kinds(src):
+    return [t.kind for t in tokenize(src)]
+
+
+def pairs(src):
+    return [(t.kind, t.value) for t in tokenize(src)]
+
+
+class TestNumbers(unittest.TestCase):
+    def test_integer(self):
+        toks = tokenize("42")
+        self.assertEqual(toks, [Token('NUMBER', 42), Token('EOF', None)])
+
+    def test_float(self):
+        toks = tokenize("3.14")
+        self.assertEqual(toks, [Token('NUMBER', 3.14), Token('EOF', None)])
+
+    def test_float_leading_dot(self):
+        toks = tokenize(".5")
+        self.assertEqual(toks, [Token('NUMBER', 0.5), Token('EOF', None)])
+
+    def test_float_trailing_dot(self):
+        toks = tokenize("10.")
+        self.assertEqual(toks, [Token('NUMBER', 10.0), Token('EOF', None)])
+
+    def test_integer_value_is_int(self):
+        toks = tokenize("7")
+        self.assertIsInstance(toks[0].value, int)
+
+    def test_float_value_is_float(self):
+        toks = tokenize("3.14")
+        self.assertIsInstance(toks[0].value, float)
+
+
+class TestOperatorsAndParens(unittest.TestCase):
+    def test_single_plus(self):
+        self.assertEqual(kinds("+"), ['PLUS', 'EOF'])
+
+    def test_single_minus(self):
+        self.assertEqual(kinds("-"), ['MINUS', 'EOF'])
+
+    def test_single_star(self):
+        self.assertEqual(kinds("*"), ['STAR', 'EOF'])
+
+    def test_single_slash(self):
+        self.assertEqual(kinds("/"), ['SLASH', 'EOF'])
+
+    def test_single_lparen(self):
+        self.assertEqual(kinds("("), ['LPAREN', 'EOF'])
+
+    def test_single_rparen(self):
+        self.assertEqual(kinds(")"), ['RPAREN', 'EOF'])
+
+    def test_expression_1_plus_2_star_3(self):
+        self.assertEqual(kinds("1+2*3"), ['NUMBER', 'PLUS', 'NUMBER', 'STAR', 'NUMBER', 'EOF'])
+
+    def test_expression_3_5_star_paren(self):
+        self.assertEqual(kinds("3.5*(1-2)"),
+                         ['NUMBER', 'STAR', 'LPAREN', 'NUMBER', 'MINUS', 'NUMBER', 'RPAREN', 'EOF'])
+
+
+class TestWhitespaceAndErrors(unittest.TestCase):
+    def test_spaces_between_tokens(self):
+        self.assertEqual(kinds("  12  +  3 "), ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_tab_between_tokens(self):
+        self.assertEqual(kinds("1\t+\t2"), ['NUMBER', 'PLUS', 'NUMBER', 'EOF'])
+
+    def test_spaces_values(self):
+        toks = tokenize("  12  +  3 ")
+        self.assertEqual(toks[0].value, 12)
+        self.assertEqual(toks[1].kind, 'PLUS')
+        self.assertEqual(toks[2].value, 3)
+
+    def test_lex_error_at_sign(self):
+        with self.assertRaises(LexError):
+            tokenize("1 @ 2")
+
+    def test_lex_error_dollar(self):
+        with self.assertRaises(LexError):
+            tokenize("$")
+
+    def test_lex_error_letter(self):
+        with self.assertRaises(LexError):
+            tokenize("x")
+
+    def test_lex_error_message_contains_char(self):
+        try:
+            tokenize("1 @ 2")
+            self.fail("expected LexError")
+        except LexError as e:
+            self.assertIn('@', str(e))
+
+    def test_lex_error_message_contains_position(self):
+        try:
+            tokenize("1 @ 2")
+            self.fail("expected LexError")
+        except LexError as e:
+            # position 2 is the '@'
+            self.assertIn('2', str(e))
+
+    def test_empty_string(self):
+        self.assertEqual(kinds(""), ['EOF'])
+
+    def test_complex_expression(self):
+        toks = tokenize("3.5*(1-2)")
+        self.assertEqual(
+            [(t.kind, t.value) for t in toks],
+            [('NUMBER', 3.5), ('STAR', '*'), ('LPAREN', '('),
+             ('NUMBER', 1), ('MINUS', '-'), ('NUMBER', 2),
+             ('RPAREN', ')'), ('EOF', None)]
+        )
+
+
+if __name__ == '__main__':
+    unittest.main()

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

@@ -0,0 +1,114 @@
+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_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+1 => BinOp('+', BinOp('*', Num(2), Num(3)), Num(1))
+        self.assertEqual(p('2*3+1'), BinOp('+', BinOp('*', Num(2), Num(3)), Num(1)))
+
+    def test_add_then_div(self):
+        # 6+10/2 => BinOp('+', Num(6), BinOp('/', Num(10), Num(2)))
+        self.assertEqual(p('6+10/2'), BinOp('+', Num(6), BinOp('/', Num(10), Num(2))))
+
+    def test_sub_then_mul(self):
+        # 5-2*3 => BinOp('-', Num(5), BinOp('*', Num(2), Num(3)))
+        self.assertEqual(p('5-2*3'), BinOp('-', Num(5), BinOp('*', Num(2), Num(3))))
+
+
+class TestLeftAssociativity(unittest.TestCase):
+    def test_subtraction(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_division(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_addition(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_multiplication(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):
+    def test_parens_override_precedence(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_parens_right(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_nested_parens(self):
+        # ((4)) => Num(4)
+        self.assertEqual(p('((4))'), Num(4))
+
+    def test_parens_with_sub_vs_mul(self):
+        # 3*(4-1) => BinOp('*', Num(3), BinOp('-', Num(4), Num(1)))
+        self.assertEqual(p('3*(4-1)'), BinOp('*', Num(3), BinOp('-', Num(4), Num(1))))
+
+
+class TestUnaryMinus(unittest.TestCase):
+    def test_simple_unary(self):
+        # -5 => Unary('-', Num(5))
+        self.assertEqual(p('-5'), Unary('-', Num(5)))
+
+    def test_unary_parens(self):
+        # -(1+2) => Unary('-', BinOp('+', Num(1), Num(2)))
+        self.assertEqual(p('-(1+2)'), Unary('-', BinOp('+', Num(1), Num(2))))
+
+    def test_mul_unary(self):
+        # 3 * -2 => BinOp('*', Num(3), Unary('-', Num(2)))
+        self.assertEqual(p('3 * -2'), BinOp('*', Num(3), Unary('-', Num(2))))
+
+    def test_double_unary(self):
+        # --5 => Unary('-', Unary('-', Num(5)))
+        self.assertEqual(p('--5'), Unary('-', Unary('-', Num(5))))
+
+    def test_unary_in_add(self):
+        # 1 + -2 => BinOp('+', Num(1), Unary('-', Num(2)))
+        self.assertEqual(p('1 + -2'), BinOp('+', Num(1), Unary('-', Num(2))))
+
+
+class TestErrors(unittest.TestCase):
+    def _raises(self, src):
+        with self.assertRaises(ParseError):
+            p(src)
+
+    def test_trailing_op(self):
+        self._raises('1 +')
+
+    def test_unclosed_paren(self):
+        self._raises('(1')
+
+    def test_two_numbers(self):
+        self._raises('1 2')
+
+    def test_close_then_open(self):
+        self._raises(')(')
+
+    def test_empty(self):
+        self._raises('')
+
+    def test_op_only(self):
+        self._raises('*')
+
+    def test_mismatched_parens(self):
+        self._raises('(1+2')
+
+
+if __name__ == '__main__':
+    unittest.main()