ES3Parser.additiveExpression C# (CSharp) Method

    public ES3Parser.additiveExpression_return additiveExpression() // throws RecognitionException [1]
    {   
        ES3Parser.additiveExpression_return retval = new ES3Parser.additiveExpression_return();
        retval.Start = input.LT(1);

        object root_0 = null;

        IToken ADD41 = null;
        IToken SUB42 = null;
        ES3Parser.multiplicativeExpression_return left = default(ES3Parser.multiplicativeExpression_return);

        ES3Parser.multiplicativeExpression_return right = default(ES3Parser.multiplicativeExpression_return);


        object ADD41_tree=null;
        object SUB42_tree=null;


        	BinaryExpressionType type = BinaryExpressionType.Unknown;

        try 
    	{
            // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1144:2: (left= multiplicativeExpression ( ( ADD | SUB ) right= multiplicativeExpression )* )
            // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1144:4: left= multiplicativeExpression ( ( ADD | SUB ) right= multiplicativeExpression )*
            {
            	root_0 = (object)adaptor.GetNilNode();

            	PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression4034);
            	left = multiplicativeExpression();
            	state.followingStackPointer--;

            	adaptor.AddChild(root_0, left.Tree);
            	 retval.value =  left.value; 
            	// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1144:59: ( ( ADD | SUB ) right= multiplicativeExpression )*
            	do 
            	{
            	    int alt29 = 2;
            	    int LA29_0 = input.LA(1);

            	    if ( ((LA29_0 >= ADD && LA29_0 <= SUB)) )
            	    {
            	        alt29 = 1;
            	    }


            	    switch (alt29) 
            		{
            			case 1 :
            			    // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1145:3: ( ADD | SUB ) right= multiplicativeExpression
            			    {
            			    	// C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1145:3: ( ADD | SUB )
            			    	int alt28 = 2;
            			    	int LA28_0 = input.LA(1);

            			    	if ( (LA28_0 == ADD) )
            			    	{
            			    	    alt28 = 1;
            			    	}
            			    	else if ( (LA28_0 == SUB) )
            			    	{
            			    	    alt28 = 2;
            			    	}
            			    	else 
            			    	{
            			    	    NoViableAltException nvae_d28s0 =
            			    	        new NoViableAltException("", 28, 0, input);

            			    	    throw nvae_d28s0;
            			    	}
            			    	switch (alt28) 
            			    	{
            			    	    case 1 :
            			    	        // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1145:5: ADD
            			    	        {
            			    	        	ADD41=(IToken)Match(input,ADD,FOLLOW_ADD_in_additiveExpression4045); 
            			    	        		ADD41_tree = (object)adaptor.Create(ADD41);
            			    	        		adaptor.AddChild(root_0, ADD41_tree);

            			    	        	 type= BinaryExpressionType.Plus; 

            			    	        }
            			    	        break;
            			    	    case 2 :
            			    	        // C:\\Users\\s.ros\\Projets\\Jint\\Jint\\ES3.g:1146:5: SUB
            			    	        {
            			    	        	SUB42=(IToken)Match(input,SUB,FOLLOW_SUB_in_additiveExpression4053); 
            			    	        		SUB42_tree = (object)adaptor.Create(SUB42);
            			    	        		adaptor.AddChild(root_0, SUB42_tree);

            			    	        	 type= BinaryExpressionType.Minus; 

            			    	        }
            			    	        break;

            			    	}

            			    	PushFollow(FOLLOW_multiplicativeExpression_in_additiveExpression4064);
            			    	right = multiplicativeExpression();
            			    	state.followingStackPointer--;

            			    	adaptor.AddChild(root_0, right.Tree);
            			    	 retval.value =  new BinaryExpression(type, retval.value, right.value); 

            			    }
            			    break;

            			default:
            			    goto loop29;
            	    }
            	} while (true);

            	loop29:
            		;	// Stops C# compiler whining that label 'loop29' 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 end "additiveExpression"