dpfmanager.conformancechecker.tiff.implementation_checker.rules.Clausules Maven / Gradle / Ivy
/**
* Clausules.java
This program is free software: you can redistribute it
* and/or modify it under the terms of the GNU General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any later version; or,
* at your choice, under the terms of the Mozilla Public License, v. 2.0. SPDX GPL-3.0+ or MPL-2.0+.
*
This program 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 General Public License and the Mozilla Public License for more details.
* You should have received a copy of the GNU General Public License and the Mozilla Public
* License along with this program. If not, see http://www.gnu.org/licenses/
* and at http://mozilla.org/MPL/2.0 .
NB: for the
* © statement, include Easy Innova SL or other company/Person contributing the code.
©
* 2015 Easy Innova, SL
*
* @author Víctor Muñoz Solà
* @version 1.0
* @since 23/7/2015
*/
package dpfmanager.conformancechecker.tiff.implementation_checker.rules;
import java.util.ArrayList;
import java.util.List;
/**
* Created by easy on 14/03/2016.
*/
public class Clausules {
public enum Operator { AND, OR, NULL };
List clausules;
public Clausules() {
}
public List getClausules() {
return clausules;
}
public boolean parse(String expression) {
clausules = new ArrayList();
String expr = expression;
Operator operator = null;
while (expr.startsWith("{")) {
try {
Clausule cla = new Clausule();
cla.value = expr.substring(1, expr.indexOf("}"));
cla.operator = operator;
clausules.add(cla);
expr = expr.substring(expr.indexOf("}") + 1).trim();
if (expr.length() == 0) break;
if (expr.length() < 2)
expr.toString();
String op = expr.substring(0, 2);
if (op.equals("&&")) operator = Operator.AND;
else if (op.equals("||")) operator = Operator.OR;
expr = expr.substring(2).trim();
} catch (Exception ex) {
ex.printStackTrace();
}
}
return true;
}
}