-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathinterpreter.py
189 lines (167 loc) · 7.64 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
import copy
from my_parser import parser
from operator import (add, sub, mul, truediv, mod, lt, le, eq, ne, gt, ge)
from Abstact_Syntax_Tree import Variable, Application, Abstraction, BinOps, UniOps, CondBranch, Recursive
import sys
sys.setrecursionlimit(1000)
ops = {
"+": add,
"-": sub,
"*": mul,
"/": truediv,
"%": mod,
">": gt,
">=": ge,
"<": lt,
"<=": le,
"==": eq,
"!=": ne
}
def substitute(uTerm, uToSubstitute, uNewTerm):
if isinstance(uTerm, int):
return copy.deepcopy(uTerm)
elif isinstance(uTerm, Variable):
if uTerm.name == uToSubstitute.name:
return copy.deepcopy(uNewTerm)
elif isinstance(uTerm, Application):
uTerm.first = substitute(uTerm.first, uToSubstitute, uNewTerm)
uTerm.second = substitute(uTerm.second, uToSubstitute, uNewTerm)
elif isinstance(uTerm, Abstraction):
if uTerm.variable == uToSubstitute:
uTerm.variable = substitute(uTerm.variable, uToSubstitute, uNewTerm)
uTerm.body = substitute(uTerm.body, uToSubstitute, uNewTerm)
elif isinstance(uTerm, UniOps):
uTerm.first = substitute(uTerm.first, uToSubstitute, uNewTerm)
elif isinstance(uTerm, BinOps):
uTerm.first = substitute(uTerm.first, uToSubstitute, uNewTerm)
uTerm.second = substitute(uTerm.second, uToSubstitute, uNewTerm)
elif isinstance(uTerm, CondBranch):
uTerm.cond = substitute(uTerm.cond, uToSubstitute, uNewTerm)
uTerm.expr1 = substitute(uTerm.expr1, uToSubstitute, uNewTerm)
uTerm.expr2 = substitute(uTerm.expr2, uToSubstitute, uNewTerm)
return copy.deepcopy(uTerm)
def substitute_rec(uTerm, uToSubstitute, uNewTerm):
if isinstance(uTerm,Abstraction):
return copy.deepcopy(uTerm)
elif isinstance(uTerm, int):
return copy.deepcopy(uTerm)
elif isinstance(uTerm, Variable):
if uTerm.name == uToSubstitute.name:
return copy.deepcopy(uNewTerm)
elif isinstance(uTerm, Application):
uTerm.first = substitute_rec(uTerm.first, uToSubstitute, uNewTerm)
uTerm.second = substitute_rec(uTerm.second, uToSubstitute, uNewTerm)
elif isinstance(uTerm, UniOps):
uTerm.first = substitute_rec(uTerm.first, uToSubstitute, uNewTerm)
elif isinstance(uTerm, BinOps):
uTerm.first = substitute_rec(uTerm.first, uToSubstitute, uNewTerm)
uTerm.second = substitute_rec(uTerm.second, uToSubstitute, uNewTerm)
elif isinstance(uTerm, CondBranch):
uTerm.cond = substitute_rec(uTerm.cond, uToSubstitute, uNewTerm)
uTerm.expr1 = substitute_rec(uTerm.expr1, uToSubstitute, uNewTerm)
uTerm.expr2 = substitute_rec(uTerm.expr2, uToSubstitute, uNewTerm)
return copy.deepcopy(uTerm)
def recur_reduction(obj, y, Ast):
if isinstance(obj, int):
return obj
elif isinstance(obj, Variable):
return obj if obj.name != y.name else copy.deepcopy(Ast)
elif isinstance(obj, CondBranch):
obj.cond = recur_reduction(obj.cond, y, Ast)
if isinstance(obj.cond, int) or isinstance(obj.cond, bool):
return recur_reduction(obj.expr1, y, Ast) if obj.cond else recur_reduction(obj.expr2, y, Ast)
return obj
elif isinstance(obj, UniOps):
obj.first = recur_reduction(obj.first, y, Ast)
return interpret(obj)
elif isinstance(obj, BinOps):
obj.first = recur_reduction(obj.first, y, Ast)
obj.second = recur_reduction(obj.second, y, Ast)
return interpret(obj)
elif isinstance(obj, Abstraction):
obj.body = recur_reduction(obj.body, y, Ast)
return obj
elif isinstance(obj, Application):
obj = beta_reduction_rec(obj)
if isinstance(obj, Application):
obj.first = recur_reduction(obj.first, y, Ast)
obj.second = recur_reduction(obj.second, y, Ast)
return recur_reduction(obj, y, Ast)
def beta_reduction_rec(obj):
if isinstance(obj.first, Variable) or isinstance(obj.first, int):
second = interpret(obj.second)
return Application(obj.first, second)
elif isinstance(obj.first, Abstraction):
second = interpret(obj.second)
t = substitute_rec(obj.first.body, obj.first.variable, second)
return interpret(t)
elif isinstance(obj.first, BinOps) or isinstance(obj.first, UniOps) or isinstance(obj.first, CondBranch):
obj.first = interpret(obj.first)
obj.second = interpret(obj.second)
return interpret(copy.deepcopy(obj))
else:
# left most
obj.first = interpret(obj.first)
obj.second = interpret(obj.second)
return beta_reduction(copy.deepcopy(obj))
def beta_reduction(obj):
if isinstance(obj.first, Variable) or isinstance(obj.first, int):
second = interpret(obj.second)
return Application(obj.first, second)
elif isinstance(obj.first, Abstraction):
second = interpret(obj.second)
t = substitute(obj.first.body, obj.first.variable, second)
return interpret(t)
elif isinstance(obj.first, Recursive):
Abs = copy.deepcopy(obj.first.lamb)
reduced_abs = interpret(obj.first)
second = interpret(obj.second)
t = substitute_rec(reduced_abs.body, reduced_abs.variable, second)
#print(t)
return recur_reduction(t, obj.first.var1, Abs)
elif isinstance(obj.first, BinOps) or isinstance(obj.first, UniOps) or isinstance(obj.first, CondBranch):
obj.first = interpret(obj.first)
obj.second = interpret(obj.second)
return interpret(copy.deepcopy(obj))
else:
# left most
obj.first = interpret(obj.first)
return beta_reduction(copy.deepcopy(obj))
def interpret(obj):
if isinstance(obj, Variable) or isinstance(obj, Abstraction) or isinstance(obj, int):
return obj
elif isinstance(obj, Recursive):
obj.body = substitute(obj.body, obj.var1, obj)
Abs = Abstraction(obj.var2, obj.body)
return Abs
elif isinstance(obj, BinOps):
obj.first, obj.second = interpret(obj.first), interpret(obj.second)
if isinstance(obj.first, int) and isinstance(obj.second, int):
return int(ops[obj.ops](obj.first, obj.second))
elif obj.ops=='*' and ((isinstance(obj.second, int) and obj.second == 0) or (isinstance(obj.first, int) and obj.first == 0)):
return 0
elif isinstance(obj.first, int):
return BinOps(obj.second, obj.first, obj.ops)
elif isinstance(obj.second, int) and isinstance(obj.first, BinOps) and isinstance(obj.first.second, int):
if obj.first.ops == '+':
second = int(ops[obj.ops](obj.first.second, obj.second))
return BinOps(obj.first.first, second, '+') if second > 0 else BinOps(obj.first.first, -second, '-')
elif obj.first.ops == '-':
second = int(ops[obj.ops](obj.first.second, -obj.second))
return BinOps(obj.first.first, second, '-') if second > 0 else BinOps(obj.first.first, -second, '+')
elif obj.first.ops == '*':
second = int(ops[obj.ops](obj.first.second, obj.second))
return BinOps(obj.first.first, second, '*') if second != 0 else 0
return obj
elif isinstance(obj, UniOps):
obj.first = interpret(obj.first)
if isinstance(obj.first, int):
return -obj.first if obj.ops == "-" else obj.first
return obj
elif isinstance(obj, CondBranch):
obj.cond = interpret(obj.cond)
if isinstance(obj.cond, bool) or isinstance(obj.cond, int):
return interpret(obj.expr1) if obj.cond else interpret(obj.expr2)
return obj
elif isinstance(obj, Application):
return beta_reduction(obj)