Home
last modified time | relevance | path

Searched refs:dfa (Results 1 – 25 of 174) sorted by relevance

1234567

/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
DTestDFAMatching.java48 DFA dfa = g.getLookaheadDFA(1); in testSimpleAltCharTest() local
49 checkPrediction(dfa,"a",1); in testSimpleAltCharTest()
50 checkPrediction(dfa,"b",2); in testSimpleAltCharTest()
51 checkPrediction(dfa,"c",3); in testSimpleAltCharTest()
52 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); in testSimpleAltCharTest()
61 DFA dfa = g.getLookaheadDFA(1); in testSets() local
62 checkPrediction(dfa,"a",1); in testSets()
63 checkPrediction(dfa,"q",1); in testSets()
64 checkPrediction(dfa,"z",1); in testSets()
65 checkPrediction(dfa,";",2); in testSets()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DNFAToDFAConverter.java55 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 …]
DDecisionProbe.java72 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().size()==0 ) in isDeterministic()
232 return dfa.getNumberOfStates(); in getNumberOfStates()
241 return dfa.getUnreachableAlts(); in getUnreachableAlts()
305 if ( dfa==null || dfa.startState==null ) { in getSampleNonDeterministicInputSequence()
[all …]
DDFAOptimizer.java142 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/
DMain.cpp33 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 int16_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/
DMain.cpp33 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 int16_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/antlr-3.4/runtime/Ruby/test/unit/
Dtest-dfa.rb23 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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/
DCPP.stg151 // cyclic dfa's
152 …<cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(t…
153 // dfa tables..
301 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
998 cyclicDFA(dfa) ::= <<
999 /* cyclicDFA=<dfa>
1001 // cyclic = <dfa.cyclic>
1002 // numstates = <dfa.numberOfStates>
1004 // startState = <dfa.startState>
1005 // startState.numberOfTransitions = <dfa.startState.NumberOfTransitions>
[all …]
/external/python/cpython2/Lib/lib2to3/pgen2/
Dpgen.py38 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 …]
Dparse.py119 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/
Dpgen.py38 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 …]
Dparse.py119 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/antlr-3.4/tool/src/main/java/org/antlr/tool/
DGrammarReport2.java60 if ( d.dfa==null ) { // unusued decisions in auto synpreds in stats()
64 int k = d.dfa.getMaxLookaheadDepth(); in stats()
65 Rule enclosingRule = d.dfa.decisionNFAStartState.enclosingRule; in stats()
70 d.dfa.decisionNFAStartState.associatedASTNode; in stats()
76 if ( d.dfa.isCyclic() ) buf.append(" cyclic"); in stats()
78 if ( d.dfa.hasSynPred() ) buf.append(" backtracks"); // isolated synpred not gated in stats()
79 if ( d.dfa.hasSemPred() ) buf.append(" sempred"); // user-defined sempred in stats()
DGrammarNonDeterminismMessage.java54 if ( probe.dfa.isTokensRuleDecision() ) { in GrammarNonDeterminismMessage()
60 GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); in toString()
63 String fileName = probe.dfa.nfa.grammar.getFileName(); in toString()
74 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
82 probe.dfa.nfa.grammar.getRuleStartState(tokenName); in toString()
93 NFAState nfaStart = probe.dfa.getNFADecisionStartState(); in toString()
112 if ( probe.dfa.isTokensRuleDecision() ) { in toString()
124 st.add("hasPredicateBlockedByAction", problemState.dfa.hasPredicateBlockedByAction); in toString()
DGrammarReport.java143 if( d.dfa==null ) { in getReportData()
147 Rule r = d.dfa.decisionNFAStartState.enclosingRule; in getReportData()
158 if ( d.dfa.hasSynPred() ) dfaWithSynPred++; in getReportData()
172 if ( !d.dfa.isCyclic() ) { in getReportData()
173 if ( d.dfa.isClassicDFA() ) { in getReportData()
174 int maxk = d.dfa.getMaxLookaheadDepth(); in getReportData()
180 acyclicDFAStates[acyclicIndex] = d.dfa.getNumberOfStates(); in getReportData()
187 cyclicDFAStates[cyclicIndex] = d.dfa.getNumberOfStates(); in getReportData()
295 DFA dfa = (DFA) it.next(); in getDFALocations() local
297 if ( decisions.contains(Utils.integer(dfa.decisionNumber)) ) { in getDFALocations()
[all …]
/external/libpng/contrib/conftest/
DREADME1 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/antlr-3.4/tool/src/main/java/org/antlr/codegen/
DACyclicDFACodeGenerator.java45 DFA dfa) in genFixedLookaheadDecision() argument
47 return walkFixedDFAGeneratingStateMachine(templates, dfa, dfa.startState, 1); in genFixedLookaheadDecision()
52 DFA dfa, in walkFixedDFAGeneratingStateMachine() argument
77 if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.LOOPBACK ) { in walkFixedDFAGeneratingStateMachine()
80 else if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.OPTIONAL_BLOCK_START ) { in walkFixedDFAGeneratingStateMachine()
139 dfa); in walkFixedDFAGeneratingStateMachine()
146 dfa, in walkFixedDFAGeneratingStateMachine()
180 dfa, in walkFixedDFAGeneratingStateMachine()
/external/python/cpython2/Include/
Dgrammar.h57 } dfa; typedef
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/
Dgrammar.h57 } 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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/
DCSharp3.stg180 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
185 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
323 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
328 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
722 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
741 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
781 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
819 try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
1236 alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
1253 cyclicDFA(dfa) ::= <<
[all …]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/
DObjC.stg261 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> *dfa<dfa.decisionNumber>;}; separator="\n">
344 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = [DFA<dfa.decisionNumber> newDFA<dfa.decisionNumber>Wi…
352 <cyclicDFAs:{dfa | [dfa<dfa.decisionNumber> release];}; separator="\n">
582 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> *dfa<dfa.decisionNumber>;}; separator="\n">
720 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = [DFA<dfa.decisionNumber> newDFA<dfa.decisionNumber>Wi…
733 <cyclicDFAs:{dfa | [dfa<dfa.decisionNumber> release];}; separator="\n">
1476 alt<decisionNumber> = [dfa<decisionNumber> predict:input];
1480 cyclicDFAInterface(dfa) ::= <<
1481 #pragma mark Cyclic DFA interface start DFA<dfa.decisionNumber>
1482 @interface DFA<dfa.decisionNumber> : ANTLRDFA {
[all …]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/
DCSharp2.stg185 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
190 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
331 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
336 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
360 <grammar.decisions:{d | <d.dfa.hasSynPred>}; wrap="\n", separator=", ">
1257 alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
1274 cyclicDFA(dfa) ::= <<
1275 private class DFA<dfa.decisionNumber> : DFA
1277 private const string DFA<dfa.decisionNumber>_eotS =
1278 "<dfa.javaCompressedEOT; wrap="\"+\n\t\t\"">";
[all …]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
DJavaScript.stg40 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
165 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
937 alt<decisionNumber> = this.dfa<decisionNumber>.predict(this.input);
948 cyclicDFA(dfa) ::= <<
950 DFA<dfa.decisionNumber>_eotS:
951 "<dfa.javaCompressedEOT; wrap="\"+\n \"">",
952 DFA<dfa.decisionNumber>_eofS:
953 "<dfa.javaCompressedEOF; wrap="\"+\n \"">",
954 DFA<dfa.decisionNumber>_minS:
955 "<dfa.javaCompressedMin; wrap="\"+\n \"">",
[all …]
/external/libpng/projects/owatcom/
Dpngconfig.mak9 # 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 …]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
DJava.stg128 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
255 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
1004 alt<decisionNumber> = dfa<decisionNumber>.predict(input);
1015 cyclicDFA(dfa) ::= <<
1016 static final String DFA<dfa.decisionNumber>_eotS =
1017 "<dfa.javaCompressedEOT; wrap="\"+\n \"">";
1018 static final String DFA<dfa.decisionNumber>_eofS =
1019 "<dfa.javaCompressedEOF; wrap="\"+\n \"">";
1020 static final String DFA<dfa.decisionNumber>_minS =
1021 "<dfa.javaCompressedMin; wrap="\"+\n \"">";
[all …]

1234567