Home
last modified time | relevance | path

Searched refs:DFAState (Results 1 – 25 of 28) sorted by relevance

12

/external/antlr/tool/src/main/java/org/antlr/analysis/
DDecisionProbe.java82 protected Set<DFAState> statesWithSyntacticallyAmbiguousAltsSet = new HashSet<DFAState>();
89 protected Map<DFAState, Set<Integer>> stateToSyntacticallyAmbiguousTokensRuleAltsMap =
90 new HashMap<DFAState, Set<Integer>>();
96 protected Set<DFAState> statesResolvedWithSemanticPredicatesSet = new HashSet<DFAState>();
103 protected Map<DFAState, Map<Integer,SemanticContext>> stateToAltSetWithSemanticPredicatesMap =
104 new HashMap<DFAState, Map<Integer,SemanticContext>>();
110 protected Map<DFAState,Map<Integer, Set<Token>>> stateToIncompletelyCoveredAltsMap =
111 new HashMap<DFAState,Map<Integer, Set<Token>>>();
114 protected Set<DFAState> danglingStates = new HashSet<DFAState>();
201 for (DFAState d : statesWithSyntacticallyAmbiguousAltsSet) { in isDeterministic()
[all …]
DDFA.java68 public DFAState startState;
86 protected Map<DFAState, DFAState> uniqueStates = new HashMap<DFAState, DFAState>();
99 protected Vector<DFAState> states = new Vector<DFAState>();
146 protected DFAState[] altToAcceptState;
205 public List<DFAState> specialStates;
293 DFAState s = getState(i); in resetStateNumbersToBeContiguous()
401 specialStates = new ArrayList<DFAState>(); // List<DFAState>
419 Iterator<DFAState> it;
427 DFAState s = it.next();
448 DFAState ss = specialStates.get(i);
[all …]
DMachineProbe.java48 List<DFAState> getAnyDFAPathToTarget(DFAState targetState) { in getAnyDFAPathToTarget()
49 Set<DFAState> visited = new HashSet<DFAState>(); in getAnyDFAPathToTarget()
53 public List<DFAState> getAnyDFAPathToTarget(DFAState startState, in getAnyDFAPathToTarget()
54 DFAState targetState, Set<DFAState> visited) { in getAnyDFAPathToTarget()
55 List<DFAState> dfaStates = new ArrayList<DFAState>(); in getAnyDFAPathToTarget()
66 List<DFAState> path = getAnyDFAPathToTarget( in getAnyDFAPathToTarget()
67 (DFAState) e.target, targetState, visited); in getAnyDFAPathToTarget()
79 public List<IntSet> getEdgeLabels(DFAState targetState) { in getEdgeLabels()
80 List<DFAState> dfaStates = getAnyDFAPathToTarget(targetState); in getEdgeLabels()
83 DFAState d = dfaStates.get(i); in getEdgeLabels()
[all …]
DNFAToDFAConverter.java43 protected List<DFAState> work = new LinkedList<DFAState>();
86 DFAState d = work.get(0); in convert()
139 protected DFAState computeStartState() { in computeStartState()
141 DFAState startState = dfa.newState(); in computeStartState()
201 protected void findNewDFAStatesAndAddDFATransitions(DFAState d) { in findNewDFAStatesAndAddDFATransitions()
275 DFAState t = reach(d, label); in findNewDFAStatesAndAddDFATransitions()
306 DFAState targetState = addDFAStateToWorkList(t); in findNewDFAStatesAndAddDFATransitions()
408 protected static int addTransition(DFAState d, in addTransition()
410 DFAState targetState, in addTransition()
457 public void closure(DFAState d) { in closure()
[all …]
DDFAOptimizer.java184 protected void optimizeExitBranches(DFAState d) { in optimizeExitBranches()
193 DFAState edgeTarget = ((DFAState)edge.target); in optimizeExitBranches()
214 protected void optimizeEOTBranches(DFAState d) { in optimizeEOTBranches()
222 DFAState edgeTarget = ((DFAState)edge.target); in optimizeEOTBranches()
DLL1DFA.java54 DFAState s0 = newState(); in LL1DFA()
63 DFAState acceptAltState = newState(); in LL1DFA()
81 DFAState s0 = newState(); in LL1DFA()
94 DFAState s = newState(); in LL1DFA()
111 DFAState predDFATarget = getAcceptState(alt); in LL1DFA()
DAnalysisRecursionOverflowException.java32 public DFAState ovfState;
34 public AnalysisRecursionOverflowException(DFAState ovfState, in AnalysisRecursionOverflowException()
DDFAState.java65 public class DFAState extends State { class
165 public DFAState(DFA dfa) { in DFAState() method in DFAState
194 public int addTransition(DFAState target, Label label) { in addTransition()
419 DFAState other = (DFAState)o; in equals()
/external/skia/src/sksl/lex/
DNFAtoDFA.h43 getState(DFAState::Label({})); in convert()
48 DFAState* start = getState(DFAState::Label(startStates)); in convert()
64 DFAState* getState(DFAState::Label label) { in getState()
68 fStates[label] = std::unique_ptr<DFAState>(new DFAState(id, label)); in getState()
101 void scanState(DFAState* state) { in scanState()
118 DFAState* nextState = this->getState(DFAState::Label(next)); in scanState()
161 std::unordered_map<DFAState::Label, std::unique_ptr<DFAState>> fStates;
DDFAState.h13 struct DFAState { struct
41 DFAState() in DFAState() function
45 DFAState(int id, Label label) in DFAState() argument
49 DFAState(const DFAState& other) = delete;
59 template<> struct hash<DFAState::Label> { argument
60 size_t operator()(const DFAState::Label& s) const {
/external/skqp/src/sksl/lex/
DNFAtoDFA.h43 getState(DFAState::Label({})); in convert()
48 DFAState* start = getState(DFAState::Label(startStates)); in convert()
64 DFAState* getState(DFAState::Label label) { in getState()
68 fStates[label] = std::unique_ptr<DFAState>(new DFAState(id, label)); in getState()
101 void scanState(DFAState* state) { in scanState()
118 DFAState* nextState = this->getState(DFAState::Label(next)); in scanState()
161 std::unordered_map<DFAState::Label, std::unique_ptr<DFAState>> fStates;
DDFAState.h13 struct DFAState { struct
41 DFAState() in DFAState() function
45 DFAState(int id, Label label) in DFAState() function
49 DFAState(const DFAState& other) = delete;
59 template<> struct hash<DFAState::Label> { argument
60 size_t operator()(const DFAState::Label& s) const {
/external/antlr/tool/src/main/java/org/antlr/tool/
DDOTGenerator.java74 if ( startState instanceof DFAState ) { in getDOT()
80 walkCreatingDFADOT(dot, (DFAState)startState); in getDOT()
112 DFAState s) in walkCreatingDFADOT()
139 if ( edge.target instanceof DFAState && in walkCreatingDFADOT()
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) in walkCreatingDFADOT()
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' in walkCreatingDFADOT()
294 if ( !edge.isSemanticPredicate() && target instanceof DFAState ) { in getEdgeLabel()
297 ((DFAState)target).getGatedPredicatesInNFAConfigurations(); in getEdgeLabel()
315 if ( s instanceof DFAState ) { in getStateLabel()
320 if ( s instanceof DFAState ) { in getStateLabel()
[all …]
DGrammarDanglingStateMessage.java30 import org.antlr.analysis.DFAState;
44 public DFAState problemState;
47 DFAState problemState) in GrammarDanglingStateMessage()
DRecursionOverflowMessage.java30 import org.antlr.analysis.DFAState;
44 public DFAState sampleBadState;
50 DFAState sampleBadState, in RecursionOverflowMessage()
DFASerializer.java166 if ( edge.target instanceof DFAState ) { in walkSerializingFA()
169 ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations(); in walkSerializingFA()
206 if ( s instanceof DFAState ) { in getStateString()
207 stateStr = ":s"+n+"=>"+((DFAState)s).getUniquelyPredictedAlt(); in getStateString()
DGrammarInsufficientPredicatesMessage.java30 import org.antlr.analysis.DFAState;
41 public DFAState problemState;
44 DFAState problemState, in GrammarInsufficientPredicatesMessage()
DGrammarNonDeterminismMessage.java30 import org.antlr.analysis.DFAState;
45 public DFAState problemState;
48 DFAState problemState) in GrammarNonDeterminismMessage()
DInterpreter.java398 DFAState s = dfa.startState; in predict()
413 s = (DFAState)t.target; in predict()
423 s = (DFAState)eotTransition.target; in predict()
DErrorManager.java31 import org.antlr.analysis.DFAState;
643 DFAState d) in nondeterminism()
652 DFAState d) in danglingState()
683 DFAState d, in insufficientPredicates()
700 DFAState sampleBadState, in recursionOverflow()
DGrammar.java32 import org.antlr.analysis.DFAState;
1379 for (DFAState s : lookaheadDFA.getUniqueStates().values()) { in createLookaheadDFA()
/external/antlr/tool/src/main/java/org/antlr/codegen/
DACyclicDFACodeGenerator.java54 DFAState s, in walkFixedDFAGeneratingStateMachine()
96 DFAState EOTTarget = null; in walkFixedDFAGeneratingStateMachine()
104 EOTTarget = (DFAState)edge.target; in walkFixedDFAGeneratingStateMachine()
133 DFAState target = (DFAState)edge.target; in walkFixedDFAGeneratingStateMachine()
148 (DFAState)edge.target, in walkFixedDFAGeneratingStateMachine()
182 (DFAState)predEdge.target, in walkFixedDFAGeneratingStateMachine()
DCodeGenerator.java661 public ST generateSpecialState(DFAState s) { in generateSpecialState()
692 DFAState t = (DFAState)edge.target; in generateSpecialState()
740 DFA dfa = ((DFAState)edge.target).dfa; // which DFA are we in in genSemanticPredicateExpr()
1308 protected boolean canGenerateSwitch(DFAState s) { in canGenerateSwitch()
1320 int EOTPredicts = ((DFAState)edge.target).getUniquelyPredictedAlt(); in canGenerateSwitch()
1328 if ( ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations()!=null ) { in canGenerateSwitch()
/external/python/cpython2/Lib/lib2to3/pgen2/
Dpgen.py188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
347 class DFAState(object): class
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
/external/python/cpython3/Lib/lib2to3/pgen2/
Dpgen.py188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
347 class DFAState(object): class
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)

12