1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * [The "BSD licence"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2005-2008 Terence Parr 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Conversion to C#: 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc. 8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Redistribution and use in source and binary forms, with or without 11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * modification, are permitted provided that the following conditions 12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * are met: 13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 1. Redistributions of source code must retain the above copyright 14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer. 15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 2. Redistributions in binary form must reproduce the above copyright 16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer in the 17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * documentation and/or other materials provided with the distribution. 18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 3. The name of the author may not be used to endorse or promote products 19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * derived from this software without specific prior written permission. 20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruvernamespace Antlr.Runtime.Tree { 34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using System.Collections.Generic; 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using Exception = System.Exception; 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using IDictionary = System.Collections.IDictionary; 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using NotSupportedException = System.NotSupportedException; 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>A TreeAdaptor that works with any Tree implementation.</summary> */ 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract class BaseTreeAdaptor : ITreeAdaptor { 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * System.identityHashCode() is not always unique; we have to 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * track ourselves. That's ok, it's only for debugging, though it's 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * expensive: we have to create a hashtable with all tree nodes in it. 46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected IDictionary<object, int> treeToUniqueIDMap; 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected int uniqueNodeID = 1; 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object Nil() { 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return Create(null); 53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Create tree node that holds the start and stop tokens associated 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * with an error. 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If you specify your own kind of tree nodes, you will likely have to 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * override this method. CommonTree returns Token.INVALID_TOKEN_TYPE 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * if no token payload but you might have to set token type for diff 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * node type. 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * You don't have to subclass CommonErrorNode; you will likely need to 67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * subclass your own tree node class to avoid class cast exception. 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object ErrorNode(ITokenStream input, IToken start, IToken stop, 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver RecognitionException e) { 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver CommonErrorNode t = new CommonErrorNode(input, start, stop, e); 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("returning error node '"+t+"' @index="+input.index()); 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return t; 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual bool IsNil(object tree) { 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)tree).IsNil; 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object DupTree(object tree) { 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return DupTree(tree, null); 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * This is generic in the sense that it will work with any kind of 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * tree (not just ITree interface). It invokes the adaptor routines 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * not the tree node routines to do the construction. 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object DupTree(object t, object parent) { 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (t == null) { 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object newTree = DupNode(t); 96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // ensure new subtree root has parent/child index set 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver SetChildIndex(newTree, GetChildIndex(t)); // same index in new tree 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver SetParent(newTree, parent); 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = GetChildCount(t); 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int i = 0; i < n; i++) { 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object child = GetChild(t, i); 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object newSubTree = DupTree(child, t); 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver AddChild(newTree, newSubTree); 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return newTree; 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Add a child to the tree t. If child is a flat tree (a list), make all 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * in list children of t. Warning: if t has no children, but child does 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * and child isNil then you can decide it is ok to move children to t via 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * t.children = child.children; i.e., without copying the array. Just 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * make sure that this is consistent with have the user will build 114324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * ASTs. 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void AddChild(object t, object child) { 118324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (t != null && child != null) { 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ((ITree)t).AddChild((ITree)child); 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 122324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If oldRoot is a nil root, just copy or move the children to newRoot. 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If not a nil root, make oldRoot a child of newRoot. 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 127324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=^(nil a b c), new=r yields ^(r a b c) 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=^(a b c), new=r yields ^(r ^(a b c)) 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If newRoot is a nil-rooted single child tree, use the single 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * child as the new root node. 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=^(nil a b c), new=^(nil r) yields ^(r a b c) 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) 137324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If oldRoot was null, it's ok, just return newRoot (even if isNil). 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=null, new=r yields r 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * old=null, new=^(nil r) yields ^(nil r) 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 143324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Return newRoot. Throw an exception if newRoot is not a 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * simple node or nil root with a single child node--it must be a root 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * node. If newRoot is ^(nil x) return x as newRoot. 146324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Be advised that it's ok for newRoot to point at oldRoot's 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * children; i.e., you don't have to copy the list. We are 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * constructing these nodes so we should have this control for 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * efficiency. 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 152324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object BecomeRoot(object newRoot, object oldRoot) { 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("becomeroot new "+newRoot.toString()+" old "+oldRoot); 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree newRootTree = (ITree)newRoot; 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree oldRootTree = (ITree)oldRoot; 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (oldRoot == null) { 158324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return newRoot; 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // handle ^(nil real-node) 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (newRootTree.IsNil) { 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int nc = newRootTree.ChildCount; 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (nc == 1) 164324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newRootTree = (ITree)newRootTree.GetChild(0); 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else if (nc > 1) { 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // TODO: make tree run time exceptions hierarchy 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new Exception("more than one node as root (TODO: make exception hierarchy)"); 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // add oldRoot to newRoot; addChild takes care of case where oldRoot 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // is a flat list (i.e., nil-rooted tree). All children of oldRoot 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // are added to newRoot. 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newRootTree.AddChild(oldRootTree); 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return newRootTree; 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Transform ^(nil x) to x and nil to null</summary> */ 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object RulePostProcessing(object root) { 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("rulePostProcessing: "+((Tree)root).toStringTree()); 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree r = (ITree)root; 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (r != null && r.IsNil) { 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (r.ChildCount == 0) { 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver r = null; 184324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } else if (r.ChildCount == 1) { 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver r = (ITree)r.GetChild(0); 186324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // whoever invokes rule will set parent and child index 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver r.Parent = null; 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver r.ChildIndex = -1; 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return r; 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object BecomeRoot(IToken newRoot, object oldRoot) { 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return BecomeRoot(Create(newRoot), oldRoot); 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object Create(int tokenType, IToken fromToken) { 199324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver fromToken = CreateToken(fromToken); 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //((ClassicToken)fromToken).setType(tokenType); 201324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver fromToken.Type = tokenType; 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = (ITree)Create(fromToken); 203324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return t; 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object Create(int tokenType, IToken fromToken, string text) { 207324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (fromToken == null) 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return Create(tokenType, text); 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver fromToken = CreateToken(fromToken); 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver fromToken.Type = tokenType; 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver fromToken.Text = text; 213324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = (ITree)Create(fromToken); 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return t; 215324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object Create(int tokenType, string text) { 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IToken fromToken = CreateToken(tokenType, text); 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = (ITree)Create(fromToken); 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return t; 221324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 222324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 223324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int GetType(object t) { 224324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)t).Type; 225324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 226324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 227324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SetType(object t, int type) { 228324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new NotSupportedException("don't know enough about Tree node"); 229324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 230324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 231324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual string GetText(object t) { 232324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)t).Text; 233324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 234324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 235324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SetText(object t, string text) { 236324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new NotSupportedException("don't know enough about Tree node"); 237324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 238324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 239324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object GetChild(object t, int i) { 240324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)t).GetChild(i); 241324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 242324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 243324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SetChild(object t, int i, object child) { 244324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ((ITree)t).SetChild(i, (ITree)child); 245324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 246324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 247324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object DeleteChild(object t, int i) { 248324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)t).DeleteChild(i); 249324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 250324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 251324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int GetChildCount(object t) { 252324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ((ITree)t).ChildCount; 253324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 254324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 255324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int GetUniqueID(object node) { 256324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (treeToUniqueIDMap == null) { 257324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver treeToUniqueIDMap = new Dictionary<object, int>(); 258324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 259324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int id; 260324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (treeToUniqueIDMap.TryGetValue(node, out id)) 261324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return id; 262324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 263324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver id = uniqueNodeID; 264324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver treeToUniqueIDMap[node] = id; 265324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver uniqueNodeID++; 266324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return id; 267324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // GC makes these nonunique: 268324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // return System.identityHashCode(node); 269324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 270324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 271324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 272324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Tell me how to create a token for use with imaginary token nodes. 273324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * For example, there is probably no input symbol associated with imaginary 274324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * token DECL, but you need to create it as a payload or whatever for 275324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the DECL node as in ^(DECL type ID). 276324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 277324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 278324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 279324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If you care what the token payload objects' type is, you should 280324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * override this method and any other createToken variant. 281324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 282324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 283324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract IToken CreateToken(int tokenType, string text); 284324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 285324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 286324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Tell me how to create a token for use with imaginary token nodes. 287324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * For example, there is probably no input symbol associated with imaginary 288324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * token DECL, but you need to create it as a payload or whatever for 289324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the DECL node as in ^(DECL type ID). 290324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 291324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 292324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 293324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * This is a variant of createToken where the new token is derived from 294324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * an actual real input token. Typically this is for converting '{' 295324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * tokens to BLOCK etc... You'll see 296324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 297324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * r : lc='{' ID+ '}' -> ^(BLOCK[$lc] ID+) ; 298324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 299324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If you care what the token payload objects' type is, you should 300324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * override this method and any other createToken variant. 301324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 302324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 303324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract IToken CreateToken(IToken fromToken); 304324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 305324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract object Create(IToken payload); 306324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract object DupNode(object treeNode); 307324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract IToken GetToken(object t); 308324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract void SetTokenBoundaries(object t, IToken startToken, IToken stopToken); 309324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int GetTokenStartIndex(object t); 310324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int GetTokenStopIndex(object t); 311324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract object GetParent(object t); 312324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract void SetParent(object t, object parent); 313324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int GetChildIndex(object t); 314324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract void SetChildIndex(object t, int index); 315324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract void ReplaceChildren(object parent, int startChildIndex, int stopChildIndex, object t); 316324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 317324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver} 318