-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinterp_Carray.py
37 lines (35 loc) · 1.17 KB
/
interp_Carray.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
from ast import *
from interp_Ctup import InterpCtup
from utils import *
class InterpCarray(InterpCtup):
def interp_exp(self, e, env):
match e:
case ast.List(es, Load()):
return [self.interp_exp(e, env) for e in es]
case BinOp(left, Mult(), right):
l = self.interp_exp(left, env)
r = self.interp_exp(right, env)
return l * r
case AllocateArray(length, typ):
array = [None] * length
return array
case Call(Name('array_len'), [tup]):
t = self.interp_exp(tup, env)
return len(t)
case Call(Name('array_load'), [tup, index]):
t = self.interp_exp(tup, env)
n = self.interp_exp(index, env)
if n < len(t):
return t[n]
else:
raise TrappedError('array index out of bounds')
case Call(Name('array_store'), [tup, index, value]):
tup = self.interp_exp(tup, env)
index = self.interp_exp(index, env)
if index < len(tup):
tup[index] = self.interp_exp(value, env)
else:
raise TrappedError('array index out of bounds')
return None
case _:
return super().interp_exp(e, env)