| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 50 DFA dfa = g.getLookaheadDFA(1); in testSimpleAltCharTest() local
51 checkPrediction(dfa,"a",1); in testSimpleAltCharTest()
52 checkPrediction(dfa,"b",2); in testSimpleAltCharTest()
53 checkPrediction(dfa,"c",3); in testSimpleAltCharTest()
54 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); in testSimpleAltCharTest()
63 DFA dfa = g.getLookaheadDFA(1); in testSets() local
64 checkPrediction(dfa,"a",1); in testSets()
65 checkPrediction(dfa,"q",1); in testSets()
66 checkPrediction(dfa,"z",1); in testSets()
67 checkPrediction(dfa,";",2); in testSets()
[all …]
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | NFAToDFAConverter.java | 55 protected DFA dfa; field in NFAToDFAConverter
70 public NFAToDFAConverter(DFA dfa) { in NFAToDFAConverter() argument
71 this.dfa = dfa; in NFAToDFAConverter()
72 int nAlts = dfa.getNumberOfAlts(); in NFAToDFAConverter()
80 dfa.startState = computeStartState(); in convert()
84 !dfa.nfa.grammar.NFAToDFAConversionExternallyAborted() ) in convert()
87 if ( dfa.nfa.grammar.composite.watchNFAConversion ) { in convert()
91 int k = dfa.getUserMaxLookahead(); in convert()
118 dfa.findAllGatedSynPredsUsedInDFAAcceptStates(); in convert()
140 NFAState alt = dfa.decisionNFAStartState; in computeStartState()
[all …]
|
| D | DecisionProbe.java | 72 public DFA dfa; field in DecisionProbe
168 public DecisionProbe(DFA dfa) { in DecisionProbe() argument
169 this.dfa = dfa; in DecisionProbe()
178 return dfa.getNFADecisionStartState().getDescription(); in getDescription()
182 return dfa.isReduced(); in isReduced()
186 return dfa.isCyclic(); in isCyclic()
195 dfa.getUnreachableAlts().isEmpty() ) in isDeterministic()
229 return dfa.getNumberOfStates(); in getNumberOfStates()
238 return dfa.getUnreachableAlts(); in getUnreachableAlts()
302 if ( dfa==null || dfa.startState==null ) { in getSampleNonDeterministicInputSequence()
[all …]
|
| D | DFAOptimizer.java | 142 DFA dfa = grammar.getLookaheadDFA(decisionNumber); in optimize() local
143 optimize(dfa); in optimize()
147 protected void optimize(DFA dfa) { in optimize() argument
148 if ( dfa==null ) { in optimize()
156 if ( PRUNE_EBNF_EXIT_BRANCHES && dfa.canInlineDecision() ) { in optimize()
159 dfa.getNFADecisionStartState().decisionStateType; in optimize()
160 if ( dfa.isGreedy() && in optimize()
164 optimizeExitBranches(dfa.startState); in optimize()
169 dfa.isTokensRuleDecision() && in optimize()
170 dfa.probe.stateToSyntacticallyAmbiguousTokensRuleAltsMap.size()>0 ) in optimize()
[all …]
|
| /external/skia/src/sksl/lex/ |
| D | Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token, in writeH() argument
87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include, in writeCPP() argument
98 for (const auto& row : dfa.fTransitions) { in writeCPP()
101 out << "static int8_t mappings[" << dfa.fCharMappings.size() << "] = {\n "; in writeCPP()
103 for (int m : dfa.fCharMappings) { in writeCPP()
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n"; in writeCPP()
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) { in writeCPP()
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size()) { in writeCPP()
113 out << " " << dfa.fTransitions[c][j] << ","; in writeCPP()
125 if (i < dfa.fAccepts.size()) { in writeCPP()
[all …]
|
| /external/skqp/src/sksl/lex/ |
| D | Main.cpp | 33 void writeH(const DFA& dfa, const char* lexer, const char* token, in writeH() argument
87 void writeCPP(const DFA& dfa, const char* lexer, const char* token, const char* include, in writeCPP() argument
98 for (const auto& row : dfa.fTransitions) { in writeCPP()
101 out << "static int8_t mappings[" << dfa.fCharMappings.size() << "] = {\n "; in writeCPP()
103 for (int m : dfa.fCharMappings) { in writeCPP()
108 out << "static int16_t transitions[" << dfa.fTransitions.size() << "][" << states << "] = {\n"; in writeCPP()
109 for (size_t c = 0; c < dfa.fTransitions.size(); ++c) { in writeCPP()
112 if ((size_t) c < dfa.fTransitions.size() && j < dfa.fTransitions[c].size()) { in writeCPP()
113 out << " " << dfa.fTransitions[c][j] << ","; in writeCPP()
125 if (i < dfa.fAccepts.size()) { in writeCPP()
[all …]
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3cyclicdfa.inl | 26 CyclicDFA<ImplTraits, CtxType>::CyclicDFA( const CyclicDFA& dfa ) argument
28 m_decisionNumber = dfa.m_decisionNumber;
29 m_description = dfa.m_description;
30 m_eot = dfa.m_eot;
31 m_eof = dfa.m_eof;
32 m_min = dfa.m_min;
33 m_max = dfa.m_max;
34 m_accept = dfa.m_accept;
35 m_special = dfa.m_special;
36 m_transition = dfa.m_transition;
[all …]
|
| /external/antlr/runtime/Ruby/test/unit/ |
| 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/python/cpython2/Lib/lib2to3/pgen2/ |
| D | pgen.py | 38 dfa = self.dfas[name]
40 for state in dfa:
43 arcs.append((self.make_label(c, label), dfa.index(next)))
45 arcs.append((0, dfa.index(state)))
116 dfa = self.dfas[name]
118 state = dfa[0]
158 dfa = self.make_dfa(a, z)
160 oldlen = len(dfa)
161 self.simplify_dfa(dfa)
162 newlen = len(dfa)
[all …]
|
| D | parse.py | 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, state, node = self.stack[-1]
|
| /external/python/cpython3/Lib/lib2to3/pgen2/ |
| D | pgen.py | 38 dfa = self.dfas[name]
40 for state in dfa:
43 arcs.append((self.make_label(c, label), dfa.index(next)))
45 arcs.append((0, dfa.index(state)))
116 dfa = self.dfas[name]
118 state = dfa[0]
158 dfa = self.make_dfa(a, z)
160 oldlen = len(dfa)
161 self.simplify_dfa(dfa)
162 newlen = len(dfa)
[all …]
|
| D | parse.py | 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, state, node = self.stack[-1]
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | GrammarNonDeterminismMessage.java | 54 if ( probe.dfa.isTokensRuleDecision() ) { in GrammarNonDeterminismMessage()
61 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
64 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
75 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
82 probe.dfa.nfa.grammar.getRuleStartState(tokenName); in toString()
93 NFAState nfaStart = probe.dfa.getNFADecisionStartState(); in toString()
111 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
123 st.add("hasPredicateBlockedByAction", problemState.dfa.hasPredicateBlockedByAction); in toString()
|
| D | GrammarReport2.java | 61 if ( d.dfa==null ) { // unusued decisions in auto synpreds in stats()
65 int k = d.dfa.getMaxLookaheadDepth(); in stats()
66 Rule enclosingRule = d.dfa.decisionNFAStartState.enclosingRule; in stats()
71 d.dfa.decisionNFAStartState.associatedASTNode; in stats()
77 if ( d.dfa.isCyclic() ) buf.append(" cyclic"); in stats()
79 if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated in stats()
80 if ( d.dfa.hasSemPred() ) buf.append(" sempred"); // user-defined sempred in stats()
|
| D | GrammarReport.java | 142 if( d.dfa==null ) { in getReportData()
146 Rule r = d.dfa.decisionNFAStartState.enclosingRule; in getReportData()
157 if ( d.dfa.hasSynPred() ) dfaWithSynPred++; in getReportData()
171 if ( !d.dfa.isCyclic() ) { in getReportData()
172 if ( d.dfa.isClassicDFA() ) { in getReportData()
173 int maxk = d.dfa.getMaxLookaheadDepth(); in getReportData()
179 acyclicDFAStates[acyclicIndex] = d.dfa.getNumberOfStates(); in getReportData()
186 cyclicDFAStates[cyclicIndex] = d.dfa.getNumberOfStates(); in getReportData()
292 for (DFA dfa : dfas) { in getDFALocations()
294 if ( decisions.contains(Utils.integer(dfa.decisionNumber)) ) { in getDFALocations()
[all …]
|
| D | GrammarUnreachableAltsMessage.java | 50 if ( probe.dfa.isTokensRuleDecision() ) { in GrammarUnreachableAltsMessage()
57 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
60 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
67 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
75 probe.dfa.nfa.grammar.getRuleStartState(tokenName); in toString()
|
| /external/libpng/contrib/conftest/ |
| D | README | 1 This directory contains test configuration files, currently always '.dfa' files
6 by building 'make check', or 'make all-am' for cross-builds, with each .dfa
13 releases. However if a .dfa file describing a configuration is not in this
16 You can use these .dfa files as the basis of new configurations. Files in this
26 ${srcdir}/pngusr.dfa
27 ${srcdir}/contrib/pngminim/*/pngusr.dfa
30 ${srcdir}/scripts/pnglibconf.dfa
47 long (excluding the .dfa extension). Submitted .dfa files should have names
|
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| D | ACyclicDFACodeGenerator.java | 46 DFA dfa) in genFixedLookaheadDecision() argument
48 return walkFixedDFAGeneratingStateMachine(templates, dfa, dfa.startState, 1); in genFixedLookaheadDecision()
53 DFA dfa, in walkFixedDFAGeneratingStateMachine() argument
78 if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.LOOPBACK ) { in walkFixedDFAGeneratingStateMachine()
81 else if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.OPTIONAL_BLOCK_START ) { in walkFixedDFAGeneratingStateMachine()
140 dfa); in walkFixedDFAGeneratingStateMachine()
147 dfa, in walkFixedDFAGeneratingStateMachine()
181 dfa, in walkFixedDFAGeneratingStateMachine()
|
| /external/python/cpython3/Include/ |
| D | grammar.h | 57 } dfa; typedef
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/python/cpython2/Include/ |
| D | grammar.h | 57 } dfa; typedef
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/antlr/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| D | ObjC.stg | 275 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> *dfa<dfa.decisionNumber>;}; separator="\n">
358 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = [DFA<dfa.decisionNumber> newDFA<dfa.decisionNumber>Wi…
366 <cyclicDFAs:{dfa | [dfa<dfa.decisionNumber> release];}; separator="\n">
599 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> *dfa<dfa.decisionNumber>;}; separator="\n">
741 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = [DFA<dfa.decisionNumber> newDFA<dfa.decisionNumber>Wi…
754 <cyclicDFAs:{dfa | [dfa<dfa.decisionNumber> release];}; separator="\n">
1497 alt<decisionNumber> = [dfa<decisionNumber> predict:input];
1501 cyclicDFAInterface(dfa) ::= <<
1502 #pragma mark Cyclic DFA interface start DFA<dfa.decisionNumber>
1503 @interface DFA<dfa.decisionNumber> : DFA {
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| D | CSharp3.stg | 188 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
193 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
347 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
352 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
764 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
783 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
823 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
861 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
1278 alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
1295 cyclicDFA(dfa) ::= <<
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| D | CSharp2.stg | 193 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
198 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
355 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
360 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
384 <grammar.decisions:{d | <d.dfa.hasSynPred>}; wrap="\n", separator=", ">
1301 alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
1318 cyclicDFA(dfa) ::= <<
1319 private class DFA<dfa.decisionNumber> : DFA
1321 private const string DFA<dfa.decisionNumber>_eotS =
1322 "<dfa.javaCompressedEOT; wrap="\"+\n\t\t\"">";
[all …]
|
| /external/clang/test/CodeGen/ |
| D | 2009-05-22-callingconv.c | 8 int icase, const re_dfa_t *dfa)
11 re_string_construct (pstr, str, len, trans, icase, dfa) in re_string_construct() argument
16 const re_dfa_t *dfa;
18 if (dfa != (void*)0x282020c0)
|
| /external/libpng/projects/owatcom/ |
| D | pngconfig.mak | 9 # pngconfig.dfa: Advanced configuration for non-standard libpng builds.
56 instructions consult and edit projects/openwatcom/pngconfig.dfa
60 pnglibconf.dfn: ..\..\scripts\pnglibconf.dfa ..\..\scripts\options.awk pngconfig.dfa ..\..\pngconf.h
62 …ut=dfn1.out version=search ..\..\pngconf.h ..\..\scripts\pnglibconf.dfa pngconfig.dfa $(DFA_XTRA) …
96 projects/owatcom/pngconfig.dfa.
114 $# pngconfig.dfa.
118 @$(COPY) << pngconfig.dfa
119 $# pngconfig.dfa: this file contains configuration options for libpng.
133 $# If build issues errors after a change to pngconfig.dfa you have entered
135 $# pngconfig.dfa. The error messages from awk should be comprehensible, but
[all …]
|