// $ANTLR start "skipClause"
// Hql.g:305:1: skipClause : SKIP ( NUM_INT | parameter ) ;
public HqlParser.skipClause_return skipClause() // throws RecognitionException [1]
{
HqlParser.skipClause_return retval = new HqlParser.skipClause_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken SKIP131 = null;
IToken NUM_INT132 = null;
HqlParser.parameter_return parameter133 = default(HqlParser.parameter_return);
IASTNode SKIP131_tree=null;
IASTNode NUM_INT132_tree=null;
try
{
// Hql.g:306:2: ( SKIP ( NUM_INT | parameter ) )
// Hql.g:306:4: SKIP ( NUM_INT | parameter )
{
root_0 = (IASTNode)adaptor.GetNilNode();
SKIP131=(IToken)Match(input,SKIP,FOLLOW_SKIP_in_skipClause1642);
SKIP131_tree = (IASTNode)adaptor.Create(SKIP131);
root_0 = (IASTNode)adaptor.BecomeRoot(SKIP131_tree, root_0);
// Hql.g:306:10: ( NUM_INT | parameter )
int alt41 = 2;
int LA41_0 = input.LA(1);
if ( (LA41_0 == NUM_INT) )
{
alt41 = 1;
}
else if ( ((LA41_0 >= COLON && LA41_0 <= PARAM)) )
{
alt41 = 2;
}
else
{
NoViableAltException nvae_d41s0 =
new NoViableAltException("", 41, 0, input);
throw nvae_d41s0;
}
switch (alt41)
{
case 1 :
// Hql.g:306:11: NUM_INT
{
NUM_INT132=(IToken)Match(input,NUM_INT,FOLLOW_NUM_INT_in_skipClause1646);
NUM_INT132_tree = (IASTNode)adaptor.Create(NUM_INT132);
adaptor.AddChild(root_0, NUM_INT132_tree);
}
break;
case 2 :
// Hql.g:306:21: parameter
{
PushFollow(FOLLOW_parameter_in_skipClause1650);
parameter133 = parameter();
state.followingStackPointer--;
adaptor.AddChild(root_0, parameter133.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 "skipClause"
// Hql.g:305:1: skipClause : SKIP NUM_INT ;
public HqlParser.skipClause_return skipClause() // throws RecognitionException [1]
{
HqlParser.skipClause_return retval = new HqlParser.skipClause_return();
retval.Start = input.LT(1);
IASTNode root_0 = null;
IToken SKIP131 = null;
IToken NUM_INT132 = null;
IASTNode SKIP131_tree=null;
IASTNode NUM_INT132_tree=null;
try
{
// Hql.g:306:2: ( SKIP NUM_INT )
// Hql.g:306:4: SKIP NUM_INT
{
root_0 = (IASTNode)adaptor.GetNilNode();
SKIP131=(IToken)Match(input,SKIP,FOLLOW_SKIP_in_skipClause1642);
SKIP131_tree = (IASTNode)adaptor.Create(SKIP131);
root_0 = (IASTNode)adaptor.BecomeRoot(SKIP131_tree, root_0);
NUM_INT132=(IToken)Match(input,NUM_INT,FOLLOW_NUM_INT_in_skipClause1645);
NUM_INT132_tree = (IASTNode)adaptor.Create(NUM_INT132);
adaptor.AddChild(root_0, NUM_INT132_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;
}
