| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| StateCluster.java | 34 public NFAState left;
35 public NFAState right;
37 public StateCluster(NFAState left, NFAState right) {
|
| RuleClosureTransition.java | 43 public NFAState followState;
46 NFAState ruleStart,
47 NFAState followState)
|
| LL1Analyzer.java | 59 protected Set<NFAState> lookBusy = new HashSet<NFAState>();
61 public Map<NFAState, LookaheadSet> FIRSTCache = new HashMap<NFAState, LookaheadSet>();
150 public LookaheadSet FIRST(NFAState s) {
170 public LookaheadSet LOOK(NFAState s) {
196 protected LookaheadSet _FIRST(NFAState s, boolean chaseFollowTransitions) {
200 System.out.println("go to rule "+((NFAState)s.transition[0].target).enclosingRule);
236 tset = FIRSTCache.get((NFAState)transition0.target);
241 tset = _FIRST((NFAState)transition0.target, chaseFollowTransitions)
[all...] |
| NFA.java | 57 public void addState(NFAState state) {
61 public NFAState getState(int s) {
|
| DecisionProbe.java | 356 public List<? extends NFAState> getNFAPathStatesForAlt(int firstAlt,
360 NFAState nfaStart = dfa.getNFADecisionStartState();
361 List<NFAState> path = new LinkedList<NFAState>();
364 NFAState s =
370 NFAState altStart = dfa.nfa.grammar.getNFAStateForAltOfDecision(nfaStart,alt);
371 NFAState isolatedAltStart = (NFAState)altStart.transition[0].target;
533 // Map<Map<String target, List<NFAState call sites>>
534 Map<Integer, Map<String, Set<NFAState>>> altToTargetToCallSitesMap
[all...] |
| NFAState.java | 35 public class NFAState extends State {
90 /** Associate this NFAState with the corresponding GrammarAST node
108 public NFAState(NFA nfa) {
132 if ( ((NFAState)e.target).incidentEdgeLabel!=null ) {
135 ((NFAState)e.target).incidentEdgeLabel = e.label;
184 NFAState nfaStart = this;
221 /** What AST node is associated with this NFAState? When you
|
| LL1DFA.java | 53 public LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook) {
78 NFAState decisionStartState,
122 NFAState altLeftEdge = nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt);
123 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
155 protected SemanticContext.Predicate getSynPredForAlt(NFAState decisionStartState,
160 NFAState altLeftEdge =
162 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
|
| MachineProbe.java | 116 List<Set<NFAState>> nfaStates, List<IntSet> labels) {
119 Set<NFAState> cur = nfaStates.get(i);
120 Set<NFAState> next = nfaStates.get(i + 1);
125 for (NFAState p : cur) {
139 // NFAState set
|
| NFAConversionThread.java | 52 NFAState decisionStartState = grammar.getDecisionNFAStartState(decision);
|
| /external/skia/src/sksl/lex/ |
| NFA.h | 11 #include "NFAState.h"
26 accept.push_back(this->addState(NFAState(++fRegexCount)));
35 int addState(NFAState s) {
49 std::vector<NFAState> fStates;
|
| NFAState.h | 16 struct NFAState {
33 NFAState(Kind kind, std::vector<int> next)
37 NFAState(char c, std::vector<int> next)
42 NFAState(std::vector<int> states)
46 NFAState(bool inverse, std::vector<bool> accepts, std::vector<int> next)
55 NFAState(int token)
|
| NFA.cpp | 17 if (fStates[nextId].fKind != NFAState::kRemapped_Kind) {
33 if (fStates[id].fKind == NFAState::kAccept_Kind) {
|
| RegexNode.cpp | 16 result.push_back(nfa->addState(NFAState(fPayload.fChar, accept)));
38 result.push_back(nfa->addState(NFAState(fPayload.fBool, chars, accept)));
47 result.push_back(nfa->addState(NFAState(NFAState::kDot_Kind, accept)));
59 int id = nfa->addState(NFAState(placeholder));
62 nfa->fStates[id] = NFAState(result);
74 int id = nfa->addState(NFAState(placeholder));
78 nfa->fStates[id] = NFAState(result);
|
| /external/skqp/src/sksl/lex/ |
| NFA.h | 11 #include "NFAState.h"
26 accept.push_back(this->addState(NFAState(++fRegexCount)));
35 int addState(NFAState s) {
49 std::vector<NFAState> fStates;
|
| NFAState.h | 16 struct NFAState {
33 NFAState(Kind kind, std::vector<int> next)
37 NFAState(char c, std::vector<int> next)
42 NFAState(std::vector<int> states)
46 NFAState(bool inverse, std::vector<bool> accepts, std::vector<int> next)
55 NFAState(int token)
|
| NFA.cpp | 17 if (fStates[nextId].fKind != NFAState::kRemapped_Kind) {
33 if (fStates[id].fKind == NFAState::kAccept_Kind) {
|
| RegexNode.cpp | 16 result.push_back(nfa->addState(NFAState(fPayload.fChar, accept)));
38 result.push_back(nfa->addState(NFAState(fPayload.fBool, chars, accept)));
47 result.push_back(nfa->addState(NFAState(NFAState::kDot_Kind, accept)));
59 int id = nfa->addState(NFAState(placeholder));
62 nfa->fStates[id] = NFAState(result);
74 int id = nfa->addState(NFAState(placeholder));
78 nfa->fStates[id] = NFAState(result);
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| NFAFactory.java | 67 public NFAState newState() {
68 NFAState n = new NFAState(nfa);
85 NFAState s = alt.left;
102 NFAState epsilonTarget = (NFAState)t.target;
113 s = (NFAState)t.target;
119 NFAState left = newState();
120 NFAState right = newState();
137 NFAState left = newState()
[all...] |
| Interpreter.java | 128 List<NFAState> visitedStates)
147 Stack<NFAState> ruleInvocationStack = new Stack<NFAState>();
148 NFAState start = grammar.getRuleStartState(startRule);
149 NFAState stop = grammar.getRuleStopState(startRule);
161 List<NFAState> visitedStates)
171 List<NFAState> visitedStates)
184 Stack<NFAState> ruleInvocationStack = new Stack<NFAState>();
185 NFAState start = grammar.getRuleStartState(startRule)
[all...] |
| RecursionOverflowMessage.java | 33 import org.antlr.analysis.NFAState;
47 public Collection<? extends Collection<? extends NFAState>> callSiteStates;
53 Collection<? extends Collection<? extends NFAState>> callSiteStates)
|
| DOTGenerator.java | 187 if ( ((NFAState)s).isDecisionState() ) {
188 GrammarAST n = ((NFAState)s).associatedASTNode;
191 NFAState alt = (NFAState)s;
195 alt = (NFAState)alt.transition[1].target;
270 NFAState decisionState = (NFAState)iter.next();
367 if ( (s instanceof NFAState) && ((NFAState)s).isDecisionState() ) {
369 ((NFAState)s).getDecisionNumber()
[all...] |
| GrammarSanity.java | 30 import org.antlr.analysis.NFAState;
67 Set<NFAState> visitedStates = new HashSet<NFAState>();
89 protected boolean traceStatesLookingForLeftRecursion(NFAState s,
90 Set<NFAState> visitedStates,
108 //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
124 traceStatesLookingForLeftRecursion((NFAState)t0.target,
125 new HashSet<NFAState>(),
131 NFAState followingState =
142 traceStatesLookingForLeftRecursion((NFAState)t0.target, visitedStates, listOfRecursiveCycles)
[all...] |
| GrammarNonDeterminismMessage.java | 33 import org.antlr.analysis.NFAState;
81 NFAState ruleStart =
93 NFAState nfaStart = probe.dfa.getNFADecisionStartState();
104 List<? extends NFAState> path =
|
| RandomPhrase.java | 32 import org.antlr.analysis.NFAState;
71 NFAState state = g.getRuleStartState(startRule);
72 NFAState stopState = g.getRuleStopState(startRule);
74 Stack<NFAState> ruleInvocationStack = new Stack<NFAState>();
86 NFAState invokingState = ruleInvocationStack.pop();
107 state = (NFAState)t0.target;
120 NFAState altStartState =
123 state = (NFAState)t.target;
|
| GrammarUnreachableAltsMessage.java | 31 import org.antlr.analysis.NFAState;
74 NFAState ruleStart =
|
