// $ANTLR start "mult"
// antlr_temp_dir\\MathExpr.g:82:1: mult : group ( ( MUL | DIV ) group )* ;
public MathExprParser.mult_return mult() // throws RecognitionException [1]
{
MathExprParser.mult_return retval = new MathExprParser.mult_return();
retval.Start = input.LT(1);
object root_0 = null;
IToken set7 = null;
MathExprParser.group_return group6 = default(MathExprParser.group_return);
MathExprParser.group_return group8 = default(MathExprParser.group_return);
object set7_tree=null;
try
{
// antlr_temp_dir\\MathExpr.g:82:5: ( group ( ( MUL | DIV ) group )* )
// antlr_temp_dir\\MathExpr.g:82:7: group ( ( MUL | DIV ) group )*
{
root_0 = (object)adaptor.GetNilNode();
PushFollow(FOLLOW_group_in_mult397);
group6 = group();
state.followingStackPointer--;
adaptor.AddChild(root_0, group6.Tree);
// antlr_temp_dir\\MathExpr.g:82:13: ( ( MUL | DIV ) group )*
do
{
int alt2 = 2;
int LA2_0 = input.LA(1);
if ( ((LA2_0 >= MUL && LA2_0 <= DIV)) )
{
alt2 = 1;
}
switch (alt2)
{
case 1 :
// antlr_temp_dir\\MathExpr.g:82:15: ( MUL | DIV ) group
{
set7=(IToken)input.LT(1);
set7 = (IToken)input.LT(1);
if ( (input.LA(1) >= MUL && input.LA(1) <= DIV) )
{
input.Consume();
root_0 = (object)adaptor.BecomeRoot((object)adaptor.Create(set7), root_0);
state.errorRecovery = false;
}
else
{
MismatchedSetException mse = new MismatchedSetException(null,input);
throw mse;
}
PushFollow(FOLLOW_group_in_mult412);
group8 = group();
state.followingStackPointer--;
adaptor.AddChild(root_0, group8.Tree);
}
break;
default:
goto loop2;
}
} while (true);
loop2:
; // Stops C# compiler whining that label 'loop2' has no statements
}
retval.Stop = input.LT(-1);
retval.Tree = (object)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 = (object)adaptor.ErrorNode(input, (IToken) retval.Start, input.LT(-1), re);
}
finally
{
}
return retval;
}
// $ANTLR start "mult"
// MathExpr.g:101:1: mult : not ( ( MUL | DIV | BIT_AND | INT_DIV | INT_MOD ) not )* ;
public MathExprParser.mult_return mult() // throws RecognitionException [1]
{
MathExprParser.mult_return retval = new MathExprParser.mult_return();
retval.Start = input.LT(1);
int mult_StartIndex = input.Index();
AstNode root_0 = null;
IToken set21 = null;
MathExprParser.not_return not20 = default(MathExprParser.not_return);
MathExprParser.not_return not22 = default(MathExprParser.not_return);
AstNode set21_tree=null;
try
{
if ( (state.backtracking > 0) && AlreadyParsedRule(input, 6) )
{
return retval;
}
// MathExpr.g:101:5: ( not ( ( MUL | DIV | BIT_AND | INT_DIV | INT_MOD ) not )* )
// MathExpr.g:101:8: not ( ( MUL | DIV | BIT_AND | INT_DIV | INT_MOD ) not )*
{
root_0 = (AstNode)adaptor.GetNilNode();
PushFollow(FOLLOW_not_in_mult990);
not20 = not();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, not20.Tree);
// MathExpr.g:101:12: ( ( MUL | DIV | BIT_AND | INT_DIV | INT_MOD ) not )*
do
{
int alt5 = 2;
int LA5_0 = input.LA(1);
if ( ((LA5_0 >= INT_DIV && LA5_0 <= INT_MOD) || (LA5_0 >= MUL && LA5_0 <= BIT_AND)) )
{
alt5 = 1;
}
switch (alt5)
{
case 1 :
// MathExpr.g:101:14: ( MUL | DIV | BIT_AND | INT_DIV | INT_MOD ) not
{
set21=(IToken)input.LT(1);
set21 = (IToken)input.LT(1);
if ( (input.LA(1) >= INT_DIV && input.LA(1) <= INT_MOD) || (input.LA(1) >= MUL && input.LA(1) <= BIT_AND) )
{
input.Consume();
if ( state.backtracking == 0 ) root_0 = (AstNode)adaptor.BecomeRoot((AstNode)adaptor.Create(set21), root_0);
state.errorRecovery = false;state.failed = false;
}
else
{
if ( state.backtracking > 0 ) {state.failed = true; return retval;}
MismatchedSetException mse = new MismatchedSetException(null,input);
throw mse;
}
PushFollow(FOLLOW_not_in_mult1017);
not22 = not();
state.followingStackPointer--;
if (state.failed) return retval;
if ( state.backtracking == 0 ) adaptor.AddChild(root_0, not22.Tree);
}
break;
default:
goto loop5;
}
} while (true);
loop5:
; // Stops C# compiler whining that label 'loop5' has no statements
}
retval.Stop = input.LT(-1);
if ( (state.backtracking==0) )
{ retval.Tree = (AstNode)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 = (AstNode)adaptor.ErrorNode(input, (IToken) retval.Start, input.LT(-1), re);
}
finally
{
if ( state.backtracking > 0 )
{
Memoize(input, 6, mult_StartIndex);
}
}
return retval;
}
