Lines Matching refs:label
42 for label, next in sorted(state.arcs.items()):
43 arcs.append((self.make_label(c, label), dfa.index(next)))
55 for label in sorted(rawfirst):
56 ilabel = self.make_label(c, label)
61 def make_label(self, c, label):
64 if label[0].isalpha():
66 if label in c.symbol2number:
68 if label in c.symbol2label:
69 return c.symbol2label[label]
71 c.labels.append((c.symbol2number[label], None))
72 c.symbol2label[label] = ilabel
76 itoken = getattr(token, label, None)
77 assert isinstance(itoken, int), label
78 assert itoken in token.tok_name, label
87 assert label[0] in ('"', "'"), label
88 value = eval(label)
121 for label, next in state.arcs.items():
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]
131 overlapcheck[label] = fset
133 totalset[label] = 1
134 overlapcheck[label] = {label: 1}
136 for label, itsfirst in overlapcheck.items():
141 (name, symbol, label, inverse[symbol]))
142 inverse[symbol] = label
185 for label, next in state.arcs:
186 if label is None:
192 for label, next in nfastate.arcs:
193 if label is not None:
194 addclosure(next, arcs.setdefault(label, {}))
195 for label, nfaset in sorted(arcs.items()):
202 state.addarc(st, label)
210 for label, next in state.arcs:
216 if label is None:
219 print(" %s -> %d" % (label, j))
225 for label, next in sorted(state.arcs.items()):
226 print(" %s -> %d" % (label, dfa.index(next)))
340 self.arcs = [] # list of (label, NFAState) pairs
342 def addarc(self, next, label=None):
343 assert label is None or isinstance(label, str)
345 self.arcs.append((label, next))
355 self.arcs = {} # map from label to DFAState
357 def addarc(self, next, label):
358 assert isinstance(label, str)
359 assert label not in self.arcs
361 self.arcs[label] = next
364 for label, next in self.arcs.items():
366 self.arcs[label] = new
377 for label, next in self.arcs.items():
378 if next is not other.arcs.get(label):