diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-15 15:51:21 -0600 |
|---|---|---|
| committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-15 15:51:21 -0600 |
| commit | b6ba5d642f3fc7d320e3d6f4650eb259a3a52b04 (patch) | |
| tree | 76f49820693d443128d3720322ff1605e9bcd558 /lib/antlr/antlr | |
| parent | 247f828db1b8dcdc9346c1568d81cfa00db99c9e (diff) | |
| download | tdevelop-b6ba5d642f3fc7d320e3d6f4650eb259a3a52b04.tar.gz tdevelop-b6ba5d642f3fc7d320e3d6f4650eb259a3a52b04.zip | |
Rename a number of old tq methods that are no longer tq specific
Diffstat (limited to 'lib/antlr/antlr')
| -rw-r--r-- | lib/antlr/antlr/AST.hpp | 4 | ||||
| -rw-r--r-- | lib/antlr/antlr/ASTFactory.hpp | 2 | ||||
| -rw-r--r-- | lib/antlr/antlr/BaseAST.hpp | 4 |
3 files changed, 5 insertions, 5 deletions
diff --git a/lib/antlr/antlr/AST.hpp b/lib/antlr/antlr/AST.hpp index b14b123b..b01a60a9 100644 --- a/lib/antlr/antlr/AST.hpp +++ b/lib/antlr/antlr/AST.hpp @@ -63,10 +63,10 @@ public: /// Add a node to the end of the child list for this node virtual void addChild(RefAST c) = 0; - /// Get the number of tqchildren. Returns 0 if the node is a leaf + /// Get the number of children. Returns 0 if the node is a leaf virtual size_t getNumberOfChildren() const = 0; - /// Get the first child of this node; null if no tqchildren + /// Get the first child of this node; null if no children virtual RefAST getFirstChild() const = 0; /// Get the next sibling in line after this one virtual RefAST getNextSibling() const = 0; diff --git a/lib/antlr/antlr/ASTFactory.hpp b/lib/antlr/antlr/ASTFactory.hpp index 0fb78dc1..968ab6c5 100644 --- a/lib/antlr/antlr/ASTFactory.hpp +++ b/lib/antlr/antlr/ASTFactory.hpp @@ -86,7 +86,7 @@ public: RefAST dupTree(RefAST t); /** Make a tree from a list of nodes. The first element in the * array is the root. If the root is null, then the tree is - * a simple list not a tree. Handles null tqchildren nodes correctly. + * a simple list not a tree. Handles null children nodes correctly. * For example, make(a, b, null, c) yields tree (a b c). make(null,a,b) * yields tree (nil a b). */ diff --git a/lib/antlr/antlr/BaseAST.hpp b/lib/antlr/antlr/BaseAST.hpp index 3a88db32..1bfc4e56 100644 --- a/lib/antlr/antlr/BaseAST.hpp +++ b/lib/antlr/antlr/BaseAST.hpp @@ -96,7 +96,7 @@ public: */ virtual size_t getNumberOfChildren() const; - /// Get the first child of this node; null if no tqchildren + /// Get the first child of this node; null if no children virtual RefAST getFirstChild() const { return RefAST(down); @@ -118,7 +118,7 @@ public: return 0; } - /// Remove all tqchildren + /// Remove all children virtual void removeChildren() { down = static_cast<BaseAST*>(static_cast<AST*>(nullAST)); |