// $ANTLR start "additiveExpression" // AS3_ex.g3:2365:1: additiveExpression : multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* ; public AS3_exParser.additiveExpression_return additiveExpression() // throws RecognitionException [1] { AS3_exParser.additiveExpression_return retval = new AS3_exParser.additiveExpression_return(); retval.Start = input.LT(1); int additiveExpression_StartIndex = input.Index(); object root_0 = null; IToken op = null; AS3_exParser.multiplicativeExpression_return multiplicativeExpression291 = null; AS3_exParser.multiplicativeExpression_return multiplicativeExpression292 = null; object op_tree=null; try { if ( (state.backtracking > 0) && AlreadyParsedRule(input, 123) ) { return retval; } // AS3_ex.g3:2366:5: ( multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* ) // AS3_ex.g3:2366:9: multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* { root_0 = (object)adaptor.GetNilNode(); PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression11575); multiplicativeExpression291 = multiplicativeExpression(); state.followingStackPointer--; if (state.failed) return retval; if ( state.backtracking == 0 ) adaptor.AddChild(root_0, multiplicativeExpression291.Tree); // AS3_ex.g3:2366:34: (op= ( PLUS | SUB ) multiplicativeExpression )* do { int alt139 = 2; alt139 = dfa139.Predict(input); switch (alt139) { case 1 : // AS3_ex.g3:2366:36: op= ( PLUS | SUB ) multiplicativeExpression { op = (IToken)input.LT(1); if ( (input.LA(1) >= PLUS && input.LA(1) <= SUB) ) { input.Consume(); if ( state.backtracking == 0 ) adaptor.AddChild(root_0, (object)adaptor.Create(op)); state.errorRecovery = false;state.failed = false; } else { if ( state.backtracking > 0 ) {state.failed = true; return retval;} MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } if ( state.backtracking == 0 ) { IndentEmit((CommonToken)op); } PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression11589); multiplicativeExpression292 = multiplicativeExpression(); state.followingStackPointer--; if (state.failed) return retval; if ( state.backtracking == 0 ) adaptor.AddChild(root_0, multiplicativeExpression292.Tree); if ( state.backtracking == 0 ) { PopIndent(); } } break; default: goto loop139; } } while (true); loop139: ; // Stops C# compiler whining that label 'loop139' has no statements } retval.Stop = input.LT(-1); if ( state.backtracking==0 ) { 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 { if ( state.backtracking > 0 ) { Memoize(input, 123, additiveExpression_StartIndex); } } return retval; }
// $ANTLR start "additiveExpression" // AS3_ex.g3:3313:1: additiveExpression : multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* ; public AS3_exParser.additiveExpression_return additiveExpression() // throws RecognitionException [1] { AS3_exParser.additiveExpression_return retval = new AS3_exParser.additiveExpression_return(); retval.Start = input.LT(1); int additiveExpression_StartIndex = input.Index(); object root_0 = null; IToken op = null; AS3_exParser.multiplicativeExpression_return multiplicativeExpression302 = null; AS3_exParser.multiplicativeExpression_return multiplicativeExpression303 = null; object op_tree=null; WrapOptions options=mPrinter.getExpressionWrapOptions(); bool pushedWrapInfo=false; try { if ( (state.backtracking > 0) && AlreadyParsedRule(input, 123) ) { return retval; } // AS3_ex.g3:3318:5: ( multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* ) // AS3_ex.g3:3318:9: multiplicativeExpression (op= ( PLUS | SUB ) multiplicativeExpression )* { root_0 = (object)adaptor.GetNilNode(); if ( state.backtracking == 0 ) { pushedWrapInfo=pushWrapInfo(options, true); } PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression13308); multiplicativeExpression302 = multiplicativeExpression(); state.followingStackPointer--; if (state.failed) return retval; if ( state.backtracking == 0 ) adaptor.AddChild(root_0, multiplicativeExpression302.Tree); // AS3_ex.g3:3319:34: (op= ( PLUS | SUB ) multiplicativeExpression )* do { int alt146 = 2; int LA146_0 = input.LA(1); if ( ((LA146_0 >= PLUS && LA146_0 <= SUB)) ) { int LA146_2 = input.LA(2); if ( (synpred296_AS3_ex()) ) { alt146 = 1; } } switch (alt146) { case 1 : // AS3_ex.g3:3319:36: op= ( PLUS | SUB ) multiplicativeExpression { op = (IToken)input.LT(1); if ( (input.LA(1) >= PLUS && input.LA(1) <= SUB) ) { input.Consume(); if ( state.backtracking == 0 ) adaptor.AddChild(root_0, (object)adaptor.Create(op)); state.errorRecovery = false;state.failed = false; } else { if ( state.backtracking > 0 ) {state.failed = true; return retval;} MismatchedSetException mse = new MismatchedSetException(null,input); throw mse; } if ( state.backtracking == 0 ) { indentEmit(op, ASPrettyPrinter.Break_Arithmetic_Ops_code); } PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression13322); multiplicativeExpression303 = multiplicativeExpression(); state.followingStackPointer--; if (state.failed) return retval; if ( state.backtracking == 0 ) adaptor.AddChild(root_0, multiplicativeExpression303.Tree); if ( state.backtracking == 0 ) { popIndent(); } } break; default: goto loop146; } } while (true); loop146: ; // Stops C# compiler whining that label 'loop146' has no statements if ( state.backtracking == 0 ) { if (pushedWrapInfo) mPrinter.popWrapContext(); } } retval.Stop = input.LT(-1); if ( state.backtracking==0 ) { 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 { if ( state.backtracking > 0 ) { Memoize(input, 123, additiveExpression_StartIndex); } } return retval; }