// $ANTLR start "equalityExpressionNoIn"
// AS3_ex.g3:2305:1: equalityExpressionNoIn : relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )* ;
public AS3_exParser.equalityExpressionNoIn_return equalityExpressionNoIn() // throws RecognitionException [1]
{
AS3_exParser.equalityExpressionNoIn_return retval = new AS3_exParser.equalityExpressionNoIn_return();
retval.Start = input.LT(1);
int equalityExpressionNoIn_StartIndex = input.Index();
object root_0 = null;
IToken eq = null;
AS3_exParser.relationalExpressionNoIn_return relationalExpressionNoIn283 = null;
AS3_exParser.relationalExpressionNoIn_return relationalExpressionNoIn284 = null;
object eq_tree=null;
try
{
if ( (state.backtracking > 0) && AlreadyParsedRule(input, 119) )
{
return retval;
}
// AS3_ex.g3:2306:5: ( relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )* )
// AS3_ex.g3:2306:9: relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn11085);
relationalExpressionNoIn283 = relationalExpressionNoIn();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpressionNoIn283.Tree);
// AS3_ex.g3:2306:34: (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )*
do
{
int alt130 = 2;
int LA130_0 = input.LA(1);
if ( ((LA130_0 >= EQ && LA130_0 <= NSAME)) )
{
alt130 = 1;
}
switch (alt130)
{
case 1 :
// AS3_ex.g3:2306:36: eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn
{
eq = (IToken)input.LT(1);
if ( (input.LA(1) >= EQ && input.LA(1) <= NSAME) )
{
input.Consume();
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, (object)adaptor.Create(eq));
state.errorRecovery = false;state.failed = false;
}
else
{
if ( state.backtracking > 0 ) {state.failed = true; return retval;}
MismatchedSetException mse = new MismatchedSetException(null,input);
throw mse;
}
if ( state.backtracking == 0 )
{
IndentEmit((CommonToken)eq);
}
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn11104);
relationalExpressionNoIn284 = relationalExpressionNoIn();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpressionNoIn284.Tree);
if ( state.backtracking == 0 )
{
PopIndent();
}
}
break;
default:
goto loop130;
}
} while (true);
loop130:
; // Stops C# compiler whining that label 'loop130' has no statements
}
retval.Stop = input.LT(-1);
if ( state.backtracking==0 )
{ retval.Tree = (object)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, (IToken) retval.Start, (IToken) retval.Stop);}
}
catch (RecognitionException re)
{
ReportError(re);
Recover(input,re);
// Conversion of the second argument necessary, but harmless
retval.Tree = (object)adaptor.ErrorNode(input, (IToken) retval.Start, input.LT(-1), re);
}
finally
{
if ( state.backtracking > 0 )
{
Memoize(input, 119, equalityExpressionNoIn_StartIndex);
}
}
return retval;
}
// $ANTLR start "equalityExpressionNoIn"
// AS3_ex.g3:3225:1: equalityExpressionNoIn : relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )* ;
public AS3_exParser.equalityExpressionNoIn_return equalityExpressionNoIn() // throws RecognitionException [1]
{
AS3_exParser.equalityExpressionNoIn_return retval = new AS3_exParser.equalityExpressionNoIn_return();
retval.Start = input.LT(1);
int equalityExpressionNoIn_StartIndex = input.Index();
object root_0 = null;
IToken eq = null;
AS3_exParser.relationalExpressionNoIn_return relationalExpressionNoIn294 = null;
AS3_exParser.relationalExpressionNoIn_return relationalExpressionNoIn295 = null;
object eq_tree=null;
WrapOptions options=mPrinter.getExpressionWrapOptions();
bool pushedWrapInfo=false;
try
{
if ( (state.backtracking > 0) && AlreadyParsedRule(input, 119) )
{
return retval;
}
// AS3_ex.g3:3230:5: ( relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )* )
// AS3_ex.g3:3230:9: relationalExpressionNoIn (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )*
{
root_0 = (object)adaptor.GetNilNode();
if ( state.backtracking == 0 )
{
pushedWrapInfo=pushWrapInfo(options, true);
}
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn12712);
relationalExpressionNoIn294 = relationalExpressionNoIn();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpressionNoIn294.Tree);
// AS3_ex.g3:3231:34: (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn )*
do
{
int alt137 = 2;
int LA137_0 = input.LA(1);
if ( ((LA137_0 >= EQ && LA137_0 <= NSAME)) )
{
alt137 = 1;
}
switch (alt137)
{
case 1 :
// AS3_ex.g3:3231:36: eq= ( EQ | NEQ | SAME | NSAME ) relationalExpressionNoIn
{
eq = (IToken)input.LT(1);
if ( (input.LA(1) >= EQ && input.LA(1) <= NSAME) )
{
input.Consume();
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, (object)adaptor.Create(eq));
state.errorRecovery = false;state.failed = false;
}
else
{
if ( state.backtracking > 0 ) {state.failed = true; return retval;}
MismatchedSetException mse = new MismatchedSetException(null,input);
throw mse;
}
if ( state.backtracking == 0 )
{
indentEmit(eq, ASPrettyPrinter.Break_Arithmetic_Ops_code);
}
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn12731);
relationalExpressionNoIn295 = relationalExpressionNoIn();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpressionNoIn295.Tree);
if ( state.backtracking == 0 )
{
popIndent();
}
}
break;
default:
goto loop137;
}
} while (true);
loop137:
; // Stops C# compiler whining that label 'loop137' has no statements
if ( state.backtracking == 0 )
{
if (pushedWrapInfo) mPrinter.popWrapContext();
}
}
retval.Stop = input.LT(-1);
if ( state.backtracking==0 )
{ retval.Tree = (object)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, (IToken) retval.Start, (IToken) retval.Stop);}
}
catch (RecognitionException re)
{
ReportError(re);
Recover(input,re);
// Conversion of the second argument necessary, but harmless
retval.Tree = (object)adaptor.ErrorNode(input, (IToken) retval.Start, input.LT(-1), re);
}
finally
{
if ( state.backtracking > 0 )
{
Memoize(input, 119, equalityExpressionNoIn_StartIndex);
}
}
return retval;
}
