// $ANTLR start "bitwiseNotExpression"
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:463:1: bitwiseNotExpression : ( ( BNOT bitwiseOrExpression ) | bitwiseOrExpression );
public HqlParser.bitwiseNotExpression_return bitwiseNotExpression() // throws RecognitionException [1]
{
HqlParser.bitwiseNotExpression_return retval = new HqlParser.bitwiseNotExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken BNOT174 = null;
HqlParser.bitwiseOrExpression_return bitwiseOrExpression175 = default(HqlParser.bitwiseOrExpression_return);
HqlParser.bitwiseOrExpression_return bitwiseOrExpression176 = default(HqlParser.bitwiseOrExpression_return);
IASTNode BNOT174_tree=null;
try
{
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:464:2: ( ( BNOT bitwiseOrExpression ) | bitwiseOrExpression )
int alt60 = 2;
int LA60_0 = input.LA(1);
if ( (LA60_0 == BNOT) )
{
alt60 = 1;
}
else if ( ((LA60_0 >= ALL && LA60_0 <= ANY) || LA60_0 == AVG || LA60_0 == COUNT || LA60_0 == ELEMENTS || (LA60_0 >= EXISTS && LA60_0 <= FALSE) || LA60_0 == INDICES || (LA60_0 >= MAX && LA60_0 <= MIN) || LA60_0 == NULL || (LA60_0 >= SOME && LA60_0 <= TRUE) || LA60_0 == CASE || LA60_0 == EMPTY || (LA60_0 >= NUM_INT && LA60_0 <= NUM_LONG) || LA60_0 == OPEN || (LA60_0 >= PLUS && LA60_0 <= MINUS) || (LA60_0 >= COLON && LA60_0 <= IDENT)) )
{
alt60 = 2;
}
else
{
NoViableAltException nvae_d60s0 =
new NoViableAltException("", 60, 0, input);
throw nvae_d60s0;
}
switch (alt60)
{
case 1 :
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:464:4: ( BNOT bitwiseOrExpression )
{
root_0 = (IASTNode)adaptor.GetNilNode();
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:464:4: ( BNOT bitwiseOrExpression )
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:464:5: BNOT bitwiseOrExpression
{
BNOT174=(IToken)Match(input,BNOT,FOLLOW_BNOT_in_bitwiseNotExpression2254);
BNOT174_tree = (IASTNode)adaptor.Create(BNOT174);
root_0 = (IASTNode)adaptor.BecomeRoot(BNOT174_tree, root_0);
PushFollow(FOLLOW_bitwiseOrExpression_in_bitwiseNotExpression2257);
bitwiseOrExpression175 = bitwiseOrExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, bitwiseOrExpression175.Tree);
}
}
break;
case 2 :
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:465:4: bitwiseOrExpression
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_bitwiseOrExpression_in_bitwiseNotExpression2263);
bitwiseOrExpression176 = bitwiseOrExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, bitwiseOrExpression176.Tree);
}
break;
}
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 "bitwiseNotExpression"
// Hql.g:481:1: bitwiseNotExpression : ( ( BNOT bitwiseOrExpression ) | bitwiseOrExpression );
public HqlParser.bitwiseNotExpression_return bitwiseNotExpression() // throws RecognitionException [1]
{
HqlParser.bitwiseNotExpression_return retval = new HqlParser.bitwiseNotExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken BNOT187 = null;
HqlParser.bitwiseOrExpression_return bitwiseOrExpression188 = default(HqlParser.bitwiseOrExpression_return);
HqlParser.bitwiseOrExpression_return bitwiseOrExpression189 = default(HqlParser.bitwiseOrExpression_return);
IASTNode BNOT187_tree=null;
try
{
// Hql.g:482:2: ( ( BNOT bitwiseOrExpression ) | bitwiseOrExpression )
int alt66 = 2;
int LA66_0 = input.LA(1);
if ( (LA66_0 == BNOT) )
{
alt66 = 1;
}
else if ( ((LA66_0 >= ALL && LA66_0 <= ANY) || LA66_0 == AVG || LA66_0 == COUNT || LA66_0 == ELEMENTS || (LA66_0 >= EXISTS && LA66_0 <= FALSE) || LA66_0 == INDICES || (LA66_0 >= MAX && LA66_0 <= MIN) || LA66_0 == NULL || (LA66_0 >= SOME && LA66_0 <= SUM) || LA66_0 == TRUE || LA66_0 == CASE || LA66_0 == EMPTY || (LA66_0 >= NUM_INT && LA66_0 <= NUM_LONG) || LA66_0 == OPEN || (LA66_0 >= COLON && LA66_0 <= PARAM) || (LA66_0 >= PLUS && LA66_0 <= MINUS) || (LA66_0 >= QUOTED_String && LA66_0 <= IDENT)) )
{
alt66 = 2;
}
else
{
NoViableAltException nvae_d66s0 =
new NoViableAltException("", 66, 0, input);
throw nvae_d66s0;
}
switch (alt66)
{
case 1 :
// Hql.g:482:4: ( BNOT bitwiseOrExpression )
{
root_0 = (IASTNode)adaptor.GetNilNode();
// Hql.g:482:4: ( BNOT bitwiseOrExpression )
// Hql.g:482:5: BNOT bitwiseOrExpression
{
BNOT187=(IToken)Match(input,BNOT,FOLLOW_BNOT_in_bitwiseNotExpression2352);
BNOT187_tree = (IASTNode)adaptor.Create(BNOT187);
root_0 = (IASTNode)adaptor.BecomeRoot(BNOT187_tree, root_0);
PushFollow(FOLLOW_bitwiseOrExpression_in_bitwiseNotExpression2355);
bitwiseOrExpression188 = bitwiseOrExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, bitwiseOrExpression188.Tree);
}
}
break;
case 2 :
// Hql.g:483:4: bitwiseOrExpression
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_bitwiseOrExpression_in_bitwiseNotExpression2361);
bitwiseOrExpression189 = bitwiseOrExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, bitwiseOrExpression189.Tree);
}
break;
}
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;
}
