-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathir.py
285 lines (252 loc) · 8.48 KB
/
ir.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
import itertools
class Str:
pass
class Boolean:
pass
class Int:
pass
class Tuple:
def __init__(self, *types):
self.types = types
def __hash__(self):
return hash(('Tuple', tuple(self.types)))
def __eq__(self, other):
return \
type(other) == Tuple and \
self.types == other.types
class List:
def __init__(self, of):
self.of = of
def __hash__(self):
return hash(('List', self.of))
def __eq__(self, other):
return \
type(other) == List and \
self.of == other.of
class Dict:
def __init__(self, k, v):
self.k = k
self.v = v
def __hash__(self):
return hash(('Dict', self.k, self.v))
def __eq__(self, other):
return \
type(other) == Dict and \
self.k == other.k and \
self.v == other.v
class OrNone:
def __init__(self, ty):
self.ty = ty
def __hash__(self):
return hash(('OrNone', self.ty))
def __eq__(self, other):
return \
type(other) == OrNone and \
self.ty == other.ty
class OneOf:
def __init__(self, *args):
self.alternatives = set(args)
def __hash__(self):
return hash(('OneOf', tuple(sorted(self.alternatives))))
def __eq__(self, other):
return \
type(other) == OneOf and \
self.alternatives == other.alternatives
class Node:
def __init__(self, tag, **attributes):
self.tag = tag
self.attributes = attributes
for key, value in attributes.items():
setattr(self, key, value)
def sorted_attribute_tuple(self):
return tuple(sorted(self.attributes.items()))
def __eq__(self, other):
return \
type(other) == Node and \
self.tag == other.tag and \
self.sorted_attribute_tuple() == other.sorted_attribute_tuple()
def __repr__(self):
return "Node(%s, %s)" % (self.tag, self.attributes)
class Representation:
def __init__(self, name, types):
self.name = name
self.types = types
def check(self, ty, data):
if ty == Str:
assert isinstance(data, str)
elif ty == Boolean:
assert isinstance(data, bool)
elif ty == Int:
assert isinstance(data, int)
elif isinstance(ty, Tuple):
assert isinstance(data, tuple)
assert len(ty.types) == len(data)
for ty, value in zip(ty.types, data):
self.check(ty, value)
elif isinstance(ty, List):
assert isinstance(data, list)
for x in data:
self.check(ty.of, x)
elif isinstance(ty, Dict):
assert isinstance(data, dict)
for k, v in data.items():
self.check(ty.k, k)
self.check(ty.v, v)
elif isinstance(ty, OrNone):
if data != None:
self.check(ty.ty, data)
elif isinstance(ty, OneOf):
if data not in ty.alternatives:
raise Exception()
elif ty in self.types:
assert isinstance(data, Node), repr((ty, data))
tag = data.tag
constructors = self.types[ty]
if tag not in constructors:
raise \
Exception(
'tag %s not in %s' % (tag, ty)
)
expected_attributes = constructors[tag]
expected_keys = set(expected_attributes.keys())
actual_keys = set(data.attributes.keys())
missing = expected_keys - actual_keys
extra = actual_keys - expected_keys
if missing or extra:
raise \
Exception(
'missing %s, extra %s for %s, %s' % (
missing,
extra,
tag,
ty
)
)
for key in expected_keys:
field_ty = expected_attributes[key]
value = getattr(data, key)
self.check(field_ty, value)
else:
print(ty)
raise Exception('problem')
def transformer(self, into):
return Transformer(self, into)
class Transformer:
def __init__(self, out_of, into):
self.out_of = out_of
self.into = into
self.cases = {}
def case(self, ty):
def decorator(decorated):
self.cases[ty] = decorated
return decorated
return decorator
def default_transform(self, ty, state, value):
if type(ty) == Tuple:
output = []
for value, ty in zip(value, ty.types):
output.append(self.transform(ty, state, value))
return tuple(output)
elif type(ty) == List:
output = []
for val in value:
output.append(self.transform(ty.of, state, val))
return output
elif type(ty) == Dict:
output = {}
for key, val in value.items():
key = self.transform(ty.k, state, key)
val = self.transform(ty.v, state, val)
output[key] = val
return output
raise NotImplementedError()
elif type(ty) == OrNone:
if value == None:
return None
return self.transform(ty.ty, state, value)
elif type(ty) == OneOf:
return value
elif ty == Int:
return value
elif ty == Str:
return value
elif ty == Boolean:
return value
elif ty in self.out_of.types:
assert isinstance(value, Node)
field_types = self.out_of.types[ty][value.tag]
field_values = value.attributes
ty_keys = set(field_types.keys())
val_keys = set(field_values.keys())
missing = ty_keys - val_keys
if missing:
raise Exception('missing %s' % missing)
extra = val_keys - ty_keys
if extra:
raise Exception('extra %s' % extra)
new_attributes = {}
for key in sorted(field_types.keys()):
ty = field_types[key]
val = field_values[key]
new_attributes[key] = self.transform(ty, state, val)
return Node(value.tag, **new_attributes)
else:
print(ty)
raise NotImplementedError()
def transform(self, ty, state, value):
if ty in self.cases:
return self.cases[ty](state, value)
return self.default_transform(ty, state, value)
def pretty(value, indent, output):
space = ' ' * indent
space2 = ' ' * (indent + 2)
if type(value) == Node:
if len(value.attributes) == 0:
output.extend(['Node(', repr(value.tag), ')'])
else:
output.extend(['Node(\n'])
output.extend([space2, repr(value.tag), '\n'])
for key, value in value.attributes.items():
output.extend([space2, key, ' = '])
pretty(value, indent + 2, output)
output.extend([',\n'])
output.extend([space, ')'])
elif type(value) == list:
output.extend(['[\n'])
for val in value:
output.append(space2)
pretty(val, indent + 2, output)
output.append(',\n')
output.extend([space, ']'])
elif type(value) == tuple:
output.extend(['(\n'])
for val in value:
output.append(space2)
pretty(val, indent + 2, output)
output.append(',\n')
output.extend([space, ')'])
elif type(value) == set:
output.extend(['{\n'])
for val in value:
output.append(space2)
pretty(val, indent + 2, output)
output.append(',\n')
output.extend([space, '}'])
elif type(value) == dict:
output.extend(['{\n'])
for key, val in value.items():
output.extend([space2, repr(key), ': '])
pretty(val, indent + 2, output)
output.append(',\n')
output.extend([space, '}'])
else:
output.append(repr(value))
def pprint(value):
output = []
pretty(value, 0, output)
print(''.join(output))
def define_constructor(tag, fields):
def constructor(*args):
assert len(args) == len(fields)
return Node(tag, **dict(zip(fields, args)))
return constructor