@SuppressWarnings("unchecked") public TreeGrepMatch(Tree<T> pattern) { this.pattern = pattern; dfs = new Tree[pattern.size()]; matches = new ArrayList<>(); patternLeafMatches = new ArrayList<>(); int i = 0; for (Tree<T> item : TreeTraversal.depthFirstTraversal(pattern)) { dfs[i++] = item; } currentPosition = 0; }
matchesList = new ArrayList<>(); for (Tree<T> node : TreeTraversal.breadthFirstTraversal(tree)) { if (verbose) { logger.info("Comparing node: ");
@SuppressWarnings("unchecked") public TreeGrepMatch(Tree<T> pattern) { this.pattern = pattern; dfs = new Tree[pattern.size()]; matches = new ArrayList<>(); patternLeafMatches = new ArrayList<>(); int i = 0; for (Tree<T> item : TreeTraversal.depthFirstTraversal(pattern)) { dfs[i++] = item; } currentPosition = 0; }
matchesList = new ArrayList<>(); for (Tree<T> node : TreeTraversal.breadthFirstTraversal(tree)) { if (verbose) { logger.info("Comparing node: ");
for(Tree<String> t: TreeTraversal.depthFirstTraversal(subtree)){ if(t.isLeaf()){ System.out.print(t.getLabel());
if(minNP!=null){ int minNPStart = 0; for(Tree<String> t: TreeTraversal.depthFirstTraversal(subtree)){ if(t==minNP) break;
for (Tree<Pair<String, IntPair>> c : TreeTraversal.depthFirstTraversal(spanLabeledTree)) { if (!c.isRoot() && !c.isLeaf() && !c.getChild(0).isLeaf()) { int start = c.getLabel().getSecond().getFirst() + predicateSentenceStart;