ES3Parser.bitwiseANDExpressionNoIn C# (CSharp) Method

    public ES3Parser.bitwiseANDExpressionNoIn_return bitwiseANDExpressionNoIn() // throws RecognitionException [1]
    {   
        ES3Parser.bitwiseANDExpressionNoIn_return retval = new ES3Parser.bitwiseANDExpressionNoIn_return();
        retval.Start = input.LT(1);

        object root_0 = null;

        IToken AND66 = null;
        ES3Parser.equalityExpressionNoIn_return left = default(ES3Parser.equalityExpressionNoIn_return);

        ES3Parser.equalityExpressionNoIn_return right = default(ES3Parser.equalityExpressionNoIn_return);


        object AND66_tree=null;

        try 
    	{
            // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1233:2: (left= equalityExpressionNoIn ( AND right= equalityExpressionNoIn )* )
            // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1233:4: left= equalityExpressionNoIn ( AND right= equalityExpressionNoIn )*
            {
            	root_0 = (object)adaptor.GetNilNode();

            	PushFollow(FOLLOW_equalityExpressionNoIn_in_bitwiseANDExpressionNoIn4515);
            	left = equalityExpressionNoIn();
            	state.followingStackPointer--;

            	adaptor.AddChild(root_0, left.Tree);
            	 retval.value =  left.value; 
            	// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1233:57: ( AND right= equalityExpressionNoIn )*
            	do 
            	{
            	    int alt41 = 2;
            	    int LA41_0 = input.LA(1);

            	    if ( (LA41_0 == AND) )
            	    {
            	        alt41 = 1;
            	    }


            	    switch (alt41) 
            		{
            			case 1 :
            			    // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1233:59: AND right= equalityExpressionNoIn
            			    {
            			    	AND66=(IToken)Match(input,AND,FOLLOW_AND_in_bitwiseANDExpressionNoIn4521); 
            			    		AND66_tree = (object)adaptor.Create(AND66);
            			    		root_0 = (object)adaptor.BecomeRoot(AND66_tree, root_0);

            			    	PushFollow(FOLLOW_equalityExpressionNoIn_in_bitwiseANDExpressionNoIn4526);
            			    	right = equalityExpressionNoIn();
            			    	state.followingStackPointer--;

            			    	adaptor.AddChild(root_0, right.Tree);
            			    	 retval.value =  new BinaryExpression(BinaryExpressionType.BitwiseAnd, retval.value, right.value); 

            			    }
            			    break;

            			default:
            			    goto loop41;
            	    }
            	} while (true);

            	loop41:
            		;	// Stops C# compiler whining that label 'loop41' 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 "bitwiseANDExpressionNoIn"