/*
* 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 .
*
* For more information please see
* or contact Peter Baumann via .
*
* Copyright 2009 Jacobs University Bremen, Peter Baumann.
*/
package grammar;
public class BooleanScalarExpr implements IParseTreeNode
{
BooleanScalarExpr leftBooleanScalarExpr, rightBooleanScalarExpr;
NumericScalarExpr leftNumericScalar, rightNumericScalar;
IParseTreeNode left, right;
String booleanConstant;
String op;
String node1, node2;
public BooleanScalarExpr(String bc) {
op = null;
booleanConstant = bc;
}
public BooleanScalarExpr(String op, BooleanScalarExpr be){
this.op = op;
left = be ;
}
public BooleanScalarExpr(String op, BooleanScalarExpr lbe, BooleanScalarExpr rbe){
this.op = op;
left = lbe ;
right = rbe ;
}
public BooleanScalarExpr(String op, NumericScalarExpr left, NumericScalarExpr right)
{
this.op = op;
this.left = left;
this.right = right;
}
public BooleanScalarExpr(String op, StringScalarExpr e1, StringScalarExpr e2)
{
this.op = op;
left = e1;
right = e2;
}
public String toXML(){
if (op == null) return "" + booleanConstant + "";
else if (op.equals("not")) return "" + left.toXML() + "";
else
{
if (this.left != null)
node1 = this.left.toXML();
if (this.right != null)
node2 = this.right.toXML();
if (op.equals("and")) op = "booleanAnd";
else if (op.equals("or")) op = "booleanOr";
else if (op.equals("xor")) op = "booleanXor";
else if (op.equals("=")) op = "booleanEqualNumeric";
else if (op.equals("!=")) op = "booleanNotEqualNumeric";
else if (op.equals("<")) op = "booleanLessThan";
else if (op.equals(">")) op = "booleanGreaterThan";
else if (op.equals("<=")) op = "booleanLessOrEqual";
else if (op.equals(">=")) op = "booleanGreaterOrEqual";
return "<" + op + ">" + node1 + node2 + "" + op + ">";
}
}
}