| /external/antlr/tool/src/test/java/org/antlr/test/ |
| TestDFAMatching.java | 30 import org.antlr.analysis.DFA;
50 DFA dfa = g.getLookaheadDFA(1); local
51 checkPrediction(dfa,"a",1);
52 checkPrediction(dfa,"b",2);
53 checkPrediction(dfa,"c",3);
54 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER);
63 DFA dfa = g.getLookaheadDFA(1); local
64 checkPrediction(dfa,"a",1)
77 DFA dfa = g.getLookaheadDFA(1); local
91 DFA dfa = g.getLookaheadDFA(3); local
[all...] |
| TestCharDFAConversion.java | 30 import org.antlr.analysis.DFA;
225 DFA dfa = g.getLookaheadDFA(1); local
226 String result = serializer.serialize(dfa.startState);
266 // same DFA as nongreedy .* but code gen checks number of
384 // less efficient of a DFA
526 DFA dfa = g.getLookaheadDFA(decision); local
527 assertNotNull("unknown decision #"+decision, dfa);
529 String result = serializer.serialize(dfa.startState)
[all...] |
| TestCompositeGrammars.java | 634 org.antlr.analysis.DFA dfa = g.getLookaheadDFA(1); local
636 String result = serializer.serialize(dfa.startState);
682 "b : 'x' | 'y' {;} ;\n"; // preds generated but not need in DFA here
[all...] |
| TestSemanticPredicates.java | 30 import org.antlr.analysis.DFA;
265 DFA dfa = g.getLookaheadDFA(1); local
266 assertEquals(null, dfa); // can't analyze.
269 String result = serializer.serialize(dfa.startState);
639 * alt 1 in rule 'a', it is unnecessary to continue NFA→DFA
717 /** For a DFA state with lots of configurations that have the same
818 DFA dfa = g.getLookaheadDFA(decision); local
820 String result = serializer.serialize(dfa.startState)
[all...] |
| TestDFAConversion.java | 31 import org.antlr.analysis.DFA;
318 "options {k=2;}\n" + // just makes bigger DFA
413 // Should be ok like k=1 'except bigger DFA
1642 DFA dfa = g.getLookaheadDFA(decision); local
[all...] |
| /external/skia/src/sksl/lex/ |
| Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token,
87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include,
98 for (const auto& row : dfa.fTransitions) {
101 out << "static int8_t mappings[" << dfa.fCharMappings.size() << "] = {\n ";
103 for (int m : dfa.fCharMappings) {
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n";
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) {
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size())
195 DFA dfa = converter.convert(); local
[all...] |
| /external/skqp/src/sksl/lex/ |
| Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token,
87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include,
98 for (const auto& row : dfa.fTransitions) {
101 out << "static int8_t mappings[" << dfa.fCharMappings.size() << "] = {\n ";
103 for (int m : dfa.fCharMappings) {
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n";
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) {
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size())
195 DFA dfa = converter.convert(); local
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| NFAToDFAConverter.java | 37 /** Code that embodies the NFA conversion to DFA. A new object is needed
38 * per DFA (also required for thread safety if multiple conversions
42 /** A list of DFA states we still need to process during NFA conversion */
54 /** We are converting which DFA? */
55 protected DFA dfa; field in class:NFAToDFAConverter
70 public NFAToDFAConverter(DFA dfa) {
71 this.dfa = dfa;
[all...] |
| DFAOptimizer.java | 39 * PRUNE_EBNF_EXIT_BRANCHES) during DFA construction, but then it
42 * during DFA construction and before determinism checks.
44 * In general, ANTLR's NFA→DFA→codegen pipeline seems very robust
47 * within the confines of, for example, a DFA. The code generator
100 * Tokens rule DFA goes
110 * Done during DFA construction. See method addTransition() in
115 * Done during DFA construction. See addDFAState() in NFAToDFAConverter.
123 /** Used by DFA state machine generator to avoid infinite recursion
124 * resulting from cycles int the DFA. This is a set of int state #s.
137 // optimize each DFA in this gramma
142 DFA dfa = grammar.getLookaheadDFA(decisionNumber); local
[all...] |
| MachineProbe.java | 42 DFA dfa; field in class:MachineProbe
44 public MachineProbe(DFA dfa) {
45 this.dfa = dfa;
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
85 // walk looking for edge whose target is next dfa state
109 * Given an alternative associated with a DFA state, return the list of
148 // /** Used to find paths through syntactically ambiguous DFA. If we'v
[all...] |
| DecisionProbe.java | 41 * discovered while building the DFA predictor.
43 * The information is collected during NFA→DFA conversion and, while
60 * is represented internall with a DFA comprised of multiple states, each of
63 * Because of this, you need to iterate over this list of DFA states. You'll
72 public DFA dfa; field in class:DecisionProbe
74 /** Track all DFA states with nondeterministic alternatives.
75 * By reaching the same DFA state, a path through the NFA for some input
79 * Note that from the DFA state, you can ask for
92 /** Was a syntactic ambiguity resolved with predicates? Any DFA
[all...] |
| DFAState.java | 38 /** A DFA state represents a set of possible NFA configurations.
39 * As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
42 * input a1a2..an, the DFA is in a state that represents the
45 * In conventional NFA→DFA conversion, therefore, the subset T
61 * A DFA state may have multiple references to a particular state,
69 /** We are part of what DFA? Use this ref to get access to the
72 public DFA dfa; field in class:DFAState
74 /** Track the transitions emanating from this DFA state. The List
80 /** When doing an acyclic DFA, this is the number of lookahead symbol
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Include/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa;
typedef in typeref:struct:__anon5318
63 dfa *g_dfa; /* Array of DFAs */
72 dfa *adddfa(grammar *g, int type, char *name);
73 int addstate(dfa *d);
74 void addarc(dfa *d, int from, int to, int lbl);
75 dfa *PyGrammar_FindDFA(grammar *g, int type);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Include/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa;
typedef in typeref:struct:__anon5625
63 dfa *g_dfa; /* Array of DFAs */
72 dfa *adddfa(grammar *g, int type, char *name);
73 int addstate(dfa *d);
74 void addarc(dfa *d, int from, int to, int lbl);
75 dfa *PyGrammar_FindDFA(grammar *g, int type);
|
| /external/python/cpython2/Include/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon36510
63 dfa *g_dfa; /* Array of DFAs */
73 dfa *adddfa(grammar *g, int type, char *name);
74 int addstate(dfa *d);
75 void addarc(dfa *d, int from, int to, int lbl);
76 dfa *PyGrammar_FindDFA(grammar *g, int type);
|
| /external/python/cpython3/Include/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon37078
63 dfa *g_dfa; /* Array of DFAs */
73 dfa *adddfa(grammar *g, int type, const char *name);
74 int addstate(dfa *d);
75 void addarc(dfa *d, int from, int to, int lbl);
76 dfa *PyGrammar_FindDFA(grammar *g, int type);
|
| /external/antlr/antlr3-maven-plugin/src/main/java/org/antlr/mojo/antlr3/ |
| Antlr3Mojo.java | 111 * DFA for each decision in the grammar in
116 protected boolean dfa; field in class:Antlr3Mojo
145 * Beyond this, ANTLR will not generate a switch statement for the DFA.
285 log.debug("ANTLR: dfa : " + dfa);
318 tool.setGenerate_DFA_dot(dfa);
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 30 import org.antlr.analysis.DFA;
142 // Create the DFA predictors for each decision
180 // Create the DFA predictors for each decision
238 DFA dfa = s.nfa.grammar.getLookaheadDFA(s.getDecisionNumber()); local
242 dfa.getNFADecisionStartState().getDescription()+
247 int predictedAlt = predict(dfa);
249 String description = dfa.getNFADecisionStartState().getDescription();
252 dfa.getDecisionNumber(),
323 // could be jumping to new grammar, make sure DFA create
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| CodeGenerator.java | 32 import org.antlr.analysis.DFA;
66 * to have a separate file for the cyclic DFA as ANTLR generates bytecodes
282 // CREATE NFA FROM GRAMMAR, CREATE DFA FROM NFA
289 // some grammar analysis errors will not yield reliable DFA
294 // OPTIMIZE DFA
619 /** Generate code that computes the predicted alt given a DFA. The
627 DFA dfa)
630 // If we are doing inline DFA and this one is acyclic and LL(*)
632 // check is not done by DFA.verify(); that is, verify() avoid
740 DFA dfa = ((DFAState)edge.target).dfa; \/\/ which DFA are we in local
[all...] |
| /external/antlr/antlr-ant/main/antlr3-task/antlr3-src/org/apache/tools/ant/antlr/ |
| ANTLR3.java | 104 /** The dfa attribute */
105 private boolean dfa; field in class:ANTLR3
108 /** collapse incident edges into DFA states */
215 this.dfa = enable;
227 * collapse incident edges into DFA states
525 if (dfa) {
526 commandline.createArgument().setValue("-dfa");
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/dlg/ |
| dlg_a.c | 1232 DfaState *dfa[94] = {
variable
|
| /external/antlr/antlr-ant/main/antlr3-task/ |
| antlr3.jar | |
| /external/antlr/tool/src/main/java/org/antlr/ |
| Tool.java | 210 else if (args[i].equals("-dfa")) {
284 System.err.println("missing max inline dfa states -Xmaxinlinedfastates option; ignoring");
324 DFA.MAX_STATE_TRANSITIONS_FOR_TABLE = Integer.parseInt(args[i]);
333 DFA.MAX_TIME_PER_DFA_CREATION = Integer.parseInt(args[i]);
652 /** Create NFA, DFA and generate code for grammar.
654 * it's ok to create DFA, which must check for left-recursion. That check
656 * After all NFA, comes DFA conversion for root grammar then code gen for
657 * root grammar. DFA and code gen for delegates comes next.
692 DFA dfa = g.getLookaheadDFA(d) local
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/serializable/ |
| FormatHandler.java | 1860 DateFormat dfa = (DateFormat) a; local
2017 DateIntervalFormat dfa = (DateIntervalFormat) a; local
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/serializable/ |
| FormatHandler.java | 1857 DateFormat dfa = (DateFormat) a; local
2014 DateIntervalFormat dfa = (DateIntervalFormat) a; local
[all...] |
