1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
#ifndef INC_AST_hpp__
#define INC_AST_hpp__
/**
* <b>SOFTWARE RIGHTS</b>
* <p>
* ANTLR 2.6.0 MageLang Insitute, 1999
* <p>
* We reserve no legal rights to the ANTLR--it is fully in the
* public domain. An individual or company may do whatever
* they wish with source code distributed with ANTLR or the
* code generated by ANTLR, including the incorporation of
* ANTLR, or its output, into commerical software.
* <p>
* We encourage users to develop software with ANTLR. However,
* we do ask that credit is given to us for developing
* ANTLR. By "credit", we mean that if you use ANTLR or
* incorporate any source code into one of your programs
* (commercial product, research project, or otherwise) that
* you acknowledge this fact somewhere in the documentation,
* research report, etc... If you like ANTLR and have
* developed a nice tool with the output, please mention that
* you developed it using ANTLR. In addition, we ask that the
* headers remain intact in our source code. As long as these
* guidelines are kept, we expect to continue enhancing this
* system and expect to make other tools available as they are
* completed.
* <p>
* The ANTLR gang:
* @version ANTLR 2.6.0 MageLang Insitute, 1999
* @author Terence Parr, <a href=http://www.MageLang.com>MageLang Institute</a>
* @author <br>John Lilley, <a href=http://www.Empathy.com>Empathy Software</a>
* @author <br><a href="mailto:pete@yamuna.demon.co.uk">Pete Wells</a>
*/
#include "Antlr/config.hpp"
#include "Antlr/ASTNode.hpp"
#include <vector>
class AST {
public:
AST(ASTNode* n);
~AST();
const ASTNode* getNode() const;
ASTNode* getNode();
void addChild(RefAST c);
bool equals(const AST* t) const;
bool equalsList(const AST* t) const;
bool equalsListPartial(const AST* t) const;
bool equalsTree(const AST* t) const;
bool equalsTreePartial(const AST* t) const;
std::vector<const AST*> findAll(RefAST t) const;
std::vector<const AST*> findAllPartial(RefAST t) const;
RefAST getFirstChild() const;
RefAST getNextSibling() const;
std::string getText() const;
int getType() const;
void initialize(int t,const std::string& txt);
void initialize(const AST* t);
void initialize(RefToken t);
void removeChildren();
void setFirstChild(RefAST c);
void setNextSibling(RefAST n);
void setText(const std::string& txt);
void setType(int type);
std::string toString() const;
std::string toStringList() const;
std::string toStringTree() const;
// Sharon added:
#include "ASTDebug.hpp"
void iterativeRemoveChildren(bool doSiblings, int level = 0);
void deleteNode(int /*level*/)
{
if (node)
{
//int nLine = node->debug(level); // debugger
delete node;
}
node = NULL;
}
AST * getPreviousSibling() { return prev; }
void setPreviousSibling(AST * node) { prev = node; }
private:
RefAST down;
RefAST right;
ASTNode* node;
// Sharon added, for iterativeRemoveChildren:
AST * prev;
void doWorkForFindAll(std::vector<const AST*>& v,
RefAST target,bool partialMatch) const;
AST();
AST(const AST& other);
AST& operator=(const AST& other);
};
extern RefAST nullAST;
#ifdef NEEDS_OPERATOR_LESS_THAN
inline bool operator<(RefAST l,RefAST r); // {return true;}
#endif
#endif //INC_AST_hpp__
|
