// $ANTLR start "bitwiseAndExpression"
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:476:1: bitwiseAndExpression : additiveExpression ( BAND additiveExpression )* ;
public HqlParser.bitwiseAndExpression_return bitwiseAndExpression() // throws RecognitionException [1]
{
HqlParser.bitwiseAndExpression_return retval = new HqlParser.bitwiseAndExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken BAND184 = null;
HqlParser.additiveExpression_return additiveExpression183 = default(HqlParser.additiveExpression_return);
HqlParser.additiveExpression_return additiveExpression185 = default(HqlParser.additiveExpression_return);
IASTNode BAND184_tree=null;
try
{
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:477:2: ( additiveExpression ( BAND additiveExpression )* )
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:477:4: additiveExpression ( BAND additiveExpression )*
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_additiveExpression_in_bitwiseAndExpression2315);
additiveExpression183 = additiveExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, additiveExpression183.Tree);
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:477:23: ( BAND additiveExpression )*
do
{
int alt63 = 2;
int LA63_0 = input.LA(1);
if ( (LA63_0 == BAND) )
{
alt63 = 1;
}
switch (alt63)
{
case 1 :
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:477:24: BAND additiveExpression
{
BAND184=(IToken)Match(input,BAND,FOLLOW_BAND_in_bitwiseAndExpression2318);
BAND184_tree = (IASTNode)adaptor.Create(BAND184);
root_0 = (IASTNode)adaptor.BecomeRoot(BAND184_tree, root_0);
PushFollow(FOLLOW_additiveExpression_in_bitwiseAndExpression2321);
additiveExpression185 = additiveExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, additiveExpression185.Tree);
}
break;
default:
goto loop63;
}
} while (true);
loop63:
; // Stops C# compiler whining that label 'loop63' 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 "bitwiseAndExpression"
// Hql.g:494:1: bitwiseAndExpression : additiveExpression ( BAND additiveExpression )* ;
public HqlParser.bitwiseAndExpression_return bitwiseAndExpression() // throws RecognitionException [1]
{
HqlParser.bitwiseAndExpression_return retval = new HqlParser.bitwiseAndExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken BAND197 = null;
HqlParser.additiveExpression_return additiveExpression196 = default(HqlParser.additiveExpression_return);
HqlParser.additiveExpression_return additiveExpression198 = default(HqlParser.additiveExpression_return);
IASTNode BAND197_tree=null;
try
{
// Hql.g:495:2: ( additiveExpression ( BAND additiveExpression )* )
// Hql.g:495:4: additiveExpression ( BAND additiveExpression )*
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_additiveExpression_in_bitwiseAndExpression2413);
additiveExpression196 = additiveExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, additiveExpression196.Tree);
// Hql.g:495:23: ( BAND additiveExpression )*
do
{
int alt69 = 2;
int LA69_0 = input.LA(1);
if ( (LA69_0 == BAND) )
{
alt69 = 1;
}
switch (alt69)
{
case 1 :
// Hql.g:495:24: BAND additiveExpression
{
BAND197=(IToken)Match(input,BAND,FOLLOW_BAND_in_bitwiseAndExpression2416);
BAND197_tree = (IASTNode)adaptor.Create(BAND197);
root_0 = (IASTNode)adaptor.BecomeRoot(BAND197_tree, root_0);
PushFollow(FOLLOW_additiveExpression_in_bitwiseAndExpression2419);
additiveExpression198 = additiveExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, additiveExpression198.Tree);
}
break;
default:
goto loop69;
}
} while (true);
loop69:
; // Stops C# compiler whining that label 'loop69' 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;
}