NCalcParser.bitwiseAndExpression C# (CSharp) Method

    public NCalcParser.bitwiseAndExpression_return bitwiseAndExpression()
    {
        NCalcParser.bitwiseAndExpression_return retval = new NCalcParser.bitwiseAndExpression_return();
        retval.Start = input.LT(1);

        CommonTree root_0 = null;

        IToken char_literal9 = null;
        NCalcParser.equalityExpression_return left = null;

        NCalcParser.equalityExpression_return right = null;

        CommonTree char_literal9_tree=null;

        BinaryExpressionType type = BinaryExpressionType.Unknown;

        try
        {
            // C:\\Users\\s.ros\\Documents\\Développement\\NCalc\\Grammar\\NCalc.g:129:2: (left= equalityExpression ( '&' right= equalityExpression )* )
            // C:\\Users\\s.ros\\Documents\\Développement\\NCalc\\Grammar\\NCalc.g:129:4: left= equalityExpression ( '&' right= equalityExpression )*
            {
                root_0 = (CommonTree)adaptor.GetNilNode();

                PushFollow(FOLLOW_equalityExpression_in_bitwiseAndExpression341);
                left = equalityExpression();
                state.followingStackPointer--;

                adaptor.AddChild(root_0, left.Tree);
                 retval.value =  ((left != null) ? left.value : null);
                // C:\\Users\\s.ros\\Documents\\Développement\\NCalc\\Grammar\\NCalc.g:129:54: ( '&' right= equalityExpression )*
                do
                {
                    int alt6 = 2;
                    int LA6_0 = input.LA(1);

                    if ( (LA6_0 == 27) )
                    {
                        alt6 = 1;
                    }

                    switch (alt6)
                    {
                        case 1 :
                            // C:\\Users\\s.ros\\Documents\\Développement\\NCalc\\Grammar\\NCalc.g:130:4: '&' right= equalityExpression
                            {
                                char_literal9=(IToken)Match(input,27,FOLLOW_27_in_bitwiseAndExpression350);
                                    char_literal9_tree = (CommonTree)adaptor.Create(char_literal9);
                                    adaptor.AddChild(root_0, char_literal9_tree);

                                 type = BinaryExpressionType.BitwiseAnd;
                                PushFollow(FOLLOW_equalityExpression_in_bitwiseAndExpression360);
                                right = equalityExpression();
                                state.followingStackPointer--;

                                adaptor.AddChild(root_0, right.Tree);
                                 retval.value =  new BinaryExpression(type, retval.value, ((right != null) ? right.value : null));

                            }
                            break;

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

                loop6:
                    ;	// Stops C# compiler whining that label 'loop6' has no statements

            }

            retval.Stop = input.LT(-1);

                retval.Tree = (CommonTree)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 = (CommonTree)adaptor.ErrorNode(input, (IToken) retval.Start, input.LT(-1), re);

        }
        finally
        {
        }
        return retval;
    }