00001 /* 00002 [The "BSD license"] 00003 Copyright (c) 2005-2009 Terence Parr 00004 All rights reserved. 00005 00006 Redistribution and use in source and binary forms, with or without 00007 modification, are permitted provided that the following conditions 00008 are met: 00009 1. Redistributions of source code must retain the above copyright 00010 notice, this list of conditions and the following disclaimer. 00011 2. Redistributions in binary form must reproduce the above copyright 00012 notice, this list of conditions and the following disclaimer in the 00013 documentation and/or other materials provided with the distribution. 00014 3. The name of the author may not be used to endorse or promote products 00015 derived from this software without specific prior written permission. 00016 00017 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 00018 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00019 OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 00020 IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 00021 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 00022 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00023 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00024 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00025 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 00026 THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00027 */ 00028 package org.antlr.runtime.tree; 00029 00030 import org.antlr.runtime.Token; 00031 00032 import java.util.List; 00033 00039 public class ParseTree extends BaseTree { 00040 public Object payload; 00041 public List hiddenTokens; 00042 00043 public ParseTree(Object label) { 00044 this.payload = label; 00045 } 00046 00047 public Tree dupNode() { 00048 return null; 00049 } 00050 00051 public int getType() { 00052 return 0; 00053 } 00054 00055 public String getText() { 00056 return toString(); 00057 } 00058 00059 public int getTokenStartIndex() { 00060 return 0; 00061 } 00062 00063 public void setTokenStartIndex(int index) { 00064 } 00065 00066 public int getTokenStopIndex() { 00067 return 0; 00068 } 00069 00070 public void setTokenStopIndex(int index) { 00071 } 00072 00073 public String toString() { 00074 if ( payload instanceof Token ) { 00075 Token t = (Token)payload; 00076 if ( t.getType() == Token.EOF ) { 00077 return "<EOF>"; 00078 } 00079 return t.getText(); 00080 } 00081 return payload.toString(); 00082 } 00083 00087 public String toStringWithHiddenTokens() { 00088 StringBuffer buf = new StringBuffer(); 00089 if ( hiddenTokens!=null ) { 00090 for (int i = 0; i < hiddenTokens.size(); i++) { 00091 Token hidden = (Token) hiddenTokens.get(i); 00092 buf.append(hidden.getText()); 00093 } 00094 } 00095 String nodeText = this.toString(); 00096 if ( !nodeText.equals("<EOF>") ) buf.append(nodeText); 00097 return buf.toString(); 00098 } 00099 00103 public String toInputString() { 00104 StringBuffer buf = new StringBuffer(); 00105 _toStringLeaves(buf); 00106 return buf.toString(); 00107 } 00108 00109 public void _toStringLeaves(StringBuffer buf) { 00110 if ( payload instanceof Token ) { // leaf node token? 00111 buf.append(this.toStringWithHiddenTokens()); 00112 return; 00113 } 00114 for (int i = 0; children!=null && i < children.size(); i++) { 00115 ParseTree t = (ParseTree)children.get(i); 00116 t._toStringLeaves(buf); 00117 } 00118 } 00119 }
1.5.5