Lines Matching refs:self
12 def __init__(self, filename, stream=None):
17 self.filename = filename
18 self.stream = stream
19 self.generator = tokenize.generate_tokens(stream.readline)
20 self.gettoken() # Initialize lookahead
21 self.dfas, self.startsymbol = self.parse()
24 self.first = {} # map from symbol name to set of tokens
25 self.addfirstsets()
27 def make_grammar(self):
29 names = list(self.dfas.keys())
31 names.remove(self.startsymbol)
32 names.insert(0, self.startsymbol)
38 dfa = self.dfas[name]
43 arcs.append((self.make_label(c, label), dfa.index(next)))
48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
49 c.start = c.symbol2number[self.startsymbol]
52 def make_first(self, c, name):
53 rawfirst = self.first[name]
56 ilabel = self.make_label(c, label)
61 def make_label(self, c, label):
107 def addfirstsets(self):
108 names = list(self.dfas.keys())
111 if name not in self.first:
112 self.calcfirst(name)
113 #print name, self.first[name].keys()
115 def calcfirst(self, name):
116 dfa = self.dfas[name]
117 self.first[name] = None # dummy to detect left recursion
122 if label in self.dfas:
123 if label in self.first:
124 fset = self.first[label]
128 self.calcfirst(label)
129 fset = self.first[label]
143 self.first[name] = totalset
145 def parse(self):
149 while self.type != token.ENDMARKER:
150 while self.type == token.NEWLINE:
151 self.gettoken()
153 name = self.expect(token.NAME)
154 self.expect(token.OP, ":")
155 a, z = self.parse_rhs()
156 self.expect(token.NEWLINE)
157 #self.dump_nfa(name, a, z)
158 dfa = self.make_dfa(a, z)
159 #self.dump_dfa(name, dfa)
161 self.simplify_dfa(dfa)
169 def make_dfa(self, start, finish):
205 def dump_nfa(self, name, start, finish):
221 def dump_dfa(self, name, dfa):
228 def simplify_dfa(self, dfa):
249 def parse_rhs(self):
251 a, z = self.parse_alt()
252 if self.value != "|":
259 while self.value == "|":
260 self.gettoken()
261 a, z = self.parse_alt()
266 def parse_alt(self):
268 a, b = self.parse_item()
269 while (self.value in ("(", "[") or
270 self.type in (token.NAME, token.STRING)):
271 c, d = self.parse_item()
276 def parse_item(self):
278 if self.value == "[":
279 self.gettoken()
280 a, z = self.parse_rhs()
281 self.expect(token.OP, "]")
285 a, z = self.parse_atom()
286 value = self.value
289 self.gettoken()
296 def parse_atom(self):
298 if self.value == "(":
299 self.gettoken()
300 a, z = self.parse_rhs()
301 self.expect(token.OP, ")")
303 elif self.type in (token.NAME, token.STRING):
306 a.addarc(z, self.value)
307 self.gettoken()
310 self.raise_error("expected (...) or NAME or STRING, got %s/%s",
311 self.type, self.value)
313 def expect(self, type, value=None):
314 if self.type != type or (value is not None and self.value != value):
315 self.raise_error("expected %s/%s, got %s/%s",
316 type, value, self.type, self.value)
317 value = self.value
318 self.gettoken()
321 def gettoken(self):
322 tup = next(self.generator)
324 tup = next(self.generator)
325 self.type, self.value, self.begin, self.end, self.line = tup
326 #print token.tok_name[self.type], repr(self.value)
328 def raise_error(self, msg, *args):
334 raise SyntaxError(msg, (self.filename, self.end[0],
335 self.end[1], self.line))
339 def __init__(self):
340 self.arcs = [] # list of (label, NFAState) pairs
342 def addarc(self, next, label=None):
345 self.arcs.append((label, next))
349 def __init__(self, nfaset, final):
353 self.nfaset = nfaset
354 self.isfinal = final in nfaset
355 self.arcs = {} # map from label to DFAState
357 def addarc(self, next, label):
359 assert label not in self.arcs
361 self.arcs[label] = next
363 def unifystate(self, old, new):
364 for label, next in self.arcs.items():
366 self.arcs[label] = new
368 def __eq__(self, other):
371 if self.isfinal != other.isfinal:
373 # Can't just return self.arcs == other.arcs, because that
375 if len(self.arcs) != len(other.arcs):
377 for label, next in self.arcs.items():