// $ANTLR start "logicalAndExpression"
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:367:1: logicalAndExpression : negatedExpression ( AND negatedExpression )* ;
public HqlParser.logicalAndExpression_return logicalAndExpression() // throws RecognitionException [1]
{
HqlParser.logicalAndExpression_return retval = new HqlParser.logicalAndExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken AND146 = null;
HqlParser.negatedExpression_return negatedExpression145 = default(HqlParser.negatedExpression_return);
HqlParser.negatedExpression_return negatedExpression147 = default(HqlParser.negatedExpression_return);
IASTNode AND146_tree=null;
try
{
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:368:2: ( negatedExpression ( AND negatedExpression )* )
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:368:4: negatedExpression ( AND negatedExpression )*
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_negatedExpression_in_logicalAndExpression1826);
negatedExpression145 = negatedExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, negatedExpression145.Tree);
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:368:22: ( AND negatedExpression )*
do
{
int alt46 = 2;
int LA46_0 = input.LA(1);
if ( (LA46_0 == AND) )
{
alt46 = 1;
}
switch (alt46)
{
case 1 :
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:368:24: AND negatedExpression
{
AND146=(IToken)Match(input,AND,FOLLOW_AND_in_logicalAndExpression1830);
AND146_tree = (IASTNode)adaptor.Create(AND146);
root_0 = (IASTNode)adaptor.BecomeRoot(AND146_tree, root_0);
PushFollow(FOLLOW_negatedExpression_in_logicalAndExpression1833);
negatedExpression147 = negatedExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, negatedExpression147.Tree);
}
break;
default:
goto loop46;
}
} while (true);
loop46:
; // Stops C# compiler whining that label 'loop46' 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 "logicalAndExpression"
// Hql.g:385:1: logicalAndExpression : negatedExpression ( AND negatedExpression )* ;
public HqlParser.logicalAndExpression_return logicalAndExpression() // throws RecognitionException [1]
{
HqlParser.logicalAndExpression_return retval = new HqlParser.logicalAndExpression_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken AND159 = null;
HqlParser.negatedExpression_return negatedExpression158 = default(HqlParser.negatedExpression_return);
HqlParser.negatedExpression_return negatedExpression160 = default(HqlParser.negatedExpression_return);
IASTNode AND159_tree=null;
try
{
// Hql.g:386:2: ( negatedExpression ( AND negatedExpression )* )
// Hql.g:386:4: negatedExpression ( AND negatedExpression )*
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_negatedExpression_in_logicalAndExpression1924);
negatedExpression158 = negatedExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, negatedExpression158.Tree);
// Hql.g:386:22: ( AND negatedExpression )*
do
{
int alt52 = 2;
int LA52_0 = input.LA(1);
if ( (LA52_0 == AND) )
{
alt52 = 1;
}
switch (alt52)
{
case 1 :
// Hql.g:386:24: AND negatedExpression
{
AND159=(IToken)Match(input,AND,FOLLOW_AND_in_logicalAndExpression1928);
AND159_tree = (IASTNode)adaptor.Create(AND159);
root_0 = (IASTNode)adaptor.BecomeRoot(AND159_tree, root_0);
PushFollow(FOLLOW_negatedExpression_in_logicalAndExpression1931);
negatedExpression160 = negatedExpression();
state.followingStackPointer--;
adaptor.AddChild(root_0, negatedExpression160.Tree);
}
break;
default:
goto loop52;
}
} while (true);
loop52:
; // Stops C# compiler whining that label 'loop52' 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;
}
