Files
agent-orchestrator-benchmark/calculators/builder-adversary/run-03/calc/test_parser.py

135 lines
4.3 KiB
Python

"""Tests for calc.parser — covers D1 through D5."""
import unittest
from .lexer import tokenize
from .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_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_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_sub_div(self):
# 10-4/2 → BinOp('-', Num(10), BinOp('/', Num(4), Num(2)))
self.assertEqual(p("10-4/2"), BinOp('-', Num(10), BinOp('/', Num(4), Num(2))))
def test_single_number(self):
self.assertEqual(p("42"), Num(42))
def test_single_float(self):
self.assertEqual(p("3.5"), Num(3.5))
class TestLeftAssociativity(unittest.TestCase):
"""D2 — same-precedence operators associate left."""
def test_sub_left(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(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(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(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_paren_overrides_mul(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_paren_overrides_div(self):
# 6/(1+2) → BinOp('/', Num(6), BinOp('+', Num(1), Num(2)))
self.assertEqual(p("6/(1+2)"), BinOp('/', Num(6), BinOp('+', Num(1), Num(2))))
def test_nested_parens(self):
# ((2+3)) → BinOp('+', Num(2), Num(3))
self.assertEqual(p("((2+3))"), BinOp('+', Num(2), Num(3)))
def test_paren_single(self):
self.assertEqual(p("(5)"), Num(5))
class TestUnaryMinus(unittest.TestCase):
"""D4 — unary minus."""
def test_leading(self):
self.assertEqual(p("-5"), Unary('-', Num(5)))
def test_paren_group(self):
# -(1+2) → Unary('-', BinOp('+', Num(1), Num(2)))
self.assertEqual(p("-(1+2)"), Unary('-', BinOp('+', Num(1), Num(2))))
def test_after_mul(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):
"""D5 — malformed input raises ParseError."""
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_then_open(self):
with self.assertRaises(ParseError):
p(")(")
def test_empty(self):
with self.assertRaises(ParseError):
p("")
def test_only_op(self):
with self.assertRaises(ParseError):
p("+")
def test_mismatched_parens(self):
with self.assertRaises(ParseError):
p("(1+2")
def test_parse_error_not_other(self):
for src in ("1 +", "(1", "1 2", ")(", ""):
with self.subTest(src=src):
with self.assertRaises(ParseError):
p(src)
if __name__ == '__main__':
unittest.main()