public ES3Parser.bitwiseANDExpression_return bitwiseANDExpression() // throws RecognitionException [1]
{
ES3Parser.bitwiseANDExpression_return retval = new ES3Parser.bitwiseANDExpression_return();
retval.Start = input.LT(1);
object root_0 = null;
IToken AND65 = null;
ES3Parser.equalityExpression_return left = default(ES3Parser.equalityExpression_return);
ES3Parser.equalityExpression_return right = default(ES3Parser.equalityExpression_return);
object AND65_tree=null;
try
{
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1229:2: (left= equalityExpression ( AND right= equalityExpression )* )
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1229:4: left= equalityExpression ( AND right= equalityExpression )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_equalityExpression_in_bitwiseANDExpression4483);
left = equalityExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, left.Tree);
retval.value = left.value;
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1229:53: ( AND right= equalityExpression )*
do
{
int alt40 = 2;
int LA40_0 = input.LA(1);
if ( (LA40_0 == AND) )
{
alt40 = 1;
}
switch (alt40)
{
case 1 :
// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1229:55: AND right= equalityExpression
{
AND65=(IToken)Match(input,AND,FOLLOW_AND_in_bitwiseANDExpression4489);
AND65_tree = (object)adaptor.Create(AND65);
root_0 = (object)adaptor.BecomeRoot(AND65_tree, root_0);
PushFollow(FOLLOW_equalityExpression_in_bitwiseANDExpression4494);
right = equalityExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, right.Tree);
retval.value = new BinaryExpression(BinaryExpressionType.BitwiseAnd, retval.value, right.value);
}
break;
default:
goto loop40;
}
} while (true);
loop40:
; // Stops C# compiler whining that label 'loop40' 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 "bitwiseANDExpression"