/** What kind of node to create. You might want to override * so I factored out creation here. */ public ParseTree create(Object payload) { return new ParseTree(payload); }
public void _toStringLeaves(StringBuffer buf) { if ( payload instanceof Token ) { // leaf node token? buf.append(this.toStringWithHiddenTokens()); return; } for (int i = 0; children!=null && i < children.size(); i++) { ParseTree t = (ParseTree)children.get(i); t._toStringLeaves(buf); } } }
public void exitRule(String filename, String ruleName) { if ( backtracking>0 ) return; ParseTree ruleNode = (ParseTree)callStack.peek(); if ( ruleNode.getChildCount()==0 ) { ruleNode.addChild(epsilonNode()); } callStack.pop(); }
@Override public void enterRule(String filename, String ruleName) { if ( backtracking>0 ) return; ParseTree parentRuleNode = callStack.peek(); ParseTree ruleNode = create(ruleName); parentRuleNode.addChild(ruleNode); callStack.push(ruleNode); }
@Override public String getText() { return toString(); }
/** Print out the leaves of this tree, which means printing original * input back out. */ public String toInputString() { StringBuffer buf = new StringBuffer(); _toStringLeaves(buf); return buf.toString(); }
System.out.println(t.toStringTree());
@Override public void enterRule(String filename, String ruleName) { if ( backtracking>0 ) return; ParseTree parentRuleNode = callStack.peek(); ParseTree ruleNode = create(ruleName); parentRuleNode.addChild(ruleNode); callStack.push(ruleNode); }
@Override public String getText() { return toString(); }
/** Print out the leaves of this tree, which means printing original * input back out. */ public String toInputString() { StringBuffer buf = new StringBuffer(); _toStringLeaves(buf); return buf.toString(); }
System.out.println(t.toStringTree());
@Override public void exitRule(String filename, String ruleName) { if ( backtracking>0 ) return; ParseTree ruleNode = callStack.peek(); if ( ruleNode.getChildCount()==0 ) { ruleNode.addChild(epsilonNode()); } callStack.pop(); }
public void _toStringLeaves(StringBuffer buf) { if ( payload instanceof Token ) { // leaf node token? buf.append(this.toStringWithHiddenTokens()); return; } for (int i = 0; children!=null && i < children.size(); i++) { ParseTree t = (ParseTree)children.get(i); t._toStringLeaves(buf); } } }
@Override public void recognitionException(RecognitionException e) { if ( backtracking>0 ) return; ParseTree ruleNode = callStack.peek(); ParseTree errorNode = create(e); ruleNode.addChild(errorNode); } }
@Override public String getText() { return toString(); }
/** What kind of node to create. You might want to override * so I factored out creation here. */ public ParseTree create(Object payload) { return new ParseTree(payload); }
/** Print out the leaves of this tree, which means printing original * input back out. */ public String toInputString() { StringBuffer buf = new StringBuffer(); _toStringLeaves(buf); return buf.toString(); }
System.out.println(t.toStringTree());
@Override public void exitRule(String filename, String ruleName) { if ( backtracking>0 ) return; ParseTree ruleNode = callStack.peek(); if ( ruleNode.getChildCount()==0 ) { ruleNode.addChild(epsilonNode()); } callStack.pop(); }
public void _toStringLeaves(StringBuffer buf) { if ( payload instanceof Token ) { // leaf node token? buf.append(this.toStringWithHiddenTokens()); return; } for (int i = 0; children!=null && i < children.size(); i++) { ParseTree t = (ParseTree)children.get(i); t._toStringLeaves(buf); } } }