forked from tangentstorm/PL0-Language-Tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pl0_machine.py
executable file
·269 lines (216 loc) · 6.89 KB
/
pl0_machine.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
#!/usr/bin/env python
#
# Copyright (c) 2012 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
#
import sys
OPCODES = {
'NOP': 0,
'HALT': 1,
'LOAD': 6,
'SAVE': 7,
'PUSH': 10,
'POP': 11,
'DUP': 12,
'JMP': 16,
'CALL': 17,
'RET': 18,
'JLT': 20,
'JLTE': 21,
'JE': 22,
'JNE': 23,
'JGTE': 24,
'JGT': 25,
# These instructions are more natural for stack-based machines.
'CMPLT': 30,
'CMPLTE': 31,
'CMPE': 32,
'CMPNE': 33,
'CMPGTE': 34,
'CMPGT': 35,
'MUL': 43,
'DIV': 44,
'ADD': 45,
'SUB': 46,
'PRINT': 50,
'DEBUG': 51
}
NAMES = dict((v,k) for k, v in OPCODES.iteritems())
# Set global name for each opcode
module = sys.modules[__name__]
for name, value in OPCODES.iteritems():
setattr(module, name, value)
class Machine:
def __init__(self, sequence):
self.offset = 0
self.sequence = sequence
self.stack = []
def step(self):
instruction = NAMES[self.sequence[self.offset]]
method = getattr(self, "instruction_%s" % instruction.lower())
method()
# print `self.offset` + ": Executing " + `instruction` + " stack: " + `self.stack`
return self.offset >= 0 and self.offset < len(self.sequence)
def run(self):
result = True
while result:
result = self.step()
def instruction_nop(self):
self.offset += 1
def instruction_halt(self):
self.offset = -1
# Basic absolute address load/save unit
def instruction_load(self):
self.offset += 1
address = self.sequence[self.offset]
self.stack.append(self.sequence[address])
self.offset += 1
def instruction_save(self):
self.offset += 1
address = self.sequence[self.offset]
self.sequence[address] = self.stack.pop()
self.offset += 1
# Basic stack manipulation
def instruction_push(self):
self.offset += 1
self.stack.append(self.sequence[self.offset])
self.offset += 1
def instruction_pop(self):
self.offset += 1
self.stack.pop()
def instruction_dup(self):
self.offset += 1
self.stack.append(self.stack[-1])
def instruction_jmp(self):
self.offset += 1
address = self.sequence[self.offset]
self.offset = address
def instruction_call(self):
self.offset += 1
self.stack.append(self.offset + 1)
address = self.sequence[self.offset]
self.offset = address
def instruction_ret(self):
address = self.stack.pop()
self.offset = address
# Jump based on the result of a subtraction
def instruction_jlt(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value > 0:
self.offset = address
def instruction_jlte(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value >= 0:
self.offset = address
def instruction_je(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value == 0:
self.offset = address
def instruction_jne(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value != 0:
self.offset = address
def instruction_jgte(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value <= 0:
self.offset = address
def instruction_jgt(self):
self.offset += 1
address = self.sequence[self.offset]
value = self.stack.pop()
self.offset += 1
if value < 0:
self.offset = address
# Basic comparision support
def instruction_cmplt(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a < b))
def instruction_cmplte(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a <= b))
def instruction_cmpe(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a == b))
def instruction_cmpne(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a != b))
def instruction_cmpgt(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a > b))
def instruction_cmpgte(self):
self.offset += 1
b = self.stack.pop()
a = self.stack.pop()
self.stack.append(int(a >= b))
# Basic arithmetic
def instruction_mul(self):
self.offset += 1
self.stack.append(self.stack.pop() * self.stack.pop())
def instruction_div(self):
self.offset += 1
self.stack.append(self.stack.pop() / self.stack.pop())
def instruction_add(self):
self.offset += 1
self.stack.append(self.stack.pop() + self.stack.pop())
def instruction_sub(self):
self.offset += 1
self.stack.append(self.stack.pop() - self.stack.pop())
def instruction_print(self):
self.offset += 1
print self.stack[-1]
def instruction_debug(self):
self.offset += 1
self.debug()
def debug(self):
print "-- Machine State --"
print "Sequence: " + `self.sequence`
print "Stack: " + `self.stack`
print "Offset: " + `self.offset`
if __name__ == '__main__':
buffer = sys.stdin.read()
code = eval(buffer)
machine = Machine(code)
machine.run()
machine.debug()