public ES3Parser.equalityExpressionNoIn_return equalityExpressionNoIn() // throws RecognitionException [1]
{
ES3Parser.equalityExpressionNoIn_return retval = new ES3Parser.equalityExpressionNoIn_return();
retval.Start = input.LT(1);
object root_0 = null;
IToken EQ61 = null;
IToken NEQ62 = null;
IToken SAME63 = null;
IToken NSAME64 = null;
ES3Parser.relationalExpressionNoIn_return left = default(ES3Parser.relationalExpressionNoIn_return);
ES3Parser.relationalExpressionNoIn_return right = default(ES3Parser.relationalExpressionNoIn_return);
object EQ61_tree=null;
object NEQ62_tree=null;
object SAME63_tree=null;
object NSAME64_tree=null;
BinaryExpressionType type = BinaryExpressionType.Unknown;
try
{
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1216:2: (left= relationalExpressionNoIn ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpressionNoIn )* )
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1216:4: left= relationalExpressionNoIn ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpressionNoIn )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn4410);
left = relationalExpressionNoIn();
state.followingStackPointer--;
adaptor.AddChild(root_0, left.Tree);
retval.value = left.value;
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1216:59: ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpressionNoIn )*
do
{
int alt39 = 2;
int LA39_0 = input.LA(1);
if ( ((LA39_0 >= EQ && LA39_0 <= NSAME)) )
{
alt39 = 1;
}
switch (alt39)
{
case 1 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1217:3: ( EQ | NEQ | SAME | NSAME ) right= relationalExpressionNoIn
{
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1217:3: ( EQ | NEQ | SAME | NSAME )
int alt38 = 4;
switch ( input.LA(1) )
{
case EQ:
{
alt38 = 1;
}
break;
case NEQ:
{
alt38 = 2;
}
break;
case SAME:
{
alt38 = 3;
}
break;
case NSAME:
{
alt38 = 4;
}
break;
default:
NoViableAltException nvae_d38s0 =
new NoViableAltException("", 38, 0, input);
throw nvae_d38s0;
}
switch (alt38)
{
case 1 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1217:5: EQ
{
EQ61=(IToken)Match(input,EQ,FOLLOW_EQ_in_equalityExpressionNoIn4421);
EQ61_tree = (object)adaptor.Create(EQ61);
adaptor.AddChild(root_0, EQ61_tree);
type= BinaryExpressionType.Equal;
}
break;
case 2 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1218:5: NEQ
{
NEQ62=(IToken)Match(input,NEQ,FOLLOW_NEQ_in_equalityExpressionNoIn4429);
NEQ62_tree = (object)adaptor.Create(NEQ62);
adaptor.AddChild(root_0, NEQ62_tree);
type= BinaryExpressionType.NotEqual;
}
break;
case 3 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1219:5: SAME
{
SAME63=(IToken)Match(input,SAME,FOLLOW_SAME_in_equalityExpressionNoIn4437);
SAME63_tree = (object)adaptor.Create(SAME63);
adaptor.AddChild(root_0, SAME63_tree);
type= BinaryExpressionType.Same;
}
break;
case 4 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1220:5: NSAME
{
NSAME64=(IToken)Match(input,NSAME,FOLLOW_NSAME_in_equalityExpressionNoIn4445);
NSAME64_tree = (object)adaptor.Create(NSAME64);
adaptor.AddChild(root_0, NSAME64_tree);
type= BinaryExpressionType.NotSame;
}
break;
}
PushFollow(FOLLOW_relationalExpressionNoIn_in_equalityExpressionNoIn4456);
right = relationalExpressionNoIn();
state.followingStackPointer--;
adaptor.AddChild(root_0, right.Tree);
retval.value = new BinaryExpression(type, retval.value, right.value);
}
break;
default:
goto loop39;
}
} while (true);
loop39:
; // Stops C# compiler whining that label 'loop39' has no statements
}
retval.Stop = input.LT(-1);
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
{
}
return retval;
}
// $ANTLR end "equalityExpressionNoIn"
