summaryrefslogtreecommitdiffstats
path: root/src/grammar/CondenseOperation.java
diff options
context:
space:
mode:
authorAndrei Aiordachioaie <a.aiordachioaie@jacobs-university.de>2009-05-29 12:38:32 +0200
committerAndrei <a.aiordachioaie@jacobs-university.de>2009-07-07 10:52:30 +0200
commitc86977b6aaea3f635fc8ebee7c03cb3a0080c9ec (patch)
tree15bac9f8ea3eecc87d26d08f23a003b13376f1f0 /src/grammar/CondenseOperation.java
parentf8a46d792930649163ccc3c08b379b16d9d7f772 (diff)
Class renaming + file cleanup
Diffstat (limited to 'src/grammar/CondenseOperation.java')
-rw-r--r--src/grammar/CondenseOperation.java73
1 files changed, 73 insertions, 0 deletions
diff --git a/src/grammar/CondenseOperation.java b/src/grammar/CondenseOperation.java
new file mode 100644
index 0000000..2898710
--- /dev/null
+++ b/src/grammar/CondenseOperation.java
@@ -0,0 +1,73 @@
+/*
+ * This file is part of PetaScope.
+ *
+ * PetaScope 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.
+ *
+ * PetaScope 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 PetaScope. If not, see <http://www.gnu.org/licenses/>.
+ *
+ * For more information please see <http://www.PetaScope.org>
+ * or contact Peter Baumann via <baumann@rasdaman.com>.
+ *
+ * Copyright 2009 Jacobs University Bremen, Peter Baumann.
+ */
+
+
+
+
+package grammar;
+
+/**
+ * CondenseOperationType
+ *
+ * @author Andrei Aiordachioaie
+ */
+public class CondenseOperation implements IParseTreeNode
+{
+ String op;
+
+ public CondenseOperation(String op)
+ {
+ this.op = op;
+ }
+
+ public String toXML()
+ {
+ String result = "";
+
+ if (op.equalsIgnoreCase("plus"))
+ {
+ result = "opPlus";
+ }
+ else if (op.equalsIgnoreCase("mult"))
+ {
+ result = "opMult";
+ }
+ else if (op.equalsIgnoreCase("max"))
+ {
+ result = "opMax";
+ }
+ else if (op.equalsIgnoreCase("min"))
+ {
+ result = "opMin";
+ }
+ else if (op.equalsIgnoreCase("and"))
+ {
+ result = "opAnd";
+ }
+ else if (op.equalsIgnoreCase("or"))
+ {
+ result = "opOr";
+ }
+
+ return result;
+ }
+}