| 1 | |
|
| 2 | |
|
| 3 | |
|
| 4 | |
|
| 5 | |
|
| 6 | |
|
| 7 | |
|
| 8 | |
|
| 9 | |
|
| 10 | |
|
| 11 | |
|
| 12 | |
|
| 13 | |
|
| 14 | |
|
| 15 | |
|
| 16 | |
|
| 17 | |
|
| 18 | |
|
| 19 | |
package org.kuali.student.common.messagebuilder.booleanmessage.ast; |
| 20 | |
|
| 21 | |
import java.util.ArrayList; |
| 22 | |
import java.util.List; |
| 23 | |
|
| 24 | |
public class BooleanFunction { |
| 25 | |
private String booleanExpression; |
| 26 | |
private BinaryMessageTree ASTtree; |
| 27 | |
private BooleanNode root; |
| 28 | 23 | private ArrayList<String> funcVars = new ArrayList<String>(); |
| 29 | 23 | private ArrayList<String> symbols = new ArrayList<String>(); |
| 30 | |
|
| 31 | 23 | public BooleanFunction(String booleanExpression) { |
| 32 | |
|
| 33 | |
|
| 34 | 23 | ASTtree = new BinaryMessageTree(); |
| 35 | 23 | root = ASTtree.buildTree(booleanExpression); |
| 36 | 22 | this.booleanExpression = booleanExpression; |
| 37 | 22 | } |
| 38 | |
|
| 39 | |
|
| 40 | |
|
| 41 | |
|
| 42 | |
|
| 43 | |
|
| 44 | |
|
| 45 | |
|
| 46 | |
|
| 47 | |
|
| 48 | |
public List<String> getVariables() { |
| 49 | 21 | ASTtree.traverseTreePostOrderDontSetNode(root, null); |
| 50 | 21 | List<BooleanNode> treeNodes = ASTtree.getAllNodes(); |
| 51 | |
|
| 52 | 21 | for (BooleanNode bnode : treeNodes) { |
| 53 | 123 | String label = bnode.getLabel(); |
| 54 | 123 | if (label.equals("+") || label.equals("*")) { |
| 55 | 30 | continue; |
| 56 | |
} |
| 57 | 72 | funcVars.add(label); |
| 58 | 72 | } |
| 59 | 21 | return funcVars; |
| 60 | |
} |
| 61 | |
|
| 62 | |
|
| 63 | |
|
| 64 | |
|
| 65 | |
|
| 66 | |
|
| 67 | |
|
| 68 | |
|
| 69 | |
|
| 70 | |
|
| 71 | |
public List<String> getSymbols() { |
| 72 | 1 | String workString = null; |
| 73 | |
|
| 74 | 1 | this.booleanExpression = (booleanExpression == null ? null : booleanExpression.replaceAll("\\s+", "")); |
| 75 | |
|
| 76 | 1 | workString = this.booleanExpression; |
| 77 | |
|
| 78 | 12 | while (workString != null && workString.length() > 0) { |
| 79 | 11 | String propositionKeyPattern = "^[A-Z][0-9]*"; |
| 80 | 11 | String restOfFunctionString = null; |
| 81 | 11 | String theSymbol = null; |
| 82 | 11 | int restOfFunctionStringStartIndex = 0; |
| 83 | 11 | if (workString.matches(propositionKeyPattern + ".*")) { |
| 84 | 4 | restOfFunctionString = workString.replaceFirst(propositionKeyPattern, ""); |
| 85 | 4 | restOfFunctionStringStartIndex = workString.indexOf(restOfFunctionString); |
| 86 | 4 | if (restOfFunctionStringStartIndex <= 0) { |
| 87 | 0 | theSymbol = workString; |
| 88 | 0 | workString = ""; |
| 89 | |
} else { |
| 90 | 4 | theSymbol = workString.substring(0, restOfFunctionStringStartIndex); |
| 91 | 4 | workString = restOfFunctionString; |
| 92 | |
} |
| 93 | |
} else { |
| 94 | 7 | theSymbol = workString.substring(0, 1); |
| 95 | 7 | workString = workString.substring(1, workString.length()); |
| 96 | |
} |
| 97 | 11 | symbols.add(theSymbol); |
| 98 | 11 | } |
| 99 | 1 | return symbols; |
| 100 | |
} |
| 101 | |
} |