// $ANTLR start "bitwiseXOrExpression"
    // /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:472:1: bitwiseXOrExpression : bitwiseAndExpression ( BXOR bitwiseAndExpression )* ;
    public HqlParser.bitwiseXOrExpression_return bitwiseXOrExpression() // throws RecognitionException [1]
    {   
        HqlParser.bitwiseXOrExpression_return retval = new HqlParser.bitwiseXOrExpression_return();
        retval.Start = input.LT(1);

        IASTNode root_0 = null;

        IToken BXOR181 = null;
        HqlParser.bitwiseAndExpression_return bitwiseAndExpression180 = default(HqlParser.bitwiseAndExpression_return);

        HqlParser.bitwiseAndExpression_return bitwiseAndExpression182 = default(HqlParser.bitwiseAndExpression_return);


        IASTNode BXOR181_tree=null;

        try 
    	{
            // /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:473:2: ( bitwiseAndExpression ( BXOR bitwiseAndExpression )* )
            // /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:473:4: bitwiseAndExpression ( BXOR bitwiseAndExpression )*
            {
            	root_0 = (IASTNode)adaptor.GetNilNode();

            	PushFollow(FOLLOW_bitwiseAndExpression_in_bitwiseXOrExpression2295);
            	bitwiseAndExpression180 = bitwiseAndExpression();
            	state.followingStackPointer--;

            	adaptor.AddChild(root_0, bitwiseAndExpression180.Tree);
            	// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:473:25: ( BXOR bitwiseAndExpression )*
            	do 
            	{
            	    int alt62 = 2;
            	    int LA62_0 = input.LA(1);

            	    if ( (LA62_0 == BXOR) )
            	    {
            	        alt62 = 1;
            	    }


            	    switch (alt62) 
            		{
            			case 1 :
            			    // /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:473:26: BXOR bitwiseAndExpression
            			    {
            			    	BXOR181=(IToken)Match(input,BXOR,FOLLOW_BXOR_in_bitwiseXOrExpression2298); 
            			    		BXOR181_tree = (IASTNode)adaptor.Create(BXOR181);
            			    		root_0 = (IASTNode)adaptor.BecomeRoot(BXOR181_tree, root_0);

            			    	PushFollow(FOLLOW_bitwiseAndExpression_in_bitwiseXOrExpression2301);
            			    	bitwiseAndExpression182 = bitwiseAndExpression();
            			    	state.followingStackPointer--;

            			    	adaptor.AddChild(root_0, bitwiseAndExpression182.Tree);

            			    }
            			    break;

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

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


            }

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

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

        }
        finally 
    	{
        }
        return retval;
    }
    // $ANTLR start "bitwiseXOrExpression"
    // Hql.g:490:1: bitwiseXOrExpression : bitwiseAndExpression ( BXOR bitwiseAndExpression )* ;
    public HqlParser.bitwiseXOrExpression_return bitwiseXOrExpression() // throws RecognitionException [1]
    {   
        HqlParser.bitwiseXOrExpression_return retval = new HqlParser.bitwiseXOrExpression_return();
        retval.Start = input.LT(1);

        IASTNode root_0 = null;

        IToken BXOR194 = null;
        HqlParser.bitwiseAndExpression_return bitwiseAndExpression193 = default(HqlParser.bitwiseAndExpression_return);

        HqlParser.bitwiseAndExpression_return bitwiseAndExpression195 = default(HqlParser.bitwiseAndExpression_return);


        IASTNode BXOR194_tree=null;

        try 
    	{
            // Hql.g:491:2: ( bitwiseAndExpression ( BXOR bitwiseAndExpression )* )
            // Hql.g:491:4: bitwiseAndExpression ( BXOR bitwiseAndExpression )*
            {
            	root_0 = (IASTNode)adaptor.GetNilNode();

            	PushFollow(FOLLOW_bitwiseAndExpression_in_bitwiseXOrExpression2393);
            	bitwiseAndExpression193 = bitwiseAndExpression();
            	state.followingStackPointer--;

            	adaptor.AddChild(root_0, bitwiseAndExpression193.Tree);
            	// Hql.g:491:25: ( BXOR bitwiseAndExpression )*
            	do 
            	{
            	    int alt68 = 2;
            	    int LA68_0 = input.LA(1);

            	    if ( (LA68_0 == BXOR) )
            	    {
            	        alt68 = 1;
            	    }


            	    switch (alt68) 
            		{
            			case 1 :
            			    // Hql.g:491:26: BXOR bitwiseAndExpression
            			    {
            			    	BXOR194=(IToken)Match(input,BXOR,FOLLOW_BXOR_in_bitwiseXOrExpression2396); 
            			    		BXOR194_tree = (IASTNode)adaptor.Create(BXOR194);
            			    		root_0 = (IASTNode)adaptor.BecomeRoot(BXOR194_tree, root_0);

            			    	PushFollow(FOLLOW_bitwiseAndExpression_in_bitwiseXOrExpression2399);
            			    	bitwiseAndExpression195 = bitwiseAndExpression();
            			    	state.followingStackPointer--;

            			    	adaptor.AddChild(root_0, bitwiseAndExpression195.Tree);

            			    }
            			    break;

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

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


            }

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

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

        }
        finally 
    	{
        }
        return retval;
    }