|
| 1 | +import itertools |
| 2 | +import unittest |
| 3 | + |
| 4 | +from herbert.error import LookupError, TypeError |
| 5 | +from herbert.interpreter import interp |
| 6 | +from herbert.parser import parse |
| 7 | + |
| 8 | + |
| 9 | +def run(program, upper_bound=None): |
| 10 | + commands = interp(parse(program)) |
| 11 | + |
| 12 | + if upper_bound: |
| 13 | + commands = itertools.islice(commands, upper_bound) |
| 14 | + |
| 15 | + return ''.join(commands) |
| 16 | + |
| 17 | + |
| 18 | +class ExamplesTestCase(unittest.TestCase): |
| 19 | + def test_example1(self): |
| 20 | + program = 'sssssrsssssrsssssrsssssr' |
| 21 | + |
| 22 | + self.assertEqual(run(program), 'sssssrsssssrsssssrsssssr') |
| 23 | + |
| 24 | + def test_example2(self): |
| 25 | + program = 'a:sssssr\naaaa' |
| 26 | + |
| 27 | + self.assertEqual(run(program), 'sssssrsssssrsssssrsssssr') |
| 28 | + |
| 29 | + def test_example3(self): |
| 30 | + program = 'a:sssssra\na' |
| 31 | + |
| 32 | + self.assertEqual(run(program, 24), 'sssssrsssssrsssssrsssssr') |
| 33 | + |
| 34 | + def test_example4(self): |
| 35 | + program = 'a(A):sssssra(A-1)\na(4)' |
| 36 | + |
| 37 | + self.assertEqual(run(program), 'sssssrsssssrsssssrsssssr') |
| 38 | + |
| 39 | + def test_example5(self): |
| 40 | + program = 'a(A,B):f(B)ra(A-1,B)\nf(A):sf(A-1)\na(4,5)' |
| 41 | + |
| 42 | + self.assertEqual(run(program), 'sssssrsssssrsssssrsssssr') |
| 43 | + |
| 44 | + def test_example6(self): |
| 45 | + program = 'a(A,B,C):f(B)Ca(A-1,B,C)\nf(A):sf(A-1)\na(4,5,r)' |
| 46 | + |
| 47 | + self.assertEqual(run(program), 'sssssrsssssrsssssrsssssr') |
| 48 | + |
| 49 | + def test_example7(self): |
| 50 | + program = 'a(A):ArAa(AA)\na(s)' |
| 51 | + |
| 52 | + self.assertEqual(run(program, 17), 'srsssrssssssrssss') |
| 53 | + |
| 54 | + def test_example8(self): |
| 55 | + program = 'a(A,B,C):f(B)Ca(A-1,B,C)\nb(A):a(4,5,r)lb(A-1)\nf(A):sf(A-1)\nb(4)' |
| 56 | + |
| 57 | + self.assertEqual( |
| 58 | + run(program, 100), |
| 59 | + 'sssssrsssssrsssssrsssssrl' |
| 60 | + 'sssssrsssssrsssssrsssssrl' |
| 61 | + 'sssssrsssssrsssssrsssssrl' |
| 62 | + 'sssssrsssssrsssssrsssssrl' |
| 63 | + ) |
| 64 | + |
| 65 | + def test_example9(self): |
| 66 | + program = 'a(A,B,C):f(B)Ca(A-1,B,C)\nb(A):a(4,A,r)b(A-1)\nf(A):sf(A-1)\nb(10)' |
| 67 | + |
| 68 | + self.assertEqual( |
| 69 | + run(program, 260), |
| 70 | + 'ssssssssssrssssssssssrssssssssssrssssssssssr' # 40 + 4 = 44 |
| 71 | + 'sssssssssrsssssssssrsssssssssrsssssssssr' # 40 |
| 72 | + 'ssssssssrssssssssrssssssssrssssssssr' # 36 |
| 73 | + 'sssssssrsssssssrsssssssrsssssssr' # 32 |
| 74 | + 'ssssssrssssssrssssssrssssssr' # 28 |
| 75 | + 'sssssrsssssrsssssrsssssr' # 24 |
| 76 | + 'ssssrssssrssssrssssr' # 20 |
| 77 | + 'sssrsssrsssrsssr' # 16 |
| 78 | + 'ssrssrssrssr' # 12 |
| 79 | + 'srsrsrsr' # 8 |
| 80 | + ) |
| 81 | + |
| 82 | + def test_example10(self): |
| 83 | + program = 'a(A,B,C):f(B)Ca(A-1,B,C)\nb(A):a(2,11-A,r)b(A-1)\nf(A):sf(A-1)\nb(10)' |
| 84 | + |
| 85 | + self.assertEqual( |
| 86 | + run(program, 130), |
| 87 | + 'srsr' # 4 |
| 88 | + 'ssrssr' # 6 |
| 89 | + 'sssrsssr' # 8 |
| 90 | + 'ssssrssssr' # 10 |
| 91 | + 'sssssrsssssr' # 12 |
| 92 | + 'ssssssrssssssr' # 14 |
| 93 | + 'sssssssrsssssssr' # 16 |
| 94 | + 'ssssssssrssssssssr' # 18 |
| 95 | + 'sssssssssrsssssssssr' # 20 |
| 96 | + 'ssssssssssrssssssssssr' # 22 |
| 97 | + ) |
| 98 | + |
| 99 | + def test_example11(self): |
| 100 | + program = 'a(A,B,C):f(B)Ca(A-1,B,C)\nf(A):sf(A-1)\na(4,5,rslsr)' |
| 101 | + |
| 102 | + self.assertEqual(run(program, 40), 'sssssrslsrsssssrslsrsssssrslsrsssssrslsr') |
| 103 | + |
| 104 | + |
| 105 | +class InfiniteRecursionTestCase(unittest.TestCase): |
| 106 | + """These test cases illustrate that some programs that should be able to run |
| 107 | + infinitely long aren't able to do so and cause the Python runtime to raise |
| 108 | + a RecursionError exception. This points to a need to improve my |
| 109 | + implementation of the interpreter. |
| 110 | +
|
| 111 | + Would tail-call optimization help? |
| 112 | +
|
| 113 | + Notice how the program in test_example3 has the same runtime effect as that |
| 114 | + of the program in test_example1 but the one in test_example1 raises a |
| 115 | + RecursionError. |
| 116 | + """ |
| 117 | + def test_example1(self): |
| 118 | + program = 'a:sa\na' |
| 119 | + |
| 120 | + with self.assertRaises(RecursionError): |
| 121 | + run(program, 10000) |
| 122 | + |
| 123 | + def test_example2(self): |
| 124 | + program = 'a(A):ArAa(AA)\na(s)' |
| 125 | + |
| 126 | + run(program, 10000) |
| 127 | + |
| 128 | + def test_example3(self): |
| 129 | + program = 'a(A):Aa(AA)\na(s)' |
| 130 | + |
| 131 | + run(program, 10000) |
| 132 | + |
| 133 | + |
| 134 | +class RuntimeErrorTestCase(unittest.TestCase): |
| 135 | + def test_missing_procedure(self): |
| 136 | + program = 'f' |
| 137 | + |
| 138 | + with self.assertRaisesRegex(LookupError, 'missing procedure: f'): |
| 139 | + run(program) |
| 140 | + |
| 141 | + def test_unbound_parameter(self): |
| 142 | + program = 'a:Aa\na' |
| 143 | + |
| 144 | + with self.assertRaisesRegex(LookupError, 'unbound parameter: A'): |
| 145 | + run(program) |
| 146 | + |
| 147 | + def test_too_few_arguments(self): |
| 148 | + program = 'a(A):Aa\na(s)' |
| 149 | + |
| 150 | + with self.assertRaisesRegex(TypeError, 'a takes 1 argument but 0 were given'): |
| 151 | + run(program) |
| 152 | + |
| 153 | + def test_too_many_arguments(self): |
| 154 | + program = 'a(A,B):ABa(A,B,B)\na(s,r)' |
| 155 | + |
| 156 | + with self.assertRaisesRegex(TypeError, 'a takes 2 arguments but 3 were given'): |
| 157 | + run(program) |
| 158 | + |
| 159 | + def test_expected_command_or_procedure_call(self): |
| 160 | + program = 'a(A):Aa(A)\na(1)' |
| 161 | + |
| 162 | + with self.assertRaisesRegex(TypeError, 'parameter A does not evaluate to a command .* or a procedure call: 1'): |
| 163 | + run(program) |
| 164 | + |
| 165 | + def test_expected_number(self): |
| 166 | + program = 'a(A):sa(A-1)\na(r)' |
| 167 | + |
| 168 | + with self.assertRaisesRegex(TypeError, 'parameter A does not evaluate to a number'): |
| 169 | + run(program) |
0 commit comments