blob: 1873c71396259d612730a63d0ae4ba1f17f5aabf (
plain)
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
|
/*
* 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;
}
}
|
