blob: a3e74cbd896baab81f5474e5b9bb209fc3ad8b3e (
plain)
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
/****************************************************************************
**
** Copyright (C) 2001-2004 Roberto Raggi
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the qt3to4 porting application of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef TREEWALKER_H
#define TREEWALKER_H
#include "ast.h"
QT_BEGIN_NAMESPACE
class TreeWalker
{
public:
TreeWalker() {}
virtual ~TreeWalker() {}
virtual void parseNode(AST *node);
virtual void parseTemplateArgumentList(TemplateArgumentListAST *node);
virtual void parseClassOrNamespaceName(ClassOrNamespaceNameAST *node);
virtual void parseName(NameAST *node);
virtual void parseTypeParameter(TypeParameterAST *node);
virtual void parseDeclaration(DeclarationAST *node);
virtual void parseAccessDeclaration(AccessDeclarationAST *node);
virtual void parseTypeSpecifier(TypeSpecifierAST *node);
virtual void parseBaseSpecifier(BaseSpecifierAST *node);
virtual void parseBaseClause(BaseClauseAST *node);
virtual void parseClassSpecifier(ClassSpecifierAST *node);
virtual void parseEnumerator(EnumeratorAST *node);
virtual void parseEnumSpecifier(EnumSpecifierAST *node);
virtual void parseElaboratedTypeSpecifier(ElaboratedTypeSpecifierAST *node);
virtual void parseLinkageBody(LinkageBodyAST *node);
virtual void parseLinkageSpecification(LinkageSpecificationAST *node);
virtual void parseNamespace(NamespaceAST *node);
virtual void parseNamespaceAlias(NamespaceAliasAST *node);
virtual void parseUsing(UsingAST *node);
virtual void parseUsingDirective(UsingDirectiveAST *node);
virtual void parseDeclarator(DeclaratorAST *node);
virtual void parseParameterDeclaration(ParameterDeclarationAST *node);
virtual void parseParameterDeclarationList(ParameterDeclarationListAST *node);
virtual void parseParameterDeclarationClause(ParameterDeclarationClauseAST *node);
virtual void parseInitDeclarator(InitDeclaratorAST *node);
virtual void parseInitDeclaratorList(InitDeclaratorListAST *node);
virtual void parseTypedef(TypedefAST *node);
virtual void parseTemplateParameter(TemplateParameterAST *node);
virtual void parseTemplateParameterList(TemplateParameterListAST *node);
virtual void parseTemplateDeclaration(TemplateDeclarationAST *node);
virtual void parseSimpleDeclaration(SimpleDeclarationAST *node);
virtual void parseStatement(StatementAST *node);
virtual void parseExpressionStatement(ExpressionStatementAST *node);
virtual void parseCondition(ConditionAST *node);
virtual void parseIfStatement(IfStatementAST *node);
virtual void parseWhileStatement(WhileStatementAST *node);
virtual void parseDoStatement(DoStatementAST *node);
virtual void parseForStatement(ForStatementAST *node);
virtual void parseSwitchStatement(SwitchStatementAST *node);
virtual void parseLabeledStatement(LabeledStatementAST *node);
virtual void parseReturnStatement(ReturnStatementAST *node);
virtual void parseStatementList(StatementListAST *node);
virtual void parseDeclarationStatement(DeclarationStatementAST *node);
virtual void parseFunctionDefinition(FunctionDefinitionAST *node);
virtual void parseTranslationUnit(TranslationUnitAST *node);
virtual void parseExpression(AbstractExpressionAST *node);
virtual void parseBinaryExpression(BinaryExpressionAST *node);
};
inline void TreeWalker::parseNode(AST *node)
{
if (!node)
return;
switch(node->nodeType()) {
case NodeType_Declaration:
case NodeType_AccessDeclaration:
case NodeType_LinkageSpecification:
case NodeType_Namespace:
case NodeType_NamespaceAlias:
case NodeType_Using:
case NodeType_UsingDirective:
case NodeType_Typedef:
case NodeType_TemplateDeclaration:
case NodeType_SimpleDeclaration:
case NodeType_FunctionDefinition:
parseDeclaration(static_cast<DeclarationAST*>(node));
break;
case NodeType_Statement:
case NodeType_ExpressionStatement:
case NodeType_IfStatement:
case NodeType_WhileStatement:
case NodeType_DoStatement:
case NodeType_ForStatement:
case NodeType_SwitchStatement:
case NodeType_LabeledStatement:
case NodeType_StatementList:
case NodeType_DeclarationStatement:
case NodeType_ReturnStatement:
parseStatement(static_cast<StatementAST*>(node));
break;
case NodeType_TypeSpecifier:
case NodeType_ClassSpecifier:
case NodeType_EnumSpecifier:
case NodeType_ElaboratedTypeSpecifier:
parseTypeSpecifier(static_cast<TypeSpecifierAST*>(node));
break;
case NodeType_TemplateArgumentList:
parseTemplateArgumentList(static_cast<TemplateArgumentListAST*>(node));
break;
case NodeType_ClassOrNamespaceName:
parseClassOrNamespaceName(static_cast<ClassOrNamespaceNameAST*>(node));
break;
case NodeType_Name:
parseName(static_cast<NameAST*>(node));
break;
case NodeType_TypeParameter:
parseTypeParameter(static_cast<TypeParameterAST*>(node));
break;
case NodeType_BaseSpecifier:
parseBaseSpecifier(static_cast<BaseSpecifierAST*>(node));
break;
case NodeType_BaseClause:
parseBaseClause(static_cast<BaseClauseAST*>(node));
break;
case NodeType_Enumerator:
parseEnumerator(static_cast<EnumeratorAST*>(node));
break;
case NodeType_LinkageBody:
parseLinkageBody(static_cast<LinkageBodyAST*>(node));
break;
case NodeType_Declarator:
parseDeclarator(static_cast<DeclaratorAST*>(node));
break;
case NodeType_ParameterDeclaration:
parseParameterDeclaration(static_cast<ParameterDeclarationAST*>(node));
break;
case NodeType_ParameterDeclarationList:
parseParameterDeclarationList(static_cast<ParameterDeclarationListAST*>(node));
break;
case NodeType_ParameterDeclarationClause:
parseParameterDeclarationClause(static_cast<ParameterDeclarationClauseAST*>(node));
break;
case NodeType_InitDeclarator:
parseInitDeclarator(static_cast<InitDeclaratorAST*>(node));
break;
case NodeType_InitDeclaratorList:
parseInitDeclaratorList(static_cast<InitDeclaratorListAST*>(node));
break;
case NodeType_TemplateParameter:
parseTemplateParameter(static_cast<TemplateParameterAST*>(node));
break;
case NodeType_TemplateParameterList:
parseTemplateParameterList(static_cast<TemplateParameterListAST*>(node));
break;
case NodeType_Condition:
parseCondition(static_cast<ConditionAST*>(node));
break;
case NodeType_TranslationUnit:
parseTranslationUnit(static_cast<TranslationUnitAST*>(node));
break;
case NodeType_BinaryExpression:
parseBinaryExpression(static_cast<BinaryExpressionAST*>(node));
break;
case NodeType_Expression:
case NodeType_PrimaryExpression:
case NodeType_PostfixExpression:
case NodeType_Subscripting:
case NodeType_FunctionCall:
case NodeType_ExplicitTypeConversion:
case NodeType_PseudoConstructorCall:
case NodeType_ClassMemberAccess:
case NodeType_IncrDecr:
case NodeType_CppCastExpression:
case NodeType_TypeIdentification:
case NodeType_UnaryExpression:
case NodeType_NewExpression:
case NodeType_NewTypeId:
case NodeType_NewDeclarator:
case NodeType_NewInitializer:
case NodeType_DeleteExpression:
case NodeType_CastExpression:
case NodeType_ConditionalExpression:
case NodeType_ThrowExpression:
parseExpression(static_cast<AbstractExpressionAST*>(node));
break;
}
}
QT_END_NAMESPACE
#endif // TREEWALKER_H
|
