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
|
from __future__ import annotations
import functools
import operator
import weakref
from collections import defaultdict
from copy import copy
from .exceptions import ParseException
from .infos import LineIndexInfo
from .util import asjson, join_lists
DEFAULT_SEPARATOR = '.'
def join_symtables(tables):
def join_namespaces(base, target):
base = copy(base)
for symbol in target.symbols:
name = symbol.name
if name not in base or base.duplicates:
base.insert(symbol)
else:
join_namespaces(base[name], symbol)
return base
if not tables:
return {}
result = copy(tables[0])
for table in tables[1:]:
result = join_namespaces(table, result)
return result
class SymbolTableError(ParseException):
pass
class Namespace:
def __init__(
self, ignorecase=False, duplicates=False, separator=DEFAULT_SEPARATOR,
):
super().__init__()
self.ignorecase = ignorecase
self.duplicates = duplicates
self.separator = separator
self._entries = defaultdict(list)
@property
def entries(self):
return self._entries
@property
def symbols(self):
return join_lists(self._entries.values())
@property
def names(self):
return list(self._entries.keys())
def all_names(self):
result = []
for name, symbols in self.entries.items():
result.append(name)
for symbol in symbols:
result.extend(symbol.all_names())
return result
def __contains__(self, name):
if self.ignorecase:
name = name.upper()
return name in self.entries
def __getitem__(self, name):
if self.ignorecase:
name = name.upper()
if self.duplicates:
return self.entries.get(name)
elif name in self.entries:
return self.entries[name][0]
else:
raise KeyError(name)
def get(self, name, default=None):
return self.entries.get(name, default)
def insert(self, symbol):
assert isinstance(
symbol.name, str,
), f'"{symbol.name!s}" is not a valid symbol name'
name = symbol.name
if self.ignorecase:
name = name.upper()
if name in self._entries and not self.duplicates:
raise SymbolTableError(
f'Symbol "{symbol.name!s}" already in namespace',
)
self._entries[name].append(symbol)
def lookup_all(self, qualname, drill=True):
if self.ignorecase:
qualname = qualname.upper()
return self._lookup_drilldown(
qualname.split(self.separator), drill=drill,
)
def lookup(self, qualname, drill=True):
if self.ignorecase:
qualname = qualname.upper()
result = self._lookup_drilldown(
qualname.split(self.separator), drill=drill, max=1,
)
return result[0] if result else None
def _lookup_drilldown(self, namelist, drill=True, max=None):
if not namelist:
return []
result = []
for symbol in self.symbols:
found = symbol._lookup_drilldown(namelist, drill=drill, max=max)
result.extend(found)
if max and len(result) >= max:
break
return result
def resolve(self, qualname):
return self.lookup(qualname)
def filter(self, condition):
return functools.reduce(
operator.iadd,
(symbol.filter(condition) for symbol in self.symbols),
[],
)
def filter_first(self, condition):
for symbol in self.symbols:
result = symbol.filter_first(condition)
if result:
return result
return None
def all(self):
return self.filter(lambda: True)
def asjson(self):
return asjson(self)
def __repr__(self):
return f'{type(self).__name__}[]'
def __json__(self, seen=None):
return {
name: asjson(symbols, seen=seen)
for name, symbols in self.entries.items()
}
class SymbolTable(Namespace):
def add_reference(self, qualname, from_node):
symbol = self.lookup(qualname)
symbol.add_reference(qualname, from_node)
class Symbol(Namespace):
def __init__(self, name, node, ignorecase=False, duplicates=False):
super().__init__(ignorecase=ignorecase, duplicates=duplicates)
if not isinstance(name, str):
raise TypeError(f'"{name}" is not a valid symbol name')
self.name = name
self._node = node
self._parent = None
self._references = []
@property
def node(self):
return self._node
@property
def line(self):
return self.node.line
@property
def endline(self):
return self.node.endline
@property
def parent(self):
if self._parent is not None:
return self._parent()
return None
@property
def references(self):
return self._references
def insert(self, symbol):
super().insert(symbol)
symbol._parent = weakref.ref(self)
def qualpath(self):
if self.parent:
return [*self.parent.qualpath(), self.name]
return [self.name]
def qualname(self, sep=DEFAULT_SEPARATOR):
return sep.join(self.qualpath())
def _lookup_drilldown(self, namelist, drill=True, max=None):
if self.ignorecase and [self.name.upper()] == namelist:
return [self]
elif not self.ignorecase and [self.name] == namelist:
return [self]
elif self.name == namelist[0]:
return super()._lookup_drilldown(
namelist[1:], drill=drill, max=max,
)
elif drill:
return super()._lookup_drilldown(namelist, drill=drill, max=max)
else:
return []
def resolve(self, qualname):
return (
self.lookup(qualname) or
(self.parent and self.parent.resolve(qualname))
)
def filter(self, condition):
this_case = [self] if condition(self) else []
return this_case + super().filter(condition)
def filter_first(self, condition):
if condition(self):
return self
return super().filter(condition)
def add_reference(self, qualname, node):
# reference = SymbolReference(self, qualname, node)
reference = node
if reference not in self.references:
self._references.append(reference)
def line_index(self, include_entries=False, include_references=False):
result = set(self.node.line_index())
if include_references:
result.update(self.reference_line_index())
if include_entries:
for s in self.symbols:
index = s.line_index(
include_entries=include_entries,
include_references=include_references,
)
result.update(index)
assert isinstance(result, set)
assert all(isinstance(i, LineIndexInfo) for i in result)
return sorted(result)
def reference_line_index(self):
result = set()
for r in self.references:
result.update(r.line_index())
assert isinstance(result, set)
assert all(isinstance(i, LineIndexInfo) for i in result)
return result
def __repr__(self):
return f'{self.name}[]'
def __json__(self, seen=None):
return dict(
('node', type(self.node).__name__),
('entries', super().__json__(seen=seen)),
('references', asjson(self._references, seen=seen)),
)
def __getstate__(self):
state = self.__dict__.copy()
state.update(_parent=self.parent)
return state
def __setstate__(self, state):
self.__dict__.update(state)
if self._parent is not None:
self._parent = weakref.ref(self._parent)
class BasedSymbol(Namespace):
def __init__(self, name, node, duplicates=False):
super().__init__(duplicates=duplicates)
self._bases = []
@property
def bases(self):
return self._bases
def add_base(self, base):
assert isinstance(base, Symbol)
self._bases.append(base)
def _lookup_drilldown(self, namelist, drill=True, max=max):
result = super()._lookup_drilldown(namelist, drill=drill, max=max)
if result:
return result
for base in self.bases:
result = base._lookup_drilldown(namelist, drill=drill, max=max)
if result:
return result
return result
def __json__(self, seen=None):
result = super().__json__(seen=seen)
result['bases'] = asjson([b.qualname() for b in self.bases], seen=seen)
return result
|
