OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:dfas
(Results
1 - 11
of
11
) sorted by null
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/
grammar.py
47
states -- a list of
DFAs
, where each DFA is a list of
55
dfas
-- a dict mapping symbol numbers to (DFA, first)
66
DFAs
.
80
self.
dfas
= {}
105
for dict_attr in ("symbol2number", "number2symbol", "
dfas
", "keywords",
122
print "
dfas
"
123
pprint(self.
dfas
)
parse.py
108
stackentry = (self.grammar.
dfas
[start], 0, newnode)
143
itsdfa = self.grammar.
dfas
[t]
147
self.push(t, self.grammar.
dfas
[t], newstate, context)
pgen.py
21
self.
dfas
, self.startsymbol = self.parse()
29
names = self.
dfas
.keys()
38
dfa = self.
dfas
[name]
48
c.
dfas
[c.symbol2number[name]] = (states, self.make_first(c, name))
108
names = self.
dfas
.keys()
116
dfa = self.
dfas
[name]
122
if label in self.
dfas
:
146
dfas
= {}
163
dfas
[name] = dfa
167
return
dfas
, startsymbo
[
all
...]
conv.py
95
2) a table defining
dfas
166
# Parse the
dfas
167
dfas
= {}
168
mo = re.match(r"static dfa
dfas
\[(\d+)\] = {$", line)
193
dfas
[number] = (state, first)
196
self.
dfas
=
dfas
226
assert ndfas == len(self.
dfas
)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/
grammar.py
47
states -- a list of
DFAs
, where each DFA is a list of
55
dfas
-- a dict mapping symbol numbers to (DFA, first)
66
DFAs
.
80
self.
dfas
= {}
105
for dict_attr in ("symbol2number", "number2symbol", "
dfas
", "keywords",
122
print "
dfas
"
123
pprint(self.
dfas
)
parse.py
108
stackentry = (self.grammar.
dfas
[start], 0, newnode)
143
itsdfa = self.grammar.
dfas
[t]
147
self.push(t, self.grammar.
dfas
[t], newstate, context)
pgen.py
21
self.
dfas
, self.startsymbol = self.parse()
29
names = self.
dfas
.keys()
38
dfa = self.
dfas
[name]
48
c.
dfas
[c.symbol2number[name]] = (states, self.make_first(c, name))
108
names = self.
dfas
.keys()
116
dfa = self.
dfas
[name]
122
if label in self.
dfas
:
146
dfas
= {}
163
dfas
[name] = dfa
167
return
dfas
, startsymbo
[
all
...]
conv.py
95
2) a table defining
dfas
166
# Parse the
dfas
167
dfas
= {}
168
mo = re.match(r"static dfa
dfas
\[(\d+)\] = {$", line)
193
dfas
[number] = (state, first)
196
self.
dfas
=
dfas
226
assert ndfas == len(self.
dfas
)
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
GrammarReport.java
290
protected String getDFALocations(Set
dfas
) {
293
Iterator it =
dfas
.iterator();
433
buf.append("Decision
DFAs
using syntactic predicates (ignoring synpred rules): ");
443
buf.append("Decision
DFAs
using semantic predicates: ");
/external/antlr/antlr-3.4/lib/
antlr-3.4-complete.jar
/prebuilts/misc/common/antlr/
antlr-3.4-complete.jar
Completed in 95 milliseconds