// $ANTLR start "betweenList"
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:439:1: betweenList : concatenation AND concatenation ;
public HqlParser.betweenList_return betweenList() // throws RecognitionException [1]
{
HqlParser.betweenList_return retval = new HqlParser.betweenList_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken AND169 = null;
HqlParser.concatenation_return concatenation168 = default(HqlParser.concatenation_return);
HqlParser.concatenation_return concatenation170 = default(HqlParser.concatenation_return);
IASTNode AND169_tree=null;
try
{
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:440:2: ( concatenation AND concatenation )
// /Users/Steve/Projects/NHibernate/Branches/2.1.x/nhibernate/src/NHibernate/Hql/Ast/ANTLR/Hql.g:440:4: concatenation AND concatenation
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_concatenation_in_betweenList2179);
concatenation168 = concatenation();
state.followingStackPointer--;
adaptor.AddChild(root_0, concatenation168.Tree);
AND169=(IToken)Match(input,AND,FOLLOW_AND_in_betweenList2181);
PushFollow(FOLLOW_concatenation_in_betweenList2184);
concatenation170 = concatenation();
state.followingStackPointer--;
adaptor.AddChild(root_0, concatenation170.Tree);
}
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 "betweenList"
// Hql.g:457:1: betweenList : concatenation AND concatenation ;
public HqlParser.betweenList_return betweenList() // throws RecognitionException [1]
{
HqlParser.betweenList_return retval = new HqlParser.betweenList_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken AND182 = null;
HqlParser.concatenation_return concatenation181 = default(HqlParser.concatenation_return);
HqlParser.concatenation_return concatenation183 = default(HqlParser.concatenation_return);
IASTNode AND182_tree=null;
try
{
// Hql.g:458:2: ( concatenation AND concatenation )
// Hql.g:458:4: concatenation AND concatenation
{
root_0 = (IASTNode)adaptor.GetNilNode();
PushFollow(FOLLOW_concatenation_in_betweenList2277);
concatenation181 = concatenation();
state.followingStackPointer--;
adaptor.AddChild(root_0, concatenation181.Tree);
AND182=(IToken)Match(input,AND,FOLLOW_AND_in_betweenList2279);
PushFollow(FOLLOW_concatenation_in_betweenList2282);
concatenation183 = concatenation();
state.followingStackPointer--;
adaptor.AddChild(root_0, concatenation183.Tree);
}
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;
}
