Searched defs:alt (Results 1 - 25 of 91) sorted by path

1234

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jar ... .analysis.NFAState s int a int firstAlt int alt java.util.List labels org.antlr. ...
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3debughandlers.c57 static void enterAlt (pANTLR3_DEBUG_EVENT_LISTENER delboy, int alt);
559 enterAlt (pANTLR3_DEBUG_EVENT_LISTENER delboy, int alt) argument
565 sprintf(buffer, "enterAlt\t%d\n", alt);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DBlankDebugEventListener.cs59 public virtual void EnterAlt(int alt) { argument
H A DDebugEventHub.cs86 public virtual void EnterAlt(int alt) { argument
89 listener.EnterAlt(alt);
H A DDebugEventRepeater.cs62 public virtual void EnterAlt(int alt) { argument
63 _listener.EnterAlt(alt);
H A DDebugEventSocketProxy.cs157 public override void EnterAlt(int alt) { argument
158 Transmit("enterAlt\t" + alt);
H A DIDebugEventListener.cs51 * which alt is predicted. This is fired AFTER init actions have been
61 * know which alt you are entering. This is 1..n for n alts.
64 void EnterAlt(int alt); argument
172 * If no viable alt occurs it is within an enter/exit decision, which
192 * The sequence for this rule (with no viable alt in the subrule) for
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DBaseRecognizer.cs414 * When you find a "no viable alt exception", the input is not
559 // Why would we ever want them all? Maybe no viable alt instead of
990 protected virtual void DebugEnterAlt(int alt) { argument
993 dbg.EnterAlt(alt);
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
H A DBaseRecognizer.cs484 * When you find a "no viable alt exception", the input is not
631 // Why would we ever want them all? Maybe no viable alt instead of
1120 protected virtual void DebugEnterAlt(int alt) argument
1124 dbg.EnterAlt(alt);
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/
H A DBlankDebugEventListener.java40 public void enterAlt(int alt) {} argument
H A DDebugEventHub.java84 public void enterAlt(int alt) { argument
87 listener.enterAlt(alt);
H A DDebugEventListener.java51 * which alt is predicted. This is fired AFTER init actions have been
59 * know which alt you are entering. This is 1..n for n alts.
61 public void enterAlt(int alt); argument
146 * If no viable alt occurs it is within an enter/exit decision, which
166 * The sequence for this rule (with no viable alt in the subrule) for
H A DDebugEventRepeater.java51 public void enterAlt(int alt) { listener.enterAlt(alt); } argument
H A DDebugEventSocketProxy.java125 public void enterAlt(int alt) { argument
126 transmit("enterAlt\t"+alt);
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFA.java55 * of states per alt in a single decision's DFA.
132 /** Each alt in an NFA derived from a grammar must have a DFA state that
145 /** We only want one accept state per predicted alt; track here */
148 /** Track whether an alt discovers recursion for each alt during
149 * NFA to DFA conversion; >1 alt with recursion implies nonregular.
262 // >1 alt recurses, k=* and no auto backtrack nor manual sem/syn
889 /** Return a list of Integer alt numbers for which no lookahead could
924 * TODO: I call getUniquelyPredicatedAlt too much; cache predicted alt
930 // this alt i
1005 getAcceptState(int alt) argument
1009 setAcceptState(int alt, DFAState acceptState) argument
[all...]
H A DDFAState.java47 * NFA could be in. We need to track the alt predicted by each
70 * context trees for an alt.
108 /** If we detect recursion on more than one alt, decision is non-LL(*),
137 /** The set of NFA configurations (state,alt,context) for this DFA state */
145 * hence looping forever. Sensitive to the NFA state, the alt, and
205 * an NFA state/alt/syntactic&semantic context (chain of invoking state(s)
209 * state|alt|synCtx and different semantic contexts because the
228 // track min alt rather than compute later
229 if ( c.alt < minAltInConfigurations ) {
230 minAltInConfigurations = c.alt;
259 addNFAConfiguration(NFAState state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DDecisionProbe.java98 /** Track the predicates for each alt per DFA state;
99 * more than one DFA state might have syntactically ambig alt prediction.
100 * Maps DFA state to another map, mapping alt number to a
108 * whole alt uncovered. This maps DFA state to the set of alts
121 /** If decision with > 1 alt has recursion in > 1 alt, it's (likely) nonregular
225 /** Found recursion in > 1 alt */
282 * that for this DFA state, that alt is disabled. There may be other
283 * accept states for that alt that make an alt reachabl
359 getNFAPathStatesForAlt(int firstAlt, int alt, List labels) argument
390 getSemanticContextForAlt(DFAState d, int alt) argument
900 getTokenNameForTokensRuleAlt(int alt) argument
[all...]
H A DLL1DFA.java42 /** From list of lookahead sets (one per alt in decision), create
60 for (int alt=1; alt<altLook.length; alt++) {
63 setAcceptState(alt, acceptAltState);
65 acceptAltState.cachedUniquelyPredicatedAlt = alt;
66 Label e = getLabelForSet(altLook[alt].tokenTypeSet);
97 int alt = alts.get(0);
98 setAcceptState(alt, s);
99 s.cachedUniquelyPredicatedAlt = alt;
152 getSynPredForAlt(NFAState decisionStartState, int alt) argument
[all...]
H A DNFAConfiguration.java32 /** An NFA state, predicted alt, and syntactic/semantic context.
42 /** What alt is predicted by this configuration */
43 public int alt; field in class:NFAConfiguration
63 * other configuration associated with alt 3).
90 int alt,
95 this.alt = alt;
103 * the state|alt|ctx could be the same and have two different
113 this.alt==other.alt
89 NFAConfiguration(int state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DNFAToDFAConverter.java122 * Walk each alt in decision and compute closure from the start of that
124 * that same decision. The idea is to associate a specific alt number
125 * with the starting closure so we can trace the alt number for all states
126 * derived from this. At a stop state in the DFA, we can return this alt
127 * number, indicating which alt is predicted.
131 * this alternative one, let's make this alt n+1 where n is the number of
140 NFAState alt = dfa.decisionNFAStartState;
145 while ( alt!=null ) {
147 // any input symbols for each alt. Keep adding to same
149 // but track the alt numbe
591 closure(NFAState p, int alt, NFAContext context, SemanticContext semanticContext, DFAState d, boolean collectPredicates) argument
985 convertToAcceptState(DFAState d, int alt) argument
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DErrorManager.java191 public static final int MSG_UNREACHABLE_ALTS = 201; // nothing predicts alt i
633 // we've seen this decision and this alt set; never again
674 int alt,
679 Message msg = new RecursionOverflowMessage(probe,sampleBadState, alt,
688 int alt,
693 Message msg = new LeftRecursionMessage(probe, alt, targetRules, callSiteStates);
672 recursionOverflow(DecisionProbe probe, DFAState sampleBadState, int alt, Collection targetRules, Collection callSiteStates) argument
H A DGrammar.java840 * If in filter mode, we want every alt to backtrack and we need to
1140 // compute lookahead for each alt
1143 for (int alt = 1; alt <= numAlts; alt++) {
1145 decisionStartState.translateDisplayAltToWalkAlt(alt);
1148 //System.out.println("alt "+alt+" start state = "+altStartState.stateNumber);
1149 altLook[alt] = ll1Analyzer.LOOK(altStartState);
1150 //System.out.println("alt "
3063 getNFAStateForAltOfDecision(NFAState decisionState, int alt) argument
[all...]
H A DGrammarSerializerFoo.java42 * alt ::= A<elems>;
122 public void alt(GrammarAST alt) { argument
H A DLeftRecursiveRuleAnalyzer.java61 public void setTokenPrec(GrammarAST t, int alt) { argument
63 tokenToPrec.put(ttype, alt);
77 if ( altAssociativity.get(alt)!=null && altAssociativity.get(alt)!=assoc ) {
78 ErrorManager.error(ErrorManager.MSG_ALL_OPS_NEED_SAME_ASSOC, alt);
80 altAssociativity.put(alt, assoc);
82 //System.out.println("op " + alt + ": " + t.getText()+", assoc="+assoc);
86 public void binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) { argument
94 int nextPrec = nextPrecedence(alt);
102 altText += "{}"; // add empty alt t
113 ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
138 prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
164 suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
180 otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
310 precedence(int alt) argument
314 nextPrecedence(int alt) argument
[all...]
H A DNFAFactory.java84 public void optimizeAlternative(StateCluster alt) { argument
85 NFAState s = alt.left;
86 while ( s!=alt.right ) {
101 // point at the last node of the alt. Don't collapse action edges
134 * what an alt block looks like, must have extra state on left.
231 * TODO add to codegen: collapse alt blks that are sets into single matchSet
357 // single alt, no decision, just return only alt state cluster
375 * and every alt right side points at a block end NFAState. There is a
376 * new NFAState in the NFAState in the StateCluster for each alt plu
[all...]

Completed in 6562 milliseconds

1234