def test_dummy(self):
# TODO: Implement similar test in the expression parser
expr = "1 1 1 1 +"
expr_2 = "+ 1 1 1 1"
tokens_list = tokenize(expr)
output_queue = shunting_yard.infix_to_rpn(tokens_list)
#print(output_queue)
tokens_list_2 = tokenize(expr_2)
output_queue_2 = shunting_yard.infix_to_rpn(tokens_list_2)
def test_tokenize_nums(self):
expr = "1 1 1 1 +"
expr_2 = "+ 1 1 1 1"
tokens_list = parser.tokenize(expr)
tokens_list_2 = parser.tokenize(expr_2)
expected_list = [1.0, 1.0, 1.0, 1.0, '+']
expected_list_2 = ['+', 1.0, 1.0, 1.0, 1.0]
self.assertEqual(expected_list, tokens_list)
self.assertEqual(expected_list_2, tokens_list_2)
def test_catch_parser_exception_normal_float(self):
expr = "1.0 + 0.5"
tokens_list = parser.tokenize(expr)
rpn_list = shunting_yard.infix_to_rpn(tokens_list)
result = exceptions.catch_calc_errors(
lambda: stack_machine.calculate(rpn_list))
self.assertEqual('success', result['status'])
self.assertEqual('1.5', result['result'])
def process_args(args):
''' Entry point for command line usage. The function accepts math problem
from command line. Returns a solution for that problem.
'''
_, *expression_list = args
expression = " ".join(expression_list)
tokens = expression_parser.tokenize(expression)
rpn_list = shunting_yard.infix_to_rpn(tokens)
return stack_machine.calculate(rpn_list)
def test_mismatched_parens_left(self):
expr = "(1 + 2) - 3)) * 4 / 5)"
tokens_list = tokenize(expr)
with self.assertRaisesRegex(CalcException, r'Missing open paren\(s\)'):
shunting_yard.infix_to_rpn(tokens_list)
def test_mismatched_parens_right(self):
expr = "(1 + 2 (- 3) * 4 / 5 (4 (4 ("
tokens_list = tokenize(expr)
with self.assertRaisesRegex(CalcException,
r'Missing close paren\(s\)'):
shunting_yard.infix_to_rpn(tokens_list)
def test_missing_fn_args(self):
expr = "1 + log 27 , 3 * 3"
tokens_list = tokenize(expr)
with self.assertRaisesRegex(CalcException, "Missing function args"):
shunting_yard.infix_to_rpn(tokens_list), 'actual list'
def test_invalid_arity(self):
expr = "1 + log(27, 3, 4, 5) * 3"
tokens_list = tokenize(expr)
with self.assertRaisesRegex(CalcException, "Invalid arity"):
shunting_yard.infix_to_rpn(tokens_list), 'actual list'
def test_shunting_yard_unary(self):
expr = "1 + sqrt(9)*2"
tokens_list = tokenize(expr)
expected_list = [1.0, 9.0, 'sqrt', 2.0, '*', '+']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_function_with_power(self):
expr = "2^log(27 , 3)"
tokens_list = tokenize(expr)
expected_list = [2.0, 27.0, 3.0, 'log', '^']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_catch_right_paren_exception(self):
expr = "(1 + 2 (- 3) * 4 / 5 (4 (4 ()"
tokens_list = parser.tokenize(expr)
result = exceptions.catch_calc_errors(
lambda: shunting_yard.infix_to_rpn(tokens_list))
self.assertEqual('error', result['status'])
def test_catch_parser_exception(self):
expr = "1 + 2 - 3.45 + lkjkl * 4 / 5"
result = exceptions.catch_calc_errors(lambda: parser.tokenize(expr))
self.assertEqual('error', result['status'])
def calculate_expr(expression):
tokens = expression_parser.tokenize(expression)
rpn_list = shunting_yard.infix_to_rpn(tokens)
return stack_machine.calculate(rpn_list)
def test_shunting_yard_function(self):
expr = "1 + log(27, 3) * 3"
tokens_list = tokenize(expr)
expected_list = [1.0, 27.0, 3.0, 'log', 3.0, '*', '+']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_paren_priority(self):
expr = "(1 + 2) * 3"
tokens_list = tokenize(expr)
expected_list = [1.0, 2.0, '+', 3.0, '*']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_simple(self):
expr = "1 + 2.0"
tokens_list = tokenize(expr)
expected_list = [1.0, 2.0, '+']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_paren_priority_complex(self):
expr = "1 + 2 + 3 + (6 / 8)"
tokens_list = tokenize(expr)
expected_list = [1, 2, '+', 3, '+', 6, 8, '/', '+']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_function_with_double_power(self):
expr = "3^log(9 , 3)^2"
tokens_list = tokenize(expr)
expected_list = [3.0, 9.0, 3.0, 'log', 2.0, '^', '^']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_right_associativity(self):
expr = "(1 + 1) ^ 2"
tokens_list = tokenize(expr)
expected_list = [1.0, 1.0, '+', 2.0, '^']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_shunting_yard_abs(self):
expr = "1 - abs(-2)"
tokens_list = tokenize(expr)
expected_list = [1.0, -2.0, 'abs', '-']
output_queue = shunting_yard.infix_to_rpn(tokens_list)
self.assertEqual(expected_list, output_queue)
def test_tokenization(self):
expr = "1 + 2 - 3.45 * 4 / 5"
tokens_list = parser.tokenize(expr)
expected_list = [1.0, '+', 2.0, '-', 3.45, '*', 4.0, '/', 5.0]
self.assertEqual(expected_list, tokens_list)
