| /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)
|
| 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)
|
| 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...] |
| 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)
|
| /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)
|
| 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)
|
| 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...] |
| 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)
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| grammar.h | 63 dfa *g_dfa; /* Array of DFAs */
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| grammar.h | 63 dfa *g_dfa; /* Array of DFAs */
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/Finder/ |
| Enumerations.py | 47 'AppleShare_format' : 'dfas', #
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 36 /** A module to perform optimizations on DFAs.
85 * NOTE 2. I do not optimize cyclic DFAs at the moment as it doesn't
87 * can do on cyclic DFAs to make them have fewer edges. Might have
|
| NFAState.java | 160 * as transition 0 points at the exit branch (we compute DFAs
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| constants.rb | 75 # End of Rule (used internally by DFAs)
|
| dfa.rb | 164 | When DFAs are generated by ANTLR, this information should already be
|
| /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: ");
|
| Interpreter.java | 116 * it is using an NFA because it uses DFAs at each decision point to
134 // Build NFAs/DFAs from the grammar AST if NFAs haven't been built yet
173 // Build NFAs/DFAs from the grammar AST if NFAs haven't been built yet
|
| FASerializer.java | 72 * NFAs or DFAs will have identical serialized representations. The
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| CodeGenerator.java | 138 /** I have factored out the generation of acyclic DFAs to separate class */
142 /** I have factored out the generation of cyclic DFAs to separate class */
269 * with that grammar to create NFAs. Then create the DFAs for all
270 * decision points in the grammar by converting the NFAs to DFAs.
417 // Decisions are generated by using the precomputed DFAs
629 * Regardless, the output file and header file get a copy of the DFAs.
[all...] |
| /external/antlr/antlr-3.4/antlr3-maven-plugin/src/site/apt/ |
| usage.apt.vm | 69 on cyclic DFAs, which rules may use backtracking, and so on.
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3intstream.h | 4 * Certain functionality (such as DFAs for instance) abstract the stream of tokens
|
| /external/antlr/antlr-3.4/runtime/C/vsrulefiles/ |
| antlr3lexer.rules | 32 Description="When set to True ANTLR3 will produce a number of .dot files that can be used with dot/graphviz to genreate pictorial representations of the DFAs gnerated for this grammar."
|
| antlr3lexerandparser.rules | 33 Description="When set to True ANTLR3 will produce a number of .dot files that can be used with dot/graphviz to genreate pictorial representations of the DFAs gnerated for this grammar."
|
| antlr3parser.rules | 32 Description="When set to True ANTLR3 will produce a number of .dot files that can be used with dot/graphviz to genreate pictorial representations of the DFAs gnerated for this grammar."
|
| antlr3treeparser.rules | 32 Description="When set to True ANTLR3 will produce a number of .dot files that can be used with dot/graphviz to genreate pictorial representations of the DFAs gnerated for this grammar."
|
