/*
 * Copyright (c) 2008, 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

package com.sun.scenario.effect.compiler.parser;

import com.sun.scenario.effect.compiler.JSLParser;
import com.sun.scenario.effect.compiler.model.BinaryOpType;
import com.sun.scenario.effect.compiler.tree.BinaryExpr;
import org.antlr.runtime.RecognitionException;
import org.junit.Before;
import org.junit.Test;
import static org.junit.Assert.assertEquals;

public class AddExprTest extends MultExprTest {

    private String mult;

    @Before
    @Override
    public void setUp() {
        super.setUp();
        this.mult = multiplicative();
    }

    @Test
    public void oneAddition() throws Exception {
        BinaryExpr tree = parseTreeFor(mult + " + " + mult);
        assertEquals(tree.getOp(), BinaryOpType.ADD);
    }

    @Test
    public void oneSubtraction() throws Exception {
        BinaryExpr tree = parseTreeFor(mult + "   - " + mult);
        assertEquals(tree.getOp(), BinaryOpType.SUB);
    }

    @Test
    public void additiveCombination() throws Exception {
        BinaryExpr tree = parseTreeFor(mult + " + " + mult + '-' + mult + '-' + mult + "   +" + mult);
        assertEquals(tree.getOp(), BinaryOpType.ADD);
    }

    @Test(expected = ClassCastException.class)
    public void notAnAdditiveExpression() throws Exception {
        parseTreeFor(mult + "!" + mult);
    }

    private BinaryExpr parseTreeFor(String text) throws RecognitionException {
        JSLParser parser = parserOver(text);
        return (BinaryExpr)parser.additive_expression();
    }

    protected String additive() {
        return "(" + multiplicative() + " + " + multiplicative() + ")";
    }
}
