test_parser.py 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. # vim: set fileencoding=utf-8 :
  2. import unittest
  3. from src.parser import Parser
  4. from src.node import ExpressionNode as Node, ExpressionLeaf as Leaf, \
  5. SPECIAL_TOKENS
  6. from tests.parser import ParserWrapper, run_expressions, line, graph
  7. from tests.rulestestcase import tree
  8. from src.rules.goniometry import sin, cos
  9. from src.rules.derivatives import der
  10. from src.rules.logarithmic import log, ln
  11. class TestParser(unittest.TestCase):
  12. def test_constructor(self):
  13. node = Node('+', Leaf(1), Leaf(4))
  14. self.assertEqual(ParserWrapper(Parser).run(['1 + 4']), node)
  15. def test_identifiers(self):
  16. run_expressions(Parser, [('a', Leaf('a'))])
  17. def test_graph(self):
  18. self.assertEqual(graph(Parser, '4a'), ("""
  19. *
  20. ╭┴╮
  21. 4 a
  22. """).replace('\n ', '\n')[1:-1])
  23. def test_line(self):
  24. self.assertEqual(line(Parser, '4-a'), '4 - a')
  25. def test_reset_after_failure(self):
  26. parser = ParserWrapper(Parser)
  27. parser.run(['-(3a+6b)'])
  28. possibilities1 = parser.parser.possibilities
  29. self.assertNotEqual(possibilities1, [])
  30. parser.run(['5+2*6'])
  31. possibilities2 = parser.parser.possibilities
  32. self.assertNotEqual(possibilities2, [])
  33. self.assertNotEqual(possibilities1, possibilities2)
  34. def test_moved_negation(self):
  35. a, b = tree('a,b')
  36. self.assertEqual(tree('-ab'), (-a) * b)
  37. self.assertEqual(tree('-(ab)'), (-a) * b)
  38. self.assertEqual(tree('-a / b'), (-a) / b)
  39. self.assertEqual(tree('-(a / b)'), (-a) / b)
  40. def test_functions(self):
  41. x = tree('x')
  42. self.assertEqual(tree('sin x'), sin(x))
  43. self.assertEqual(tree('sin 2 x'), sin(2) * x) # FIXME: correct?
  44. self.assertEqual(tree('sin x ^ 2'), sin(x ** 2))
  45. self.assertEqual(tree('sin(x) ^ 2'), sin(x) ** 2)
  46. self.assertEqual(tree('sin(x ^ 2)'), sin(x ** 2))
  47. self.assertEqual(tree('sin cos x'), sin(cos(x)))
  48. self.assertEqual(tree('sin cos x ^ 2'), sin(cos(x ** 2)))
  49. self.assertEqual(tree('sin cos(x) ^ 2'), sin(cos(x) ** 2))
  50. def test_bracket_derivative(self):
  51. x = tree('x')
  52. self.assertEqual(tree('[x]\''), der(x))
  53. self.assertEqual(tree('[x]\'\''), der(der(x)))
  54. def test_delta_derivative(self):
  55. exp, x, d = tree('x ^ 2, x, d')
  56. self.assertEqual(tree('d/dx x ^ 2'), der(exp, x))
  57. self.assertEqual(tree('d / dx x ^ 2'), der(exp, x))
  58. self.assertEqual(tree('d/dx x ^ 2 + x'), der(exp, x) + x)
  59. self.assertEqual(tree('d/dx (x ^ 2 + x)'), der(exp + x, x))
  60. self.assertEqual(tree('d/d'), d / d)
  61. # FIXME: self.assertEqual(tree('d(x ^ 2)/dx'), der(exp, x))
  62. def test_logarithm(self):
  63. x, g = tree('x, g')
  64. self.assertEqual(tree('log(x, e)'), ln(x))
  65. self.assertEqual(tree('log(x, 10)'), log(x))
  66. self.assertEqual(tree('log(x, 2)'), log(x, 2))
  67. self.assertEqual(tree('log(x, g)'), log(x, g))
  68. self.assertEqual(tree('log_2(x)'), log(x, 2))
  69. self.assertEqual(tree('log_10(x)'), log(x))
  70. self.assertEqual(tree('log_g(x)'), log(x, g))
  71. self.assertEqual(tree('log_g x'), log(x, g))
  72. def test_special_tokens(self):
  73. for token in SPECIAL_TOKENS:
  74. self.assertEqual(tree(token), Leaf(token))
  75. a, t = Leaf('a'), Leaf(token)
  76. self.assertEqual(tree('a' + token), a * t)
  77. # FIXME: self.assertEqual(tree('a' + token + 'a'), a * t * a)