1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
/*
* 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 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>" + booleanConstant + "</booleanConstant>";
else if (op.equals("not")) return "<booleanNot>" + left.toXML() + "</booleanNot>";
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 + ">";
}
}
}
|
