/*
 * This file is part of %PACKAGENAME%.
 *
 * %PACKAGENAME% is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation, either version 3 of
 * the License, or (at your option) any later version.
 *
 * %PACKAGENAME% 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with %PACKAGENAME%. If not, see <http://www.gnu.org/licenses/>.
 *
 * For more information please see <http://www.%PACKAGENAME%.org>
 * or contact Peter Baumann via <baumann@rasdaman.com>.
 *
 * Copyright 2009 Jacobs University Bremen, Peter Baumann.
 */

package grammar;

public class BooleanExpr implements IParseTreeNode
{
    IParseTreeNode e1, e2;
    String op;
    
    public BooleanExpr(String op, CoverageExpr cov)
    {
        this.op = op;
        e1 = cov;
    }

    public BooleanExpr(String op, CoverageExpr cov, IndexExpr i)
    {
        this.op = op;
        e1 = cov;
        e2 = i;
    }
    
    public String toXML()
    {
        String result = "";
        if (op.equalsIgnoreCase("not"))
            result = e1.toXML();
        else if (op.equalsIgnoreCase("bit"))
            result = e1.toXML() + e2.toXML();

        result = "<" + op + ">" + result + "</" + op + ">";
        return result;
    }
    
}