| /external/antlr/antlr-3.4/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) {
|
| NFAState.java | 35 public class NFAState extends State {
90 /** Associate this NFAState with the corresponding GrammarAST node
108 public NFAState(NFA nfa) {
130 if ( ((NFAState)e.target).incidentEdgeLabel!=null ) {
133 ((NFAState)e.target).incidentEdgeLabel = e.label;
181 NFAState nfaStart = this;
218 /** What AST node is associated with this NFAState? When you
|
| LL1DFA.java | 51 public LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook) {
75 NFAState decisionStartState,
119 NFAState altLeftEdge = nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt);
120 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
152 protected SemanticContext.Predicate getSynPredForAlt(NFAState decisionStartState,
157 NFAState altLeftEdge =
159 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
|
| DecisionProbe.java | 363 NFAState nfaStart = dfa.getNFADecisionStartState();
367 NFAState s =
373 NFAState altStart = dfa.nfa.grammar.getNFAStateForAltOfDecision(nfaStart,alt);
374 NFAState isolatedAltStart = (NFAState)altStart.transition[0].target;
537 // Map<Map<String target, List<NFAState call sites>>
576 NFAState ruleInvocationState = dfa.nfa.getState(c.state);
579 String targetRule = ((NFAState) ref.target).enclosingRule.name;
811 protected boolean getNFAPath(NFAState s, // starting where?
836 NFAState edgeTarget = (NFAState)t.target
[all...] |
| 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 | 51 NFAState decisionStartState = grammar.getDecisionNFAStartState(decision);
|
| NFAContext.java | 106 public NFAState invokingState;
119 public NFAContext(NFAContext parent, NFAState invokingState) {
|
| NFAToDFAConverter.java | 140 NFAState alt = dfa.decisionNFAStartState;
154 dfa.getNFADecisionStartState().decisionStateType==NFAState.LOOPBACK )
159 closure((NFAState)alt.transition[0].target,
169 closure((NFAState)alt.transition[0].target,
184 alt = (NFAState)alt.transition[1].target;
591 public void closure(NFAState p,
681 NFAState ruleTarget = (NFAState)ref.target;
686 NFAState whichStateInvokedRule = context.invokingState;
689 NFAState continueState = edgeToRule.followState
[all...] |
| DFAOptimizer.java | 161 (decisionType==NFAState.OPTIONAL_BLOCK_START ||
162 decisionType==NFAState.LOOPBACK) )
|
| /external/antlr/antlr-3.4/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...] |
| 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();
369 if ( (s instanceof NFAState) && ((NFAState)s).isDecisionState() ) {
371 ((NFAState)s).getDecisionNumber()
[all...] |
| GrammarUnreachableAltsMessage.java | 31 import org.antlr.analysis.NFAState;
73 NFAState ruleStart =
|
| RandomPhrase.java | 32 import org.antlr.analysis.NFAState;
70 NFAState state = g.getRuleStartState(startRule);
71 NFAState stopState = g.getRuleStopState(startRule);
85 NFAState invokingState = (NFAState)ruleInvocationStack.pop();
106 state = (NFAState)t0.target;
119 NFAState altStartState =
122 state = (NFAState)t.target;
|
| Interpreter.java | 146 NFAState start = grammar.getRuleStartState(startRule);
147 NFAState stop = grammar.getRuleStopState(startRule);
183 NFAState start = grammar.getRuleStartState(startRule);
184 NFAState stop = grammar.getRuleStopState(startRule);
212 NFAState start,
213 NFAState stop,
220 NFAState s = start;
268 NFAState alt;
276 s = (NFAState)alt.transition[0].target;
291 NFAState invokingState = (NFAState)ruleInvocationStack.pop()
[all...] |
| GrammarNonDeterminismMessage.java | 32 import org.antlr.analysis.NFAState;
81 NFAState ruleStart =
93 NFAState nfaStart = probe.dfa.getNFADecisionStartState();
|
| GrammarSanity.java | 30 import org.antlr.analysis.NFAState;
89 protected boolean traceStatesLookingForLeftRecursion(NFAState s,
108 //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
124 traceStatesLookingForLeftRecursion((NFAState)t0.target,
131 NFAState followingState =
142 traceStatesLookingForLeftRecursion((NFAState)t0.target, visitedStates, listOfRecursiveCycles);
150 traceStatesLookingForLeftRecursion((NFAState)t1.target,
|
| CompositeGrammar.java | 30 import org.antlr.analysis.NFAState;
58 protected Set<NFAState> refClosureBusy = new HashSet<NFAState>();
66 * Maps state number to NFAState object.
71 protected Vector<NFAState> numberToStateList = new Vector<NFAState>(1000);
318 public void addState(NFAState state) {
323 public NFAState getState(int s) {
324 return (NFAState)numberToStateList.get(s);
441 " invoking rule: "+((NFAState)refAST.NFAStartState.transition[0].target).enclosingRule)
[all...] |
| GrammarAST.java | 31 import org.antlr.analysis.NFAState;
73 public NFAState NFAStartState = null;
79 public NFAState NFATreeDownState = null;
85 public NFAState followingNFAState = null;
187 public NFAState getNFAStartState() {
191 public void setNFAStartState(NFAState nfaStartState) {
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 174 assert isinstance(start, NFAState)
175 assert isinstance(finish, NFAState)
181 assert isinstance(state, NFAState)
191 for nfastate in state.nfaset:
192 for label, next in nfastate.arcs:
255 aa = NFAState()
256 zz = NFAState()
304 a = NFAState()
305 z = NFAState()
337 class NFAState(object)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 174 assert isinstance(start, NFAState)
175 assert isinstance(finish, NFAState)
181 assert isinstance(state, NFAState)
191 for nfastate in state.nfaset:
192 for label, next in nfastate.arcs:
255 aa = NFAState()
256 zz = NFAState()
304 a = NFAState()
305 z = NFAState()
337 class NFAState(object)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| TreeToNFAConverter.g | 120 protected void addFollowTransition( String ruleName, NFAState following ) {
124 NFAState end = r.stopState;
127 end = (NFAState)end.transition( 1 ).target;
133 NFAState n = factory.newState();
243 NFAState start = thisR.startState;
258 NFAState end = thisR.stopState;
432 NFAState altBlockState = (NFAState)$g.left.transition(0).target;
454 NFAState altBlockState = (NFAState)$g.left.transition(0).target
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 77 if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.LOOPBACK ) {
80 else if ( dfa.getNFADecisionStartState().decisionStateType==NFAState.OPTIONAL_BLOCK_START ) {
|
