| Methods Summary |
|---|
| public java.lang.String | getLeftmostDerivation(int maxSteps)
StringBuffer buf = new StringBuffer(2000);
buf.append(" "+this.toString());
buf.append("\n");
for (int d=1; d<maxSteps; d++) {
buf.append(" =>");
buf.append(getLeftmostDerivationStep(d));
buf.append("\n");
}
return buf.toString();
|
| protected abstract int | getLeftmostDerivation(java.lang.StringBuffer buf, int step)Get derivation and return how many you did (less than requested for
subtree roots.
|
| public java.lang.String | getLeftmostDerivationStep(int step)Walk parse tree and return requested number of derivation steps.
If steps <= 0, return node text. If steps == 1, return derivation
string at step.
if ( step<=0 ) {
return toString();
}
StringBuffer buf = new StringBuffer(2000);
getLeftmostDerivation(buf, step);
return buf.toString();
|
| public void | initialize(int i, java.lang.String s)
|
| public void | initialize(persistence.antlr.collections.AST ast)
|
| public void | initialize(persistence.antlr.Token token)
|
