126 lines
3.9 KiB
Python
126 lines
3.9 KiB
Python
"""Tests for calc.parser — assert on tree structure, not evaluation."""
|
|
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_mul(self):
|
|
# 1+2*3 => BinOp('+', Num(1), BinOp('*', Num(2), Num(3)))
|
|
tree = p("1+2*3")
|
|
self.assertEqual(tree, BinOp('+', Num(1), BinOp('*', Num(2), Num(3))))
|
|
|
|
def test_mul_add(self):
|
|
# 2*3+4 => BinOp('+', BinOp('*', Num(2), Num(3)), Num(4))
|
|
tree = p("2*3+4")
|
|
self.assertEqual(tree, BinOp('+', BinOp('*', Num(2), Num(3)), Num(4)))
|
|
|
|
def test_sub_div(self):
|
|
# 10-6/2 => BinOp('-', Num(10), BinOp('/', Num(6), Num(2)))
|
|
tree = p("10-6/2")
|
|
self.assertEqual(tree, BinOp('-', Num(10), BinOp('/', Num(6), Num(2))))
|
|
|
|
|
|
class TestLeftAssociativity(unittest.TestCase):
|
|
"""D2 — same-precedence ops associate left."""
|
|
|
|
def test_sub_assoc(self):
|
|
# 8-3-2 => BinOp('-', BinOp('-', Num(8), Num(3)), Num(2))
|
|
tree = p("8-3-2")
|
|
self.assertEqual(tree, BinOp('-', BinOp('-', Num(8), Num(3)), Num(2)))
|
|
|
|
def test_div_assoc(self):
|
|
# 8/4/2 => BinOp('/', BinOp('/', Num(8), Num(4)), Num(2))
|
|
tree = p("8/4/2")
|
|
self.assertEqual(tree, BinOp('/', BinOp('/', Num(8), Num(4)), Num(2)))
|
|
|
|
def test_add_assoc(self):
|
|
# 1+2+3 => BinOp('+', BinOp('+', Num(1), Num(2)), Num(3))
|
|
tree = p("1+2+3")
|
|
self.assertEqual(tree, BinOp('+', BinOp('+', Num(1), Num(2)), Num(3)))
|
|
|
|
def test_mul_assoc(self):
|
|
# 2*3*4 => BinOp('*', BinOp('*', Num(2), Num(3)), Num(4))
|
|
tree = p("2*3*4")
|
|
self.assertEqual(tree, BinOp('*', BinOp('*', Num(2), Num(3)), Num(4)))
|
|
|
|
|
|
class TestParentheses(unittest.TestCase):
|
|
"""D3 — parens override precedence."""
|
|
|
|
def test_paren_add_mul(self):
|
|
# (1+2)*3 => BinOp('*', BinOp('+', Num(1), Num(2)), Num(3))
|
|
tree = p("(1+2)*3")
|
|
self.assertEqual(tree, BinOp('*', BinOp('+', Num(1), Num(2)), Num(3)))
|
|
|
|
def test_nested_parens(self):
|
|
# ((2+3)) => BinOp('+', Num(2), Num(3)) -- outer parens just unwrap
|
|
tree = p("((2+3))")
|
|
self.assertEqual(tree, BinOp('+', Num(2), Num(3)))
|
|
|
|
def test_paren_single_num(self):
|
|
tree = p("(42)")
|
|
self.assertEqual(tree, Num(42))
|
|
|
|
|
|
class TestUnaryMinus(unittest.TestCase):
|
|
"""D4 — leading and nested unary minus."""
|
|
|
|
def test_unary_simple(self):
|
|
# -5 => Unary('-', Num(5))
|
|
tree = p("-5")
|
|
self.assertEqual(tree, Unary('-', Num(5)))
|
|
|
|
def test_unary_paren(self):
|
|
# -(1+2) => Unary('-', BinOp('+', Num(1), Num(2)))
|
|
tree = p("-(1+2)")
|
|
self.assertEqual(tree, Unary('-', BinOp('+', Num(1), Num(2))))
|
|
|
|
def test_mul_unary(self):
|
|
# 3 * -2 => BinOp('*', Num(3), Unary('-', Num(2)))
|
|
tree = p("3 * -2")
|
|
self.assertEqual(tree, BinOp('*', Num(3), Unary('-', Num(2))))
|
|
|
|
def test_double_unary(self):
|
|
# --5 => Unary('-', Unary('-', Num(5)))
|
|
tree = p("--5")
|
|
self.assertEqual(tree, Unary('-', Unary('-', Num(5))))
|
|
|
|
|
|
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_string(self):
|
|
with self.assertRaises(ParseError):
|
|
p("")
|
|
|
|
def test_only_paren(self):
|
|
with self.assertRaises(ParseError):
|
|
p("()")
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|