NCalcParser.booleanAndExpression C# (CSharp) Method

    public NCalcParser.booleanAndExpression_return booleanAndExpression()
    {
        NCalcParser.booleanAndExpression_return retval = new NCalcParser.booleanAndExpression_return();
        retval.Start = input.LT(1);

        CommonTree root_0 = null;

        IToken set6 = null;
        NCalcParser.bitwiseOrExpression_return left = null;

        NCalcParser.bitwiseOrExpression_return right = null;

        CommonTree set6_tree=null;

        BinaryExpressionType type = BinaryExpressionType.Unknown;

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

                PushFollow(FOLLOW_bitwiseOrExpression_in_booleanAndExpression180);
                left = bitwiseOrExpression();
                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:99:55: ( ( '&&' | 'and' ) right= bitwiseOrExpression )*
                do
                {
                    int alt3 = 2;
                    int LA3_0 = input.LA(1);

                    if ( ((LA3_0 >= 23 && LA3_0 <= 24)) )
                    {
                        alt3 = 1;
                    }

                    switch (alt3)
                    {
                        case 1 :
                            // C:\\Users\\s.ros\\Documents\\Développement\\NCalc\\Grammar\\NCalc.g:100:4: ( '&&' | 'and' ) right= bitwiseOrExpression
                            {
                                set6 = (IToken)input.LT(1);
                                if ( (input.LA(1) >= 23 && input.LA(1) <= 24) )
                                {
                                    input.Consume();
                                    adaptor.AddChild(root_0, (CommonTree)adaptor.Create(set6));
                                    state.errorRecovery = false;
                                }
                                else
                                {
                                    MismatchedSetException mse = new MismatchedSetException(null,input);
                                    throw mse;
                                }

                                 type = BinaryExpressionType.And;
                                PushFollow(FOLLOW_bitwiseOrExpression_in_booleanAndExpression205);
                                right = bitwiseOrExpression();
                                state.followingStackPointer--;

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

                            }
                            break;

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

                loop3:
                    ;	// Stops C# compiler whining that label 'loop3' 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;
    }