public ES3Parser.equalityExpression_return equalityExpression() // throws RecognitionException [1]
{
ES3Parser.equalityExpression_return retval = new ES3Parser.equalityExpression_return();
retval.Start = input.LT(1);
object root_0 = null;
IToken EQ57 = null;
IToken NEQ58 = null;
IToken SAME59 = null;
IToken NSAME60 = null;
ES3Parser.relationalExpression_return left = default(ES3Parser.relationalExpression_return);
ES3Parser.relationalExpression_return right = default(ES3Parser.relationalExpression_return);
object EQ57_tree=null;
object NEQ58_tree=null;
object SAME59_tree=null;
object NSAME60_tree=null;
BinaryExpressionType type = BinaryExpressionType.Unknown;
try
{
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1204:2: (left= relationalExpression ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpression )* )
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1204:4: left= relationalExpression ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpression )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_relationalExpression_in_equalityExpression4338);
left = relationalExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, left.Tree);
retval.value = left.value;
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1204:55: ( ( EQ | NEQ | SAME | NSAME ) right= relationalExpression )*
do
{
int alt37 = 2;
int LA37_0 = input.LA(1);
if ( ((LA37_0 >= EQ && LA37_0 <= NSAME)) )
{
alt37 = 1;
}
switch (alt37)
{
case 1 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1205:3: ( EQ | NEQ | SAME | NSAME ) right= relationalExpression
{
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1205:3: ( EQ | NEQ | SAME | NSAME )
int alt36 = 4;
switch ( input.LA(1) )
{
case EQ:
{
alt36 = 1;
}
break;
case NEQ:
{
alt36 = 2;
}
break;
case SAME:
{
alt36 = 3;
}
break;
case NSAME:
{
alt36 = 4;
}
break;
default:
NoViableAltException nvae_d36s0 =
new NoViableAltException("", 36, 0, input);
throw nvae_d36s0;
}
switch (alt36)
{
case 1 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1205:5: EQ
{
EQ57=(IToken)Match(input,EQ,FOLLOW_EQ_in_equalityExpression4349);
EQ57_tree = (object)adaptor.Create(EQ57);
adaptor.AddChild(root_0, EQ57_tree);
type= BinaryExpressionType.Equal;
}
break;
case 2 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1206:5: NEQ
{
NEQ58=(IToken)Match(input,NEQ,FOLLOW_NEQ_in_equalityExpression4357);
NEQ58_tree = (object)adaptor.Create(NEQ58);
adaptor.AddChild(root_0, NEQ58_tree);
type= BinaryExpressionType.NotEqual;
}
break;
case 3 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1207:5: SAME
{
SAME59=(IToken)Match(input,SAME,FOLLOW_SAME_in_equalityExpression4365);
SAME59_tree = (object)adaptor.Create(SAME59);
adaptor.AddChild(root_0, SAME59_tree);
type= BinaryExpressionType.Same;
}
break;
case 4 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1208:5: NSAME
{
NSAME60=(IToken)Match(input,NSAME,FOLLOW_NSAME_in_equalityExpression4373);
NSAME60_tree = (object)adaptor.Create(NSAME60);
adaptor.AddChild(root_0, NSAME60_tree);
type= BinaryExpressionType.NotSame;
}
break;
}
PushFollow(FOLLOW_relationalExpression_in_equalityExpression4384);
right = relationalExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, right.Tree);
retval.value = new BinaryExpression(type, retval.value, right.value);
}
break;
default:
goto loop37;
}
} while (true);
loop37:
; // Stops C# compiler whining that label 'loop37' 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 "equalityExpression"
