-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathmain.js
More file actions
289 lines (273 loc) · 7.49 KB
/
Copy pathmain.js
File metadata and controls
289 lines (273 loc) · 7.49 KB
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
var DataStructures = {
stack : function() {
var elements;
this.push = function(element) {
if (typeof(elements) === 'undefined') {
elements = [];
}
elements.push(element);
}
this.pop = function() {
return elements.pop();
}
this.top = function(element) {
return elements[elements.length - 1];
}
}
}
function AstNode(type, params) {
this.type = type;
for(var key in params){ this[key] = params[key];}
return this;
}
function eval(astNode) {
var v;
switch(astNode.type) {
case 'function':
// Function only has a left branch
v = eval(astNode.left);
break;
case 'Statement':
// Only need to eval the right hand side since thats your return statement
// The left hand side is either a no op, or the line before that does not matter
eval(astNode.left);
v = eval(astNode.right);
break;
case 'array':
// Handle the right hand side of an array declaration
// Set the values to real values
var vec = [];
var members = astNode.value;
for(var i=0;i<members.length;i++) {
if(!members[i].name) {
vec.push(members[i].value);
} else {
var identifierValue = executionstack.top()[members[i].name];
if(!members[i].name in executionstack.top()) {
throw "NameError: name '"+members[i].name+"' is not defined in list declaration\n";
}
vec.push(identifierValue);
}
}
v = vec;
break;
case 'arrayindex':
// Handle rhs of a array index value retrieval
var identifierValue = executionstack.top()[astNode.name];
if(!astNode.name in executionstack.top()) {
throw "NameError: name '"+astNode.name+"' is not defined\n";
}
v = identifierValue[parseInt(eval(astNode.index))]
break;
case 'len':
// Handle len()
var identifierValue = executionstack.top()[astNode.name];
if(!astNode.name in executionstack.top()) {
throw "NameError: name '"+astNode.name+"' is not defined in list declaration\n";
}
if(!Array.isArray(identifierValue)) {
throw "TypeError: object of type '"+(typeof identifierValue)+"' has no len()";
}
v = identifierValue.length;
break;
case 'method':
// Handle list.append(expr) and list.pop(expr)
var identifierValue = executionstack.top()[astNode.name];
if(!astNode.name in executionstack.top()) {
throw "NameError: name '"+astNode.name+"' is not defined in list declaration\n";
}
if(!Array.isArray(identifierValue)) {
throw "AttributeError: '"+(typeof identifierValue)+"' object has no attribute '"+astNode.method+"'";
}
if(astNode.method == "append") {
identifierValue.push(eval(astNode.argument));
} else if(astNode.method == "pop") {
identifierValue.pop();
} else {
throw "AttributeError: '"+astNode.name+"' has no method '"+astNode.method+"'";
}
break;
case 'FunctionCall':
// Get function node and evaluate it
funcName = astNode.name;
functionNode = functions[funcName];
if(!funcName in functions) {
throw "NameError: function named '"+funcName+"' is not defined";
}
// Match given parameters to function signature in number only (no typing for piethon)
functionparams = functionNode.parameters;
callparams = astNode.parameters;
if(functionparams.length != callparams.length) {
throw "TypeError: "+funcName+"() takes exactly "+functionparams.length+" arguments ("+callparams.length+" given)";
}
// New stack with given params included to match signature
var newstackframe = {};
for(var i = 0;i<functionparams.length;i++) {
// If an identifier verify it
var callpari = callparams[i];
var funcpari = functionparams[i];
if(callpari.name) {
var identifierValue = executionstack.top()[callpari.name];
if(!callpari.name in executionstack.top()) {
throw "NameError: name '"+astNode.name+"' is not defined\n";
}
newstackframe[funcpari.name] = identifierValue
} else {
// Otherwise just set to value
newstackframe[funcpari.name] = callpari.value;
}
}
// Push new stack frame
executionstack.push(newstackframe);
// Call function
v = eval(functionNode);
// Pop, back to old stack frame
executionstack.pop();
break;
case 'if':
// If
if(eval(astNode.left)) {
v = eval(astNode.right);
}
break;
case 'ifelse':
// If-else
if(eval(astNode.left)) {
v = eval(astNode.middle);
} else {
v = eval(astNode.right);
}
break;
case 'while':
// while
while(eval(astNode.left)) {
v = eval(astNode.right);
}
break;
case 'IDENT':
// Look up value in table
var identifierValue = executionstack.top()[astNode.name];
if(!astNode.name in executionstack.top()) {
throw "NameError: name '"+astNode.name+"' is not defined\n";
}
v = identifierValue;
break;
case '=':
// Set value of identifier in table
if(astNode.left.type == 'arrayindex') {
var vec2 = executionstack.top()[astNode.left.name];
vec2[parseInt(eval(astNode.left.index))] = eval(astNode.right);
} else {
executionstack.top()[astNode.left.name] = eval(astNode.right);
}
break;
case '>':
if(eval(astNode.left) > eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case '>=':
if(eval(astNode.left) >= eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case '<':
if(eval(astNode.left) < eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case '<=':
if(eval(astNode.left) <= eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case '==':
if(eval(astNode.left) == eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case '!=':
if(eval(astNode.left) != eval(astNode.right)) {
v = true;
} else {
v = false;
}
break;
case 'no-op':
// Do nothing!
break;
case 'print':
v = eval(astNode.left);
var strPrint;
if(Array.isArray(v)) {
strPrint = '['+v.toString()+']';
} else {
strPrint = v;
}
// Print
jqconsole.Write(strPrint+'\n', 'jqconsole-output');
break;
case 'return': v = eval(astNode.left); break;
case 'NUMBER': v = astNode.value; break;
case 'STRING': v = astNode.value.replace(/\"/g,''); break;
case '+':
left = eval(astNode.left);
right = eval(astNode.right);
v = (left + right);
break;
case '-':
left = eval(astNode.left);
right = eval(astNode.right);
v = left - right;
break;
case '*':
left = eval(astNode.left);
right = eval(astNode.right);
v = (left * right);
break;
case '/':
left = eval(astNode.left);
right = eval(astNode.right);
v = (left / right);
break;
case '%':
left = eval(astNode.left);
right = eval(astNode.right);
v = (left % right);
break;
case '**':
left = eval(astNode.left);
right = eval(astNode.right);
v = Math.pow(left, right);
break;
case 'UMINUS': v = -1 * eval(astNode.left); break;
default: throw "internal error: bad node '"+astNode.type+"'";
}
return v;
}
function resetForRun() {
functions = {
// Pre-create the main function
'#main#' : new AstNode('function', {name : '#main#'})
};
}
// The whole program tree
var finalprogram;
// Function map
var functions = {
// Pre-create the main function
'#main#' : new AstNode('function', {name : '#main#'})
};
// Execution stack
var executionstack = new DataStructures.stack();
executionstack.push({});