if (tree.numChildren()==0) return super.walk(tree);
if ("\\n".equals(head)) return new Character('\n');
else if ("\\r".equals(head)) return new Character('\r');
if (tree.numChildren()==0) return super.walk(tree);
if ("\\n".equals(head)) return new Character('\n');
else if ("\\r".equals(head)) return new Character('\r');