// $ANTLR start "equalityExpression"
// AS3_ex.g3:2301:1: equalityExpression : relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )* ;
public AS3_exParser.equalityExpression_return equalityExpression() // throws RecognitionException [1]
{
AS3_exParser.equalityExpression_return retval = new AS3_exParser.equalityExpression_return();
retval.Start = input.LT(1);
int equalityExpression_StartIndex = input.Index();
object root_0 = null;
IToken eq = null;
AS3_exParser.relationalExpression_return relationalExpression281 = null;
AS3_exParser.relationalExpression_return relationalExpression282 = null;
object eq_tree=null;
try
{
if ( (state.backtracking > 0) && AlreadyParsedRule(input, 118) )
{
return retval;
}
// AS3_ex.g3:2302:5: ( relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )* )
// AS3_ex.g3:2302:9: relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_relationalExpression_in_equalityExpression11040);
relationalExpression281 = relationalExpression();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpression281.Tree);
// AS3_ex.g3:2302:30: (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )*
do
{
int alt129 = 2;
int LA129_0 = input.LA(1);
if ( ((LA129_0 >= EQ && LA129_0 <= NSAME)) )
{
alt129 = 1;
}
switch (alt129)
{
case 1 :
// AS3_ex.g3:2302:32: eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression
{
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_relationalExpression_in_equalityExpression11058);
relationalExpression282 = relationalExpression();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpression282.Tree);
if ( state.backtracking == 0 )
{
PopIndent();
}
}
break;
default:
goto loop129;
}
} while (true);
loop129:
; // Stops C# compiler whining that label 'loop129' 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, 118, equalityExpression_StartIndex);
}
}
return retval;
}
// $ANTLR start "equalityExpression"
// AS3_ex.g3:3215:1: equalityExpression : relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )* ;
public AS3_exParser.equalityExpression_return equalityExpression() // throws RecognitionException [1]
{
AS3_exParser.equalityExpression_return retval = new AS3_exParser.equalityExpression_return();
retval.Start = input.LT(1);
int equalityExpression_StartIndex = input.Index();
object root_0 = null;
IToken eq = null;
AS3_exParser.relationalExpression_return relationalExpression292 = null;
AS3_exParser.relationalExpression_return relationalExpression293 = null;
object eq_tree=null;
WrapOptions options=mPrinter.getExpressionWrapOptions();
bool pushedWrapInfo=false;
try
{
if ( (state.backtracking > 0) && AlreadyParsedRule(input, 118) )
{
return retval;
}
// AS3_ex.g3:3220:5: ( relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )* )
// AS3_ex.g3:3220:9: relationalExpression (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )*
{
root_0 = (object)adaptor.GetNilNode();
if ( state.backtracking == 0 )
{
pushedWrapInfo=pushWrapInfo(options, true);
}
PushFollow(FOLLOW_relationalExpression_in_equalityExpression12642);
relationalExpression292 = relationalExpression();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpression292.Tree);
// AS3_ex.g3:3221:30: (eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression )*
do
{
int alt136 = 2;
int LA136_0 = input.LA(1);
if ( ((LA136_0 >= EQ && LA136_0 <= NSAME)) )
{
int LA136_2 = input.LA(2);
if ( (synpred270_AS3_ex()) )
{
alt136 = 1;
}
}
switch (alt136)
{
case 1 :
// AS3_ex.g3:3221:32: eq= ( EQ | NEQ | SAME | NSAME ) relationalExpression
{
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_relationalExpression_in_equalityExpression12660);
relationalExpression293 = relationalExpression();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, relationalExpression293.Tree);
if ( state.backtracking == 0 )
{
popIndent();
}
}
break;
default:
goto loop136;
}
} while (true);
loop136:
; // Stops C# compiler whining that label 'loop136' 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, 118, equalityExpression_StartIndex);
}
}
return retval;
}
