public final String generateRandomCode() {
// Find compilation unit node.
final TreeNode<Integer> rootNode = treeFormat.getKeyForCompilationUnit();
final TSGNode topTreeNode = new TSGNode(rootNode.getData());
topTreeNode.isRoot = true;
final TreeNode<TSGNode> node = TreeNode.create(topTreeNode, rootNode.nProperties());
final TreeNode<TSGNode> randomTree = this.generateRandom(node);
final TreeNode<Integer> treeCopy =
TreeNode.create(randomTree.getData().nodeKey, randomTree.nProperties());
TSGNode.copyChildren(treeCopy, randomTree);
return treeFormat.getCodeFromTree(treeCopy);
}
@Override
public String apply(final TreeNode<TSGNode> node) {
if (node == null || node.getData() == null) {
return "UNK";
}
return treeFormat.getSymbol(checkNotNull(node).getData().nodeKey).toString();
}
@Override
public String toString() {
final StringBuffer buf = new StringBuffer();
for (final Entry<TSGNode, ConcurrentHashMultiset<TreeNode<TSGNode>>> rootEntry :
grammar.entrySet()) {
if (rootEntry.getValue().entrySet().isEmpty()) {
continue;
}
final TSGNode root = rootEntry.getKey();
buf.append("********\n");
buf.append(treeFormat.getSymbol(root.nodeKey) + ":\n");
for (final Multiset.Entry<TreeNode<TSGNode>> tree :
Multisets.copyHighestCountFirst(rootEntry.getValue()).entrySet()) {
final double prob = ((double) tree.getCount()) / rootEntry.getValue().size();
buf.append("----------------------------------------\n");
if (tree.getElement() != null) {
if (tree.getElement().getData() != null) {
buf.append(treeToString(tree.getElement()));
buf.append("_________________________________\n");
try {
final TreeNode<Integer> intTree =
TreeNode.create(
tree.getElement().getData().nodeKey, tree.getElement().nProperties());
TSGNode.copyChildren(intTree, tree.getElement());
if (treeFormat.getSymbol(intTree.getData()).nodeType == AstNodeSymbol.MULTI_NODE) {
treeFormat.printMultinode(buf, intTree);
} else {
buf.append(treeFormat.getCodeFromTree(intTree));
}
} catch (final Throwable e) {
buf.append("Cannot get AST representation of rule");
}
buf.append("\n");
} else {
buf.append("null");
}
} else {
buf.append("null");
}
buf.append(">Prob " + prob + " (" + tree.getCount() + ")\n");
}
}
return buf.toString();
}