/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestDFAMatching.java | 48 DFA dfa = g.getLookaheadDFA(1); 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); 62 checkPrediction(dfa,"a",1); 63 checkPrediction(dfa,"q",1); 64 checkPrediction(dfa,"z",1); 65 checkPrediction(dfa,";", 95 checkPrediction(DFA dfa, String input, int expected) argument [all...] |
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | __init__.py | 148 from dfa import *
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-dfa.rb | 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
|
/external/clang/test/CodeGen/ |
H A D | 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/ |
H A D | 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);
|
H A D | 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);
|
H A D | GrammarAnalysisAbortedMessage.java | 45 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); 48 String fileName = probe.dfa.nfa.grammar.getFileName(); 54 probe.dfa.getNFADecisionStartState().enclosingRule.name);
|
H A D | 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);
|
H A D | 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/ |
H A D | DFAOptimizer.java | 142 DFA dfa = grammar.getLookaheadDFA(decisionNumber); 143 optimize(dfa); 147 protected void optimize(DFA dfa) { argument 148 if ( dfa==null ) { 152 System.out.println("Optimize DFA "+dfa.decisionNFAStartState.decisionNumber+ 153 " num states="+dfa.getNumberOfStates()); 156 if ( PRUNE_EBNF_EXIT_BRANCHES && dfa.canInlineDecision() ) { 159 dfa.getNFADecisionStartState().decisionStateType; 160 if ( dfa.isGreedy() && 164 optimizeExitBranches(dfa [all...] |
H A D | DecisionProbe.java | 72 public DFA dfa; field in class:DecisionProbe 168 public DecisionProbe(DFA dfa) { argument 169 this.dfa = dfa; 178 return dfa.getNFADecisionStartState().getDescription(); 182 return dfa.isReduced(); 186 return dfa.isCyclic(); 195 dfa.getUnreachableAlts().size()==0 ) 232 return dfa.getNumberOfStates(); 241 return dfa 632 reportNonLLStarDecision(DFA dfa) argument [all...] |
H A D | NFAToDFAConverter.java | 55 protected DFA dfa; field in class:NFAToDFAConverter 70 public NFAToDFAConverter(DFA dfa) { argument 71 this.dfa = dfa; 72 int nAlts = dfa.getNumberOfAlts(); 77 //dfa.conversionStartTime = System.currentTimeMillis(); 80 dfa.startState = computeStartState(); 84 !dfa.nfa.grammar.NFAToDFAConversionExternallyAborted() ) 87 if ( dfa.nfa.grammar.composite.watchNFAConversion ) { 91 int k = dfa [all...] |
/external/libpng/contrib/oss-fuzz/ |
H A D | 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
|
/external/python/cpython2/Include/ |
H A D | grammar.h | 57 } dfa; typedef in typeref:struct:__anon19254 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/ |
H A D | grammar.h | 57 } dfa; typedef in typeref:struct:__anon19818 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/antlr-3.4/runtime/C/include/ |
H A D | 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/ |
H A D | 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/ |
H A D | Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token, argument 87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include, argument 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()) { 113 out << " " << dfa 195 DFA dfa = converter.convert(); local [all...] |
/external/skqp/src/sksl/lex/ |
H A D | Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token, argument 87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include, argument 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()) { 113 out << " " << dfa 195 DFA dfa = converter.convert(); local [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
H A D | Ruby.stg | 876 alt_<decisionNumber> = @dfa<decisionNumber>.predict( @input ) 887 cyclicDFA(dfa) ::= << 888 class DFA<dfa.decisionNumber> \< ANTLR3::DFA 889 EOT = unpack( <dfa.javaCompressedEOT; anchor, separator=", ", wrap="\n"> ) 890 EOF = unpack( <dfa.javaCompressedEOF; anchor, separator=", ", wrap="\n"> ) 891 MIN = unpack( <dfa.javaCompressedMin; anchor, separator=", ", wrap="\n"> ) 892 MAX = unpack( <dfa.javaCompressedMax; anchor, separator=", ", wrap="\n"> ) 893 ACCEPT = unpack( <dfa.javaCompressedAccept; anchor, separator=", ", wrap="\n"> ) 894 SPECIAL = unpack( <dfa.javaCompressedSpecial; anchor, separator=", ", wrap="\n"> ) 896 <dfa [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | ACyclicDFACodeGenerator.java | 45 DFA dfa) 47 return walkFixedDFAGeneratingStateMachine(templates, dfa, dfa.startState, 1); 52 DFA dfa, 56 //System.out.println("walk "+s.stateNumber+" in dfa for decision "+dfa.decisionNumber); 77 if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.LOOPBACK ) { 80 else if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.OPTIONAL_BLOCK_START ) { 88 String description = dfa.getNFADecisionStartState().getDescription(); 90 //System.out.println("DFA: "+description+" associated with AST "+dfa 44 genFixedLookaheadDecision(STGroup templates, DFA dfa) argument 50 walkFixedDFAGeneratingStateMachine( STGroup templates, DFA dfa, DFAState s, int k) argument [all...] |
/external/python/cpython2/Lib/lib2to3/pgen2/ |
H A D | parse.py | 104 # Each stack entry is a tuple: (dfa, state, node). 119 dfa, state, node = self.stack[-1] 120 states, first = dfa 137 dfa, state, node = self.stack[-1] 138 states, first = dfa 177 dfa, state, node = self.stack[-1] 182 self.stack[-1] = (dfa, newstate, node) 186 dfa, state, node = self.stack[-1] 188 self.stack[-1] = (dfa, newstate, node) 197 dfa, stat [all...] |
/external/python/cpython3/Lib/lib2to3/pgen2/ |
H A D | parse.py | 104 # Each stack entry is a tuple: (dfa, state, node). 119 dfa, state, node = self.stack[-1] 120 states, first = dfa 137 dfa, state, node = self.stack[-1] 138 states, first = dfa 177 dfa, state, node = self.stack[-1] 182 self.stack[-1] = (dfa, newstate, node) 186 dfa, state, node = self.stack[-1] 188 self.stack[-1] = (dfa, newstate, node) 197 dfa, stat [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/ |
H A D | CPP.stg | 151 // cyclic dfa's 152 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this);}; separator="\n"> 153 // dfa tables.. 301 <cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<df [all...] |
/external/python/cpython2/Parser/ |
H A D | grammar1.c | 11 dfa * 14 register dfa *d;
|