public final DirkExpParser.additiveExpr_return additiveExpr() throws RecognitionException {
        DirkExpParser.additiveExpr_return retval = new DirkExpParser.additiveExpr_return();
        retval.start = input.LT(1);

        CommonTree root_0 = null;

        Token set15=null;
        DirkExpParser.multiplyExpr_return multiplyExpr14 = null;

        DirkExpParser.multiplyExpr_return multiplyExpr16 = null;


        CommonTree set15_tree=null;

        try {
            // F:\\antlr\\BoncExp.g:39:5: ( multiplyExpr ( ( PLUS | MINUS ) multiplyExpr )* )
            // F:\\antlr\\BoncExp.g:39:9: multiplyExpr ( ( PLUS | MINUS ) multiplyExpr )*
            {
            root_0 = (CommonTree)adaptor.nil();

            pushFollow(FOLLOW_multiplyExpr_in_additiveExpr302);
            multiplyExpr14=multiplyExpr();

            state._fsp--;

            adaptor.addChild(root_0, multiplyExpr14.getTree());
            // F:\\antlr\\BoncExp.g:39:22: ( ( PLUS | MINUS ) multiplyExpr )*
            loop5:
            do {
                int alt5=2;
                int LA5_0 = input.LA(1);

                if ( ((LA5_0>=PLUS && LA5_0<=MINUS)) ) {
                    alt5=1;
                }


                switch (alt5) {
            	case 1 :
            	    // F:\\antlr\\BoncExp.g:39:23: ( PLUS | MINUS ) multiplyExpr
            	    {
            	    set15=(Token)input.LT(1);
            	    set15=(Token)input.LT(1);
            	    if ( (input.LA(1)>=PLUS && input.LA(1)<=MINUS) ) {
            	        input.consume();
            	        root_0 = (CommonTree)adaptor.becomeRoot((CommonTree)adaptor.create(set15), root_0);
            	        state.errorRecovery=false;
            	    }
            	    else {
            	        MismatchedSetException mse = new MismatchedSetException(null,input);
            	        throw mse;
            	    }

            	    pushFollow(FOLLOW_multiplyExpr_in_additiveExpr312);
            	    multiplyExpr16=multiplyExpr();

            	    state._fsp--;

            	    adaptor.addChild(root_0, multiplyExpr16.getTree());

            	    }
            	    break;

            	default :
            	    break loop5;
                }
            } while (true);


            }

            retval.stop = input.LT(-1);

            retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0);
            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);

        }
        catch (RecognitionException re) {
            reportError(re);
            recover(input,re);
    	retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re);

        }
        finally {
        }
        return retval;
    }