projects
/
sbp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
checkpoint
[sbp.git]
/
src
/
edu
/
berkeley
/
sbp
/
tib
/
TibDoc.java
diff --git
a/src/edu/berkeley/sbp/tib/TibDoc.java
b/src/edu/berkeley/sbp/tib/TibDoc.java
index
a823b36
..
c3b7871
100644
(file)
--- a/
src/edu/berkeley/sbp/tib/TibDoc.java
+++ b/
src/edu/berkeley/sbp/tib/TibDoc.java
@@
-10,7
+10,7
@@
import edu.berkeley.sbp.misc.*;
import java.util.*;
import java.io.*;
import java.util.*;
import java.io.*;
-public class TibDoc {
+public class TibDoc extends ReflectiveWalker {
public static void main(String[] s) throws Exception {
System.out.println("parsing " + s[0]);
public static void main(String[] s) throws Exception {
System.out.println("parsing " + s[0]);
@@
-23,15
+23,15
@@
public class TibDoc {
Forest f = new CharToken.CharToStringParser(mg).parse(new Tib(new FileInputStream(s[1])));
System.out.println(f);
//System.out.println(((Tree)walk(f.expand1())).toString(0, 0, 120));
Forest f = new CharToken.CharToStringParser(mg).parse(new Tib(new FileInputStream(s[1])));
System.out.println(f);
//System.out.println(((Tree)walk(f.expand1())).toString(0, 0, 120));
- System.out.println(((Tree)walk(f.expand1())).toPrettyString());
+ System.out.println(((Tree)new TibDoc().walk(f.expand1())).toPrettyString());
}
}
- public static Tree<String> walk(Tree<String> tree) {
+ public Tree<String> walk(Tree<String> tree) {
String head = tree.head();
if ("stringify".equals(head)) {
String head = tree.head();
if ("stringify".equals(head)) {
- String ret = "";
- for(Tree<String> t : tree.child(0)) ret += t;
- return new Tree<String>(null, ret);
+ StringBuffer ret = new StringBuffer();
+ for(Tree<String> t : tree.child(0)) ret.append(t);
+ return new Tree<String>(null, ret.toString());
}
Tree<String>[] children = new Tree[tree.numChildren()];
for(int i=0; i<children.length; i++) children[i] = walk(tree.child(i));
}
Tree<String>[] children = new Tree[tree.numChildren()];
for(int i=0; i<children.length; i++) children[i] = walk(tree.child(i));