public Tree markHeadNodes(Tree t) { return markHeadNodes(t, null); }
private Tree[] headMarkChildren(Tree t, Tree head) { Tree[] kids = t.children(); Tree[] newKids = new Tree[kids.length]; for (int i = 0, n = kids.length; i < n; i++) { newKids[i] = markHeadNodes(kids[i], head); } return newKids; }
outputPSTree = markHeadNodes(outputPSTree);
public Tree markHeadNodes(Tree t) { return markHeadNodes(t, null); }
public Tree markHeadNodes(Tree t) { return markHeadNodes(t, null); }
public Tree markHeadNodes(Tree t) { return markHeadNodes(t, null); }
public Tree markHeadNodes(Tree t) { return markHeadNodes(t, null); }
private Tree[] headMarkChildren(Tree t, Tree head) { Tree[] kids = t.children(); Tree[] newKids = new Tree[kids.length]; for (int i = 0, n = kids.length; i < n; i++) { newKids[i] = markHeadNodes(kids[i], head); } return newKids; }
private Tree[] headMarkChildren(Tree t, Tree head) { Tree[] kids = t.children(); Tree[] newKids = new Tree[kids.length]; for (int i = 0, n = kids.length; i < n; i++) { newKids[i] = markHeadNodes(kids[i], head); } return newKids; }
private Tree[] headMarkChildren(Tree t, Tree head) { Tree[] kids = t.children(); Tree[] newKids = new Tree[kids.length]; for (int i = 0, n = kids.length; i < n; i++) { newKids[i] = markHeadNodes(kids[i], head); } return newKids; }
private Tree[] headMarkChildren(Tree t, Tree head) { Tree[] kids = t.children(); Tree[] newKids = new Tree[kids.length]; for (int i = 0, n = kids.length; i < n; i++) { newKids[i] = markHeadNodes(kids[i], head); } return newKids; }
outputPSTree = markHeadNodes(outputPSTree);
outputPSTree = markHeadNodes(outputPSTree);
outputPSTree = markHeadNodes(outputPSTree);
outputPSTree = markHeadNodes(outputPSTree);