-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathScheme_Interpreter.py
725 lines (612 loc) · 21.4 KB
/
Scheme_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
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
# -*- coding: utf-8 -*-
import sys
from string import letters, digits
my_dict = {}
lambda_argument = []
lambda_actual_parameter = []
lambda_inner_define = {}
lambda_check = False
class CuteType:
INT=1
ID=4
MINUS=2
PLUS=3
L_PAREN=5
R_PAREN=6
TRUE=8
FALSE=9
TIMES=10
DIV=11
LT=12
GT=13
EQ=14
APOSTROPHE=15
DEFINE=20
LAMBDA=21
COND=22
QUOTE=23
NOT=24
CAR=25
CDR=26
CONS=27
ATOM_Q=28
NULL_Q=29
EQ_Q=30
KEYWORD_LIST=('define', 'lambda', 'cond','quote', 'not', 'car', 'cdr', 'cons', 'atom?', 'null?', 'eq?' )
BINARYOP_LIST=(DIV, TIMES, MINUS, PLUS, LT, GT, EQ)
BOOLEAN_LIST=(TRUE, FALSE)
def check_keyword(token):
"""
:type token:str
:param token:
:return:
"""
if token.lower() in CuteType.KEYWORD_LIST:
return True
return False
def is_type_keyword(token):
if 20 <= token.type <= 30 :
return True
return False
def _get_keyword_type(token):
return {
'define':CuteType.DEFINE,
'lambda':CuteType.LAMBDA,
'cond':CuteType.COND,
'quote':CuteType.QUOTE,
'not':CuteType.NOT,
'car':CuteType.CAR,
'cdr':CuteType.CDR,
'cons':CuteType.CONS,
'atom?':CuteType.ATOM_Q,
'null?':CuteType.NULL_Q,
'eq?':CuteType.EQ_Q
}[token]
CUTETYPE_NAMES=dict((eval(attr, globals(), CuteType.__dict__), attr) for attr in dir(CuteType()) if not callable(attr) and not attr.startswith("__"))
def is_type_binaryOp(token):
"""
:type token:Token
:param token:
:return:
"""
if token.type in CuteType.BINARYOP_LIST:
return True
return False
def is_type_boolean(token):
"""
:type token:Token
:param token:
:return:
"""
if token.type in CuteType.BOOLEAN_LIST:
return True
return False
class Token(object):
def __init__(self, type, lexeme):
"""
:type type:CuteType
:type lexeme: str
:param type:
:param lexeme:
:return:
"""
self.type=type
self.lexeme=lexeme
#print type
def __str__(self):
#return self.lexeme
if self is None: return None
return "[" + CUTETYPE_NAMES[self.type] + ": " + self.lexeme + "]"
def __repr__(self):
return str(self)
class CuteScanner(object):
"""
:type token_iter:iter
"""
transM={}
def __init__(self, source):
"""
:type source:str
:param source:
:return:
"""
source=source.strip()
token_list=source.split(" ")
self.token_iter=iter(token_list)
def get_state(self, old_state, trans_char):
if trans_char in digits+letters+'?':
return {
0: {k: 1 if k in digits else 4 for k in digits+letters},
1: {k: 1 for k in digits},
2: {k: 1 for k in digits},
3: {k: 1 for k in digits},
4: {k: 4 if k is not '?' else 16 for k in digits+letters+'?'},
7: {k: 8 if k is 'T' else 9 for k in ['T', 'F']}
}[old_state][trans_char]
if old_state is 0:
return {
'(': 5, ')': 6,
'+': 3, '-': 2,
'*': 10, '/': 11,
'<': 12, '=': 14,
'>': 13, "'": 15,
'#': 7
}[trans_char]
def next_token(self):
state_old=0
temp_token=next(self.token_iter, None)
""":type :str"""
if temp_token is None : return None
for temp_char in temp_token:
state_old=self.get_state(state_old, temp_char)
if check_keyword(temp_token):
result = Token(_get_keyword_type(temp_token), temp_token)
else:
result=Token(state_old, temp_token)
return result
def tokenize(self):
tokens=[]
while True:
t=self.next_token()
if t is None :break
tokens.append(t)
return tokens
class TokenType():
INT=1
ID=4
MINUS=2
PLUS=3
LIST=5
TRUE=8
FALSE=9
TIMES=10
DIV=11
LT=12
GT=13
EQ=14
APOSTROPHE=15
DEFINE=20
LAMBDA=21
COND=22
QUOTE=23
NOT=24
CAR=25
CDR=26
CONS=27
ATOM_Q=28
NULL_Q=29
EQ_Q=30
NODETYPE_NAMES = dict((eval(attr, globals(), TokenType.__dict__), attr) for attr in dir(TokenType()) if not callable(attr) and not attr.startswith("__"))
class Node (object):
def __init__(self, type, value=None):
self.next = None
self.value = value
self.type = type
def set_last_next(self, next_node):
if self.next is not None:
self.next.set_last_next(next_node)
else : self.next=next_node
def get_tail(self):
def get_list_tail(node):
"""
:type node: Node
"""
if node.type is TokenType.LIST:
return get_list_tail(node.value)
else:
if node.next is None:
return node
return get_list_tail(node.next)
if self.type is TokenType.LIST:
return get_list_tail(self)
return self
def __str__(self):
result = ""
if self.type is TokenType.ID:
result = "["+self.value+"]"
elif self.type is TokenType.INT:
result = str(self.value)
elif self.type is TokenType.LIST:
if self.value is not None and self.value.type is TokenType.QUOTE:
result = str(self.value)
else:
result = "("+str(self.value)+")"
elif self.type is TokenType.QUOTE:
result = "'"
else:
result = "["+NODETYPE_NAMES[self.type]+"]"
if self.next is None:
return result
else: return result+" "+str(self.next)
class BasicPaser(object):
def __init__(self, token_list):
"""
:type token_list:list
:param token_list:
:return:
"""
self.token_iter=iter(token_list)
def _get_next_token(self):
"""
:rtype: Token
:return:
"""
next_token=next(self.token_iter, None)
if next_token is None: return None
return next_token
def parse_expr(self):
"""
:rtype : Node
:return:
"""
token =self._get_next_token()
""":type :Token"""
if token==None: return None
result = self._create_node(token)
return result
def _create_node(self, token):
if token is None: return None
if token.type is CuteType.INT: return Node(TokenType.INT, token.lexeme)
elif token.type is CuteType.ID: return Node(TokenType.ID, token.lexeme)
elif token.type is CuteType.L_PAREN: return Node(TokenType.LIST, self._parse_expr_list())
elif token.type is CuteType.R_PAREN: return None
elif token.type is CuteType.APOSTROPHE:
q_node = Node(TokenType.QUOTE)
q_node.next=self.parse_expr()
new_list_node = Node(TokenType.LIST, q_node)
return new_list_node
elif token.type is CuteType.QUOTE:
q_node = Node(TokenType.QUOTE)
return q_node
elif is_type_binaryOp(token) or \
is_type_keyword(token) or \
is_type_boolean(token):
return Node(token.type)
else:
return None
def _parse_expr_list(self):
head = self.parse_expr()
""":type :Node"""
if head is not None:
head.next = self._parse_expr_list()
return head
class CuteInterpreter(object):
TRUE_NODE = Node(TokenType.TRUE)
FALSE_NODE = Node(TokenType.FALSE)
#lambda_check = False
def lookupTable(self, id):
if id in my_dict:
return my_dict[id]
else:
return None
def run_arith(self, arith_node):
rhs1 = arith_node.next
rhs2 = rhs1.next if rhs1.next is not None else None
left = self.run_expr(rhs1)
right = self.run_expr(rhs2)
result = Node(TokenType.INT)
if arith_node.type is TokenType.PLUS:
result.value = int(left.value) + int(right.value)
elif arith_node.type is TokenType.MINUS:
result.value = int(left.value) - int(right.value)
elif arith_node.type is TokenType.TIMES:
result.value = int(left.value) * int(right.value)
elif arith_node.type is TokenType.DIV:
result.value = int(left.value) / int(right.value)
return result
def run_func(self, func_node):
rhs1 = func_node.next
rhs2 = rhs1.next if rhs1.next is not None else None
def create_quote_node(node, list_flag = False):
q_node = Node(TokenType.QUOTE)
if list_flag:
inner_l_node = Node(TokenType.LIST, node)
q_node.next = inner_l_node
else:
q_node.next = node
l_node = Node(TokenType.LIST, q_node)
return l_node
def is_quote_list(node):
if node.type is TokenType.LIST:
if node.value.type is TokenType.QUOTE:
if node.value.next.type is TokenType.LIST:
return True
return False
def pop_node_from_quote_list(node):
if not is_quote_list(node):
return node
return node.value.next.value
def insertTable(id,value) :
my_dict[id] = value
def list_is_null(node):
node = pop_node_from_quote_list(node)
if node is None:
return True
return False
if func_node.type is TokenType.CAR:
rhs1 = self.run_expr(rhs1)
if not is_quote_list(rhs1):
print ("car error!")
result = pop_node_from_quote_list(rhs1) #value
if result.type is not TokenType.LIST:
return result
return create_quote_node(result)
elif func_node.type is TokenType.CDR:
rhs1 = self.run_expr(rhs1)
if not is_quote_list(rhs1):
print("cdr error!")
result = pop_node_from_quote_list(rhs1)
if result.next is not None :
q_node = Node(TokenType.LIST, result.next)
else : q_node = Node(TokenType.LIST)
return create_quote_node(q_node)
elif func_node.type is TokenType.CONS:
expr_rhs1 = self.run_expr(rhs1)
expr_rhs2 = self.run_expr(rhs2)
if is_quote_list(expr_rhs1):
head = Node(TokenType.LIST, pop_node_from_quote_list(expr_rhs1))
else:
head = pop_node_from_quote_list(expr_rhs1)
head.next = pop_node_from_quote_list(expr_rhs2)
q_node = Node(TokenType.LIST, head)
return create_quote_node(q_node)
elif func_node.type is TokenType.ATOM_Q:
if list_is_null(rhs1): return self.TRUE_NODE
if rhs1.type is not TokenType.LIST: return self.TRUE_NODE
if rhs1.type is TokenType.LIST:
if rhs1.value.type is TokenType.QUOTE:
if rhs1.value.next is not TokenType.LIST:
return self.TRUE_NODE
return self.FALSE_NODE
elif func_node.type is TokenType.EQ_Q:
if rhs1.type is TokenType.INT:
if rhs1.value is rhs2.value:
return self.TRUE_NODE
return self.FALSE_NODE
elif func_node.type is TokenType.NULL_Q:
if list_is_null(self.run_expr(rhs1)):
return self.TRUE_NODE
return self.FALSE_NODE
elif func_node.type is TokenType.GT:
expr_rhs1 = self.run_expr(rhs1)
expr_rhs2 = self.run_expr(rhs2)
if int(expr_rhs1.value) > int(expr_rhs2.value):
return self.TRUE_NODE
else:
return self.FALSE_NODE
elif func_node.type is TokenType.LT:
expr_rhs1 = self.run_expr(rhs1)
expr_rhs2 = self.run_expr(rhs2)
if int(expr_rhs1.value) < int(expr_rhs2.value):
return self.TRUE_NODE
else:
return self.FALSE_NODE
elif func_node.type is TokenType.EQ:
expr_rhs1 = self.run_expr(rhs1)
expr_rhs2 = self.run_expr(rhs2)
if int(expr_rhs1.value) == int(expr_rhs2.value):
return self.TRUE_NODE
else:
return self.FALSE_NODE
elif func_node.type is TokenType.NOT:
expr_rhs1 = self.run_expr(rhs1)
if str(expr_rhs1) == str(self.FALSE_NODE):
return self.TRUE_NODE
elif str(expr_rhs1) == str(self.TRUE_NODE):
return self.FALSE_NODE
elif func_node.type is TokenType.COND:
while rhs1 is not None:
condition = rhs1.value
result = condition.next
if self.run_expr(condition).type is TokenType.TRUE:
return self.run_expr(result)
else:
rhs1 = rhs1.next
return None
elif func_node.type is TokenType.DEFINE :
global lambda_check, lambda_inner_define
expr_rhs2 = self.run_expr(rhs2)
# if lambda_check -> add local function
if lambda_check :
lambda_inner_define[rhs1.value] = expr_rhs2
else :
insertTable(rhs1.value,expr_rhs2)
elif func_node.type is TokenType.LAMBDA :
#global lambda_check,lambda_argument,lambda_inner_define
#lambda_check = True
#if len(lambda_argument) is 0 :
lambda_check = True
lambda_argument.append(rhs1)
while 1:
expr_rhs2 = self.run_expr(rhs2)
if rhs2.next is None:
break
else:
rhs2 = rhs2.next
return expr_rhs2
else:
return None
def search(self, head_node, var_node, varName) :
if head_node is not None :
if head_node.value == varName :
return var_node
else:
return self.search(head_node.next, var_node.next, varName)
else:
return None
def run_expr(self, root_node):
"""
:type root_node: Node
"""
if root_node is None:
return None
if root_node.type is TokenType.ID:
global lambda_check
# temp = self.lookupTable(root_node.value)
# if temp is not None :
# return temp
if lambda_check is True :
check_node_variable = self.lookupTable(root_node.value)
i = 0
while True :
# print "lambda_argument(%d) : " % i,lambda_argument[i]
# print "lambda_actual_parameter(%d) : " % i,lambda_actual_parameter[i]
flag = self.search(lambda_argument[i].value, lambda_actual_parameter[i], root_node.value)
if check_node_variable is not None :
return check_node_variable
elif flag is not None :
return flag
else :
i += 1
else :
dict_value = self.lookupTable(root_node.value)
if dict_value is None:
sys.stdout.write(root_node.value + ": undefined;\n cannot reference undefined identifier")
return None
else:
if dict_value.type is TokenType.INT :
return dict_value
elif dict_value.value.type is TokenType.LAMBDA :
sys.stdout.write( "<#procedure:"+root_node.value+">" )
return
elif root_node.type is TokenType.INT:
return root_node
elif root_node.type is TokenType.TRUE:
return root_node
elif root_node.type is TokenType.FALSE:
return root_node
elif root_node.type is TokenType.LIST:
return self.run_list(root_node)
else:
print "Run Expr Error"
return None
def run_list(self, l_node):
"""
:type l_node:Node
"""
global lambda_actual_parameter, lambda_check, lambda_inner_define
op_code = l_node.value
if op_code is None:
return l_node
if op_code.type in \
[TokenType.CAR, TokenType.CDR, TokenType.CONS, TokenType.ATOM_Q,\
TokenType.EQ_Q, TokenType.NULL_Q, TokenType.NOT, \
TokenType.GT, TokenType.LT, TokenType.EQ, TokenType.COND, TokenType.DEFINE]:
return self.run_func(op_code)
if op_code.type in \
[TokenType.PLUS, TokenType.MINUS, TokenType.TIMES, \
TokenType.DIV]:
return self.run_arith(op_code)
if op_code.type is TokenType.QUOTE or op_code.type is TokenType.LAMBDA:
return l_node
if op_code.type is TokenType.LIST :
lambda_actual_parameter.append(op_code.next)
return self.run_func(op_code.value)
#first local check
local_check = lambda_inner_define.get(op_code.value)
if local_check :
getFunction = local_check
else:
getFunction = self.lookupTable(op_code.value)
# Does the function exist on table?
if getFunction is not None:
# If nothing on table
if len(lambda_actual_parameter) is 0 :
lambda_actual_parameter.append(op_code.next)
else:
# print "before : ",op_code.next
save = self.run_expr(op_code.next)
# print "save : ",save
lambda_actual_parameter[lambda_actual_parameter.__len__()-1] =save
return self.run_func(getFunction.value)
else:
print "application: not a procedure;"
print "expected a procedure that can be applied to arguments"
print "Token Type is "+ op_code.value
return None
def print_node(node):
"""
"Get result and print after evaluation"
"Input type: List Node or atom"
:type node: Node
"""
def print_list(node):
"""
"Print value of List node."
:type node: Node
"""
def print_list_val(node):
if node.next is not None:
return print_node(node)+" "+print_list_val(node.next)
return print_node(node)
if node.type is TokenType.LIST:
if node.value.type is TokenType.QUOTE:
return print_node(node.value)
return "("+print_list_val(node.value)+")"
if node is None:
return ""
if node.type in [TokenType.ID, TokenType.INT]:
return node.value
if node.type is TokenType.TRUE:
return "#T"
if node.type is TokenType.FALSE:
return "#F"
if node.type is TokenType.PLUS:
return "+"
if node.type is TokenType.MINUS:
return "-"
if node.type is TokenType.TIMES:
return "*"
if node.type is TokenType.DIV:
return "/"
if node.type is TokenType.GT:
return ">"
if node.type is TokenType.LT:
return "<"
if node.type is TokenType.EQ:
return "="
if node.type is TokenType.LIST:
return print_list(node)
if node.type is TokenType.ATOM_Q:
return "atom?"
if node.type is TokenType.CAR:
return "car"
if node.type is TokenType.CDR:
return "cdr"
if node.type is TokenType.COND:
return "cond"
if node.type is TokenType.CONS:
return "cons"
if node.type is TokenType.LAMBDA:
return "lambda"
if node.type is TokenType.NULL_Q:
return "null?"
if node.type is TokenType.EQ_Q:
return "eq?"
if node.type is TokenType.NOT:
return "not"
if node.type is TokenType.QUOTE:
return "'"+print_node(node.next)
def Test_method(input):
global lambda_check, lambda_actual_parameter, lambda_argument, lambda_inner_define
test_cute = CuteScanner(input)
test_tokens=test_cute.tokenize()
test_basic_paser = BasicPaser(test_tokens)
node = test_basic_paser.parse_expr()
cute_inter = CuteInterpreter()
result = cute_inter.run_expr(node)
lambda_check = False
lambda_actual_parameter = []
lambda_argument = []
lambda_inner_define = {}
print print_node(result)
def run_main():
print 'Cute Interpreter'
while True:
inputString = raw_input('> ')
if inputString is None:
break
else:
sys.stdout.write('..')
Test_method(inputString)
run_main()