1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
import assert from 'assert';
import { createLexer } from '../src/core/lexer.js';
import { createParser } from '../src/core/parser.js';
import { createInterpreter } from '../src/core/interpreter.js';
describe('Recursive Function Calls', () => {
function interpret(code) {
const lexer = createLexer(code);
const tokens = lexer.allTokens();
const parser = createParser(tokens);
const ast = parser.parse();
const interpreter = createInterpreter(ast);
interpreter.interpret(); // Execute the code
return interpreter; // Return the interpreter instance to access scope
}
it('should correctly handle simple function calls', () => {
const code = `
simpleFunc : n -> n + 1;
result : simpleFunc 5;
`;
const interpreter = interpret(code);
const result = interpreter.scope.get('result');
assert.strictEqual(result.value, 6);
});
it('should correctly handle when expressions', () => {
const code = `
checkNumber : num ->
when num is
1 then "One"
2 then "Two"
_ then "Something else";
result : checkNumber 3;
`;
const interpreter = interpret(code);
assert.strictEqual(interpreter.scope.get('result'), 'Something else');
});
it('should correctly compute factorial recursively', () => {
const code = `
factorial : n ->
when n is
0 then 1
1 then 1
_ then n * (factorial (n - 1));
result1 : factorial 0;
result2 : factorial 1;
result3 : factorial 5;
result4 : factorial 6;
`;
const interpreter = interpret(code);
const result1 = interpreter.scope.get('result1');
const result2 = interpreter.scope.get('result2');
const result3 = interpreter.scope.get('result3');
const result4 = interpreter.scope.get('result4');
assert.strictEqual(result1.value, 1);
assert.strictEqual(result2.value, 1);
assert.strictEqual(result3.value, 120); // 5! = 120
assert.strictEqual(result4.value, 720); // 6! = 720
});
it('should correctly compute Fibonacci numbers recursively', () => {
const code = `
fib : n ->
when n is
0 then 0
1 then 1
_ then (fib (n - 1)) + (fib (n - 2));
fib0 : fib 0;
fib1 : fib 1;
fib2 : fib 2;
fib3 : fib 3;
fib4 : fib 4;
fib5 : fib 5;
fib6 : fib 6;
`;
const interpreter = interpret(code);
const fib0 = interpreter.scope.get('fib0');
const fib1 = interpreter.scope.get('fib1');
const fib2 = interpreter.scope.get('fib2');
const fib3 = interpreter.scope.get('fib3');
const fib4 = interpreter.scope.get('fib4');
const fib5 = interpreter.scope.get('fib5');
const fib6 = interpreter.scope.get('fib6');
assert.strictEqual(fib0.value, 0);
assert.strictEqual(fib1.value, 1);
assert.strictEqual(fib2.value, 1);
assert.strictEqual(fib3.value, 2);
assert.strictEqual(fib4.value, 3);
assert.strictEqual(fib5.value, 5);
assert.strictEqual(fib6.value, 8);
});
it('should correctly compute sum of digits recursively', () => {
const code = `
sumDigits : n ->
when n is
0 then 0
_ then (n % 10) + (sumDigits ((n - (n % 10)) / 10));
result1 : sumDigits 123;
result2 : sumDigits 456;
result3 : sumDigits 999;
`;
const interpreter = interpret(code);
const result1 = interpreter.scope.get('result1');
const result2 = interpreter.scope.get('result2');
const result3 = interpreter.scope.get('result3');
assert.strictEqual(result1.value, 6);
assert.strictEqual(result2.value, 15);
assert.strictEqual(result3.value, 27);
});
it('should correctly compute power recursively', () => {
const code = `
power : base exp ->
when exp is
0 then 1
1 then base
_ then base * (power base (exp - 1));
result1 : power 2 0;
result2 : power 2 1;
result3 : power 2 3;
result4 : power 3 4;
result5 : power 5 2;
`;
const interpreter = interpret(code);
const result1 = interpreter.scope.get('result1');
const result2 = interpreter.scope.get('result2');
const result3 = interpreter.scope.get('result3');
const result4 = interpreter.scope.get('result4');
const result5 = interpreter.scope.get('result5');
assert.strictEqual(result1.value, 1);
assert.strictEqual(result2.value, 2);
assert.strictEqual(result3.value, 8); // 2^3 = 8
assert.strictEqual(result4.value, 81); // 3^4 = 81
assert.strictEqual(result5.value, 25); // 5^2 = 25
});
it('should correctly compute greatest common divisor recursively', () => {
const code = `
gcd : a b ->
when b is
0 then a
_ then gcd b (a % b);
result1 : gcd 48 18;
result2 : gcd 54 24;
result3 : gcd 7 13;
result4 : gcd 100 25;
`;
const interpreter = interpret(code);
const result1 = interpreter.scope.get('result1');
const result2 = interpreter.scope.get('result2');
const result3 = interpreter.scope.get('result3');
const result4 = interpreter.scope.get('result4');
assert.strictEqual(result1.value, 6);
assert.strictEqual(result2.value, 6);
assert.strictEqual(result3.value, 1);
assert.strictEqual(result4.value, 25);
});
it('should handle mutual recursion correctly', () => {
const code = `
isEven : n ->
when n is
0 then true
1 then false
_ then isOdd (n - 1);
isOdd : n ->
when n is
0 then false
1 then true
_ then isEven (n - 1);
result1 : isEven 0;
result2 : isEven 1;
result3 : isEven 2;
result4 : isEven 3;
result5 : isOdd 0;
result6 : isOdd 1;
result7 : isOdd 2;
result8 : isOdd 3;
`;
const interpreter = interpret(code);
assert.strictEqual(interpreter.scope.get('result1'), true);
assert.strictEqual(interpreter.scope.get('result2'), false);
assert.strictEqual(interpreter.scope.get('result3'), true);
assert.strictEqual(interpreter.scope.get('result4'), false);
assert.strictEqual(interpreter.scope.get('result5'), false);
assert.strictEqual(interpreter.scope.get('result6'), true);
assert.strictEqual(interpreter.scope.get('result7'), false);
assert.strictEqual(interpreter.scope.get('result8'), true);
});
it('should handle deep recursion without stack overflow', () => {
const code = `
countDown : n ->
when n is
0 then 0
_ then 1 + (countDown (n - 1));
result : countDown 100;
`;
const interpreter = interpret(code);
const result = interpreter.scope.get('result');
assert.strictEqual(result.value, 100);
});
});
|