| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestDFAMatching.java | 30 import org.antlr.analysis.DFA;
48 DFA dfa = g.getLookaheadDFA(1); local
49 checkPrediction(dfa,"a",1);
50 checkPrediction(dfa,"b",2);
51 checkPrediction(dfa,"c",3);
52 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER);
61 DFA dfa = g.getLookaheadDFA(1); local
62 checkPrediction(dfa,"a",1)
75 DFA dfa = g.getLookaheadDFA(1); local
89 DFA dfa = g.getLookaheadDFA(3); local
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| test-dfa.rb | 8 class DFASubclass < ANTLR3::DFA
23 dfa = DFASubclass.new(nil, 1)
24 dfa.eot.should == DFASubclass::EOT
25 dfa.eof.should == DFASubclass::EOF
26 dfa.max.should == DFASubclass::MAX
27 dfa.min.should == DFASubclass::MIN
28 dfa.accept.should == DFASubclass::ACCEPT
29 dfa.special.should == DFASubclass::SPECIAL
30 dfa.transition.should == DFASubclass::TRANSITION
49 ANTLR3::DFA.unpack(*packed).should == unpacke
[all...] |
| /external/clang/test/CodeGen/ |
| 2009-05-22-callingconv.c | 8 int icase, const re_dfa_t *dfa)
11 re_string_construct (pstr, str, len, trans, icase, dfa)
16 const re_dfa_t *dfa;
18 if (dfa != (void*)0x282020c0)
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarReport2.java | 60 if ( d.dfa==null ) { // unusued decisions in auto synpreds
61 //System.err.println("no decision "+decision+" dfa for "+d.blockAST.toStringTree());
64 int k = d.dfa.getMaxLookaheadDepth();
65 Rule enclosingRule = d.dfa.decisionNFAStartState.enclosingRule;
70 d.dfa.decisionNFAStartState.associatedASTNode;
76 if ( d.dfa.isCyclic() ) buf.append(" cyclic");
78 if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated
79 if ( d.dfa.hasSemPred() ) buf.append(" sempred"); // user-defined sempred
83 // String result = serializer.serialize(d.dfa.startState);
|
| GrammarUnreachableAltsMessage.java | 50 if ( probe.dfa.isTokensRuleDecision() ) {
56 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
59 String fileName = probe.dfa.nfa.grammar.getFileName();
66 if ( probe.dfa.isTokensRuleDecision() ) {
74 probe.dfa.nfa.grammar.getRuleStartState(tokenName);
|
| GrammarAnalysisAbortedMessage.java | 45 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
48 String fileName = probe.dfa.nfa.grammar.getFileName();
54 probe.dfa.getNFADecisionStartState().enclosingRule.name);
|
| GrammarNonDeterminismMessage.java | 54 if ( probe.dfa.isTokensRuleDecision() ) {
60 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
63 String fileName = probe.dfa.nfa.grammar.getFileName();
74 if ( probe.dfa.isTokensRuleDecision() ) {
82 probe.dfa.nfa.grammar.getRuleStartState(tokenName);
93 NFAState nfaStart = probe.dfa.getNFADecisionStartState();
112 if ( probe.dfa.isTokensRuleDecision() ) {
124 st.add("hasPredicateBlockedByAction", problemState.dfa.hasPredicateBlockedByAction);
|
| GrammarInsufficientPredicatesMessage.java | 54 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
57 String fileName = probe.dfa.nfa.grammar.getFileName();
80 List<Label> sampleInputLabels = problemState.dfa.probe.getSampleNonDeterministicInputSequence(problemState);
81 String input = problemState.dfa.probe.getInputSequenceDisplay(sampleInputLabels);
84 st.add("hasPredicateBlockedByAction", problemState.dfa.hasPredicateBlockedByAction);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| 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...] |
| 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...] |
| 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...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| __init__.py | 112 # DFA
148 from dfa import *
|
| /external/libpng/contrib/oss-fuzz/ |
| build.sh | 22 # 2. Disabled WARNING and WRITE options in pnglibconf.dfa.
26 cat scripts/pnglibconf.dfa | \
30 > scripts/pnglibconf.dfa.temp
31 mv scripts/pnglibconf.dfa.temp scripts/pnglibconf.dfa
|
| /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:__anon4338
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:__anon4645
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:__anon32586
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/cpython3/Include/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon33150
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);
|
| /prebuilts/gdb/darwin-x86/include/python2.7/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon66477
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);
|
| /prebuilts/gdb/linux-x86/include/python2.7/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon66599
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);
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon992
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);
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| grammar.h | 35 /* A state in a DFA */
48 /* A DFA */
57 } dfa; typedef in typeref:struct:__anon1115
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/antlr/antlr-3.4/runtime/C/include/ |
| antlr3cyclicdfa.h | 1 /// Definition of a cyclic dfa structure such that it can be
3 /// runtime function that can deal with all cyclic dfa
71 ANTLR3_INT32 (*specialStateTransition) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa, ANTLR3_INT32 s);
73 ANTLR3_INT32 (*specialTransition) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa, ANTLR3_INT32 s);
75 ANTLR3_INT32 (*predict) (void * ctx, pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_INT_STREAM is, struct ANTLR3_CYCLIC_DFA_struct * dfa);
|
| /external/libpng/scripts/ |
| pnglibconf.mak | 5 # how to automate the build of pnglibconf.h from scripts/pnglibconf.dfa
20 DFA_XTRA = # Put your configuration file here, see scripts/pnglibconf.dfa. Eg:
21 # DFA_XTRA = pngusr.dfa
41 pnglibconf.dfn: $(srcdir)/scripts/pnglibconf.dfa $(srcdir)/scripts/options.awk $(srcdir)/pngconf.h $(srcdir)/pngusr.dfa $(DFA_XTRA)
46 version=search $(srcdir)/pngconf.h $(srcdir)/scripts/pnglibconf.dfa\
47 $(srcdir)/pngusr.dfa $(DFA_XTRA) 1>&2
|
| /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 int16_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 int16_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...] |
