-
Notifications
You must be signed in to change notification settings - Fork 0
/
interpreter.py
339 lines (302 loc) · 13.1 KB
/
interpreter.py
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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
# This file is part of Edia.
#
# Ediap is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 2 of the License, or
# (at your option) any later version.
#
# Edia is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with Edia. If not, see <http://www.gnu.org/licenses/>
# Copyright 2014 Matthieu Gautier [email protected]
from program import Step
from language import objects
class InvalidIndent(Exception):
pass
class ToManyInstruction(Exception):
pass
class NamespaceDict:
def __init__(self, builtins, constants, nodes, parent = None):
self.builtins = builtins
self.constants = constants
self.nodes = nodes
self.parent = parent
self.dict = {}
def __getitem__(self, name):
try:
return self.dict[name]
except KeyError:
if self.parent is None:
return objects.Variable(self.constants[name])
return self.parent[name]
def __setitem__(self, name, value):
if self.parent and name in self.parent:
self.parent[name] = value
self.dict[name] = value
def __contains__(self, name):
if name in self.dict:
return True
if self.parent:
return name in self.parent
else:
return name in self.constants
def keys(self):
for key in sorted(self.dict.keys()):
yield key
if self.parent:
for key in self.parent.keys():
if key not in self.dict:
yield key
def clone(self):
clone = NamespaceDict(self.builtins, self.constants, self.nodes)
if self.parent:
clone.parent = self.parent.clone()
clone.dict.update({k:v.clone() for k,v in self.dict.items()})
return clone
class State:
def __init__(self, lineno, context, namespace):
self.lineno = lineno
self.context = context
self.namespace = namespace
self.functions = {}
def clone(self, lineno):
clone = State(lineno, self.context.__class__(self.context), self.namespace.clone())
clone.functions = dict(self.functions)
return clone
def child(self):
newNamespace = NamespaceDict(self.namespace.builtins,
self.namespace.constants,
self.namespace.nodes,
self.namespace
)
child = State(self.lineno, self.context, newNamespace)
child.functions = dict(self.functions)
return child
def __str__(self):
return "<State %d\n%s\n%s\n>"%(self.lineno, self.context, self.namespace)
class Interpreter:
def __init__(self, program):
self.program = program
self.program.connect("source_changed", self.run_prog)
self.state = None
def new_state(self, lineno, state):
if not state:
newNamespace = NamespaceDict(self.program.lib.builtins,
self.program.lib.constants,
self.program.lib.nodes
)
state = State(lineno, self.program.lib.Context(), newNamespace)
else:
state = state.clone(lineno)
return state
def block_runner(self, pc):
try:
while self.program.source[pc].is_nop:
pc += 1
level = self.program.source[pc].level
while True:
if self.program.source[pc].is_nop:
pc += 1
continue
if self.program.source[pc].level < level:
break
newpc = yield pc
if newpc is not None:
pc = newpc
else:
pc += 1
except IndexError:
raise StopIteration
def pass_level(self, pc):
runner = self.block_runner(pc)
for pc in runner:
pass
#pc is the last of the block, get next
pc += 1
try:
while self.program.source[pc].is_nop:
pc += 1
except IndexError:
pass
return pc
def set_help_run_level(self, pc, step):
text = "Do this..."
runner = self.block_runner(pc)
for pc in runner:
step.add_help(self.program.source[pc].lineno, [('text', text)])
text = "... and this"
def run(self, pc, state):
runner = self.block_runner(pc)
level = None
pc = next(runner)
while True:
instruction = self.program.source[pc]
if level is None:
level = instruction.level
if instruction.level > level:
raise InvalidIndent(pc, instruction.level, level, str(instruction))
try:
pc, state = Interpreter.instruction_mapping[instruction.klass](self, instruction, pc, state)
try:
pc = runner.send(pc)
except StopIteration:
break
except KeyError as e:
if not hasattr(e, "handled"):
e.handled = True
step = Step(instruction, state)
step.add_help(instruction.lineno, [('error', "%s is not a declared variable."%e.args)])
self.program.steps.append(step)
raise
if self.program.to_many_step():
step.add_help(instruction.lineno, [('error', "To many instruction at line %d"%instruction.lineno)])
raise ToManyInstruction()
return pc, state
def do_if(self, instruction, pc, state):
step = Step(instruction, state)
self.program.steps.append(step)
result_node = instruction.parsed.test.get_node(state.namespace)
result = result_node()
if result:
step.add_help(instruction.lineno, [('text', "%s is true so ..."%instruction.parsed.test.get_help_text(state.namespace))])
self.set_help_run_level(pc+1, step)
pc, state = self.run(pc+1, state)
else:
step.add_help(instruction.lineno, [('text', "%s is false so..."%instruction.parsed.test.get_help_text(state.namespace))])
pc = self.pass_level(pc+1)
try:
step.add_help(self.program.source[pc].lineno, [('text', "... go here")])
except IndexError:
pass
return pc, state
def do_while(self, instruction, pc, state):
step = Step(instruction, state)
self.program.steps.append(step)
result_node = instruction.parsed.test.get_node(state.namespace)
result = result_node()
while result:
step.add_help(instruction.lineno, [('text', "%s is true so ..."%instruction.parsed.test.get_help_text(state.namespace))])
self.set_help_run_level(pc+1, step)
pc_, state = self.run(pc+1, state)
result_node = instruction.parsed.test.get_node(state.namespace)
result = result_node()
step = Step(instruction, state)
self.program.steps.append(step)
else:
step.add_help(instruction.lineno, [('text', "%s is false so ..."%instruction.parsed.test.get_help_text(state.namespace))])
pc = self.pass_level(pc+1)
try:
step.add_help(self.program.source[pc].lineno, [('text', "... go here")])
except IndexError:
pass
return pc, state
def do_loop(self, instruction, pc, state):
step = Step(instruction, state)
self.program.steps.append(step)
nbLoop_node = instruction.parsed.value.get_node(state.namespace)
nbLoop = nbLoop_node()
i = 0
for i in range(nbLoop):
step.add_help(instruction.lineno, [('text', "Current loop %d < %s so ..."%(i, instruction.parsed.value.get_help_text(state.namespace)))])
self.set_help_run_level(pc+1, step)
pc_, state = self.run(pc+1, state)
step = Step(instruction, state)
self.program.steps.append(step)
else:
step.add_help(instruction.lineno, [('text', "Current loop %d = %s so ..."%(i+1, instruction.parsed.value.get_help_text(state.namespace)))])
pc = self.pass_level(pc+1)
try:
step.add_help(self.program.source[pc].lineno, [('text', "... go here")])
except IndexError:
pass
return pc, state
def do_create_subprogram(self, instruction, pc, state):
state = self.new_state(instruction.lineno, state)
state.functions[instruction.parsed.name.v] = objects.FunctionDefinition(instruction.parsed.name.v, [(t.v, a.v) for t,a in instruction.parsed.args])
state.functions[instruction.parsed.name.v].pc = pc+1
step = Step(instruction, state)
self.program.steps.append(step)
step.add_help(instruction.lineno, [('text', "create the function %s"%instruction.parsed.name.v)])
pc = self.pass_level(pc+1)
return pc, state
def do_do_subprogram(self, instruction, pc, state):
step = Step(instruction, state)
self.program.steps.append(step)
step.add_help(instruction.lineno, [('text', "call the function %s..."%instruction.parsed.name.v)])
#This will be the state after the subprogram call.
state = self.new_state(instruction.lineno, state)
#This will be the state the subprogram will receive
newState = state.child()
functionDef = newState.functions[instruction.parsed.name.v]
for argTypeName, arg in zip(functionDef.args, instruction.parsed.args):
argType, argName = argTypeName
if argType == "var":
var = objects.Variable()
newState.namespace.dict[argName] = var
var.set(arg.get_node(newState.namespace))
step.add_help(self.program.source[functionDef.pc].lineno, [('text', "... so go here")])
_, state_ = self.run(functionDef.pc, newState)
#Update our final state with data return from subprogram
state.context = state_.context
state.namespace = state_.namespace.parent
step = Step(instruction, state)
step.add_help(instruction.lineno, [('text', "returning from function %s"%instruction.parsed.name.v)])
self.program.steps.append(step)
return pc+1, state
def do_create(self, instruction ,pc, state):
state = self.new_state(instruction.lineno, state)
if instruction.parsed.type_.v == "var":
var = objects.Variable()
state.namespace[instruction.parsed.name.v] = var
step = Step(instruction, state)
step.add_help(instruction.lineno, [('text', "create variable %s"%instruction.parsed.name.v)])
self.program.steps.append(step)
return pc+1, state
def do_set(self, instruction, pc, state):
state = self.new_state(instruction.lineno, state)
state.namespace[instruction.parsed.name.v].set(instruction.parsed.value.get_node(state.namespace))
step = Step(instruction, state)
step.add_help(instruction.lineno, [('text', "set variable %s to %s"%(instruction.parsed.name.v, instruction.parsed.value.get_help_text(state.namespace)))])
self.program.steps.append(step)
return pc+1, state
def do_builtin(self, instruction, pc, state):
state = self.new_state(instruction.lineno, state)
builtinClass = state.namespace.builtins[instruction.parsed.name.v]
# this is a builtin call
builtin = builtinClass(state, *instruction.parsed.arguments, **instruction.parsed.kwords)
builtin.act()
step = Step(instruction, state)
step.add_help(instruction.lineno, builtin.get_help())
self.program.steps.append(step)
return pc+1, state
def nop(self, instruction, pc, state):
return pc+1, state
def run_prog(self):
previous_activeStep = self.program.displayedStep
last = (previous_activeStep == len(self.program.steps)-1)
self.program.init_steps()
try:
_, state = self.run(0, None)
except:
previous_activeStep = len(self.program.steps)-1
raise
self.program.event("steps_changed")()
if previous_activeStep is None or last:
previous_activeStep = len(self.program.steps)-1
self.program.displayedStep = previous_activeStep
instruction_mapping = {
'If' : do_if,
'While' : do_while,
'Loop' : do_loop,
'Create_subprogram' : do_create_subprogram,
'Do_subprogram' : do_do_subprogram,
'Create' : do_create,
'Set' : do_set,
'Builtin' : do_builtin,
'Comment' : nop,
None : nop
}