438   ITree = interface(IANTLRInterface)  interface
442     function GetParent: ITree;  in GetParent()
443     procedure SetParent(const Value: ITree);  argument
461     function GetChild(const I: Integer): ITree;  in GetChild()
468     procedure AddChild(const T: ITree);
471     procedure SetChild(const I: Integer; const T: ITree);
484     function DupNode: ITree;
495     property Parent: ITree read GetParent write SetParent;
535   IBaseTree = interface(ITree)
541     function GetParent: ITree;  in GetParent()
542     procedure SetParent(const Value: ITree);  argument
558     procedure SetChild(const I: Integer; const T: ITree);  argument
562     procedure SanityCheckParentAndChildIndexes(const Parent: ITree;  argument
570     function DupNode: ITree;  in DupNode()
584     property Parent: ITree read GetParent write SetParent;
1128       FINVALID_NODE: ITree;
1132     class property INVALID_NODE: ITree read FINVALID_NODE;
1135   TBaseTree = class abstract(TANTLRObject, IBaseTree, ITree)
1138     function GetParent: ITree; virtual;
1139     procedure SetParent(const Value: ITree); virtual;
1148     function DupNode: ITree; virtual; abstract;
1154     function GetChild(const I: Integer): ITree; virtual;
1155     procedure AddChild(const T: ITree);
1164     procedure SetChild(const I: Integer; const T: ITree); virtual;
1167     procedure SanityCheckParentAndChildIndexes(const Parent: ITree;
1182     constructor Create(const ANode: ITree); overload;
1225     function GetParent: ITree; override;  in GetParent()
1226     procedure SetParent(const Value: ITree); override;  argument
1227     function DupNode: ITree; override;  in DupNode()
1473     function DupNode: ITree; override;  in DupNode()
2021     FCurrentEnumerationNode: ITree;
2132 procedure TBaseTree.AddChild(const T: ITree);
2188 constructor TBaseTree.Create(const ANode: ITree);
2215   Child: ITree;
2236 function TBaseTree.GetChild(const I: Integer): ITree;  in GetChild()
2273 function TBaseTree.GetParent: ITree;  in GetParent()
2362 procedure TBaseTree.SanityCheckParentAndChildIndexes(const Parent: ITree;
2384 procedure TBaseTree.SetChild(const I: Integer; const T: ITree);
2407 procedure TBaseTree.SetParent(const Value: ITree);
2474 function TCommonTree.DupNode: ITree;  in DupNode()
2515 function TCommonTree.GetParent: ITree;  in GetParent()
2517   Result := ITree(FParent);
2572 procedure TCommonTree.SetParent(const Value: ITree);
2681     (T as ITree).AddChild(Child as ITree);
2687   NewRootTree, OldRootTree: ITree;
2690   NewRootTree := NewRoot as ITree;
2691   OldRootTree := OldRoot as ITree;
2759   Result := (T as ITree).DeleteChild(I);
2800   Result := (T as ITree).GetChild(I);
2805   Result := (T as ITree).ChildCount;
2815   Result := (T as ITree).Text;
2837   Result := (Tree as ITree).IsNil;
2843   R: ITree;
2845   R := Root as ITree;
2865   (T as ITree).SetChild(I, Child as ITree);
2904     Result := (TreeNode as ITree).DupNode;
2913     Result := (T as ITree).GetChild(I);
2921     Result := (T as ITree).ChildCount;
2926   Result := (T as ITree).ChildIndex;
2934     Result := (T as ITree).Text;
2942     Result := (T as ITree).TokenType;
2948   Result := (T as ITree).Parent;
2967     Result := (T as ITree).TokenStartIndex;
2976     Result := (T as ITree).TokenStopIndex;
2983     (Parent as ITree).ReplaceChildren(StartChildIndex, StopChildIndex, T);
2989   (T as ITree).ChildIndex := Index;
2994   (T as ITree).Parent := (Parent as ITree);
3014     (T as ITree).TokenStartIndex := Start;
3015     (T as ITree).TokenStopIndex := Stop;
3414 function TParseTree.DupNode: ITree;  in DupNode()
4749     FCurrentEnumerationNode := HandleRootNode as ITree;
4756     FCurrentEnumerationNode := VisitChild(FCurrentChildIndex) as ITree;
4764     FCurrentEnumerationNode := VisitChild(FCurrentChildIndex) as ITree;