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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the tools applications of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** 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, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.1, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
/*
tokenizer.h
*/
#ifndef TOKENIZER_H
#define TOKENIZER_H
#include <qstack.h>
#include <qstring.h>
#include <stdio.h>
#include "location.h"
QT_BEGIN_NAMESPACE
/*
Here come the C++ tokens we support. The first part contains
all-purpose tokens; then come keywords.
If you add a keyword, make sure to modify the keyword array in
tokenizer.cpp as well, and possibly adjust Tok_FirstKeyword and
Tok_LastKeyword.
*/
enum { Tok_Eoi, Tok_Ampersand, Tok_Aster, Tok_Caret, Tok_LeftParen,
Tok_RightParen, Tok_LeftParenAster, Tok_Equal, Tok_LeftBrace,
Tok_RightBrace, Tok_Semicolon, Tok_Colon, Tok_LeftAngle,
Tok_RightAngle, Tok_Comma, Tok_Ellipsis, Tok_Gulbrandsen,
Tok_LeftBracket, Tok_RightBracket, Tok_Tilde, Tok_SomeOperator,
Tok_Number, Tok_String, Tok_Doc, Tok_Comment, Tok_Ident, Tok_At,
Tok_char, Tok_class, Tok_const, Tok_double, Tok_enum,
Tok_explicit, Tok_friend, Tok_inline, Tok_int, Tok_long,
Tok_namespace, Tok_operator, Tok_private, Tok_protected,
Tok_public, Tok_short, Tok_signals, Tok_signed, Tok_slots,
Tok_static, Tok_struct, Tok_template, Tok_typedef,
Tok_typename, Tok_union, Tok_unsigned, Tok_using, Tok_virtual,
Tok_void, Tok_volatile, Tok_int64, Tok_Q_OBJECT, Tok_Q_OVERRIDE,
Tok_Q_PROPERTY, Tok_Q_DECLARE_SEQUENTIAL_ITERATOR,
Tok_Q_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR,
Tok_Q_DECLARE_ASSOCIATIVE_ITERATOR,
Tok_Q_DECLARE_MUTABLE_ASSOCIATIVE_ITERATOR,
Tok_Q_DECLARE_FLAGS, Tok_Q_SIGNALS, Tok_Q_SLOTS, Tok_QT_COMPAT,
Tok_QT_COMPAT_CONSTRUCTOR, Tok_QT_DEPRECATED, Tok_QT_MOC_COMPAT,
Tok_QT_MODULE, Tok_QT3_SUPPORT, Tok_QT3_SUPPORT_CONSTRUCTOR,
Tok_QT3_MOC_SUPPORT, Tok_QDOC_PROPERTY,
Tok_FirstKeyword = Tok_char, Tok_LastKeyword = Tok_QDOC_PROPERTY };
/*
The Tokenizer class implements lexical analysis of C++ source
files.
Not every operator or keyword of C++ is recognized; only those
that are interesting to us. Some Qt keywords or macros are also
recognized.
*/
class Tokenizer
{
public:
Tokenizer(const Location& loc, const QByteArray &in);
Tokenizer(const Location& loc, FILE *in);
~Tokenizer();
int getToken();
void setParsingFnOrMacro(bool macro) { parsingMacro = macro; }
bool parsingFnOrMacro() const { return parsingMacro; }
const Location &location() const { return yyTokLoc; }
QString previousLexeme() const { return QString(yyPrevLex); }
QString lexeme() const { return QString(yyLex); }
QString version() const { return yyVersion; }
int braceDepth() const { return yyBraceDepth; }
int parenDepth() const { return yyParenDepth; }
int bracketDepth() const { return yyBracketDepth; }
static void initialize(const Config &config);
static void terminate();
static bool isTrue(const QString &condition);
private:
void init();
void start(const Location& loc);
/*
This limit on the length of a lexeme seems fairly high, but a
doc comment can be arbitrarily long. The previous 65,536 limit
was reached by Mark Summerfield.
*/
enum { yyLexBufSize = 524288 };
int getch()
{
return yyPos == yyIn.size() ? EOF : yyIn[yyPos++];
}
inline int getChar()
{
if (yyCh == EOF)
return EOF;
if (yyLexLen < yyLexBufSize - 1) {
yyLex[yyLexLen++] = (char) yyCh;
yyLex[yyLexLen] = '\0';
}
yyCurLoc.advance(yyCh);
int ch = getch();
if (ch == EOF)
return EOF;
// cast explicitely to make sure the value of ch
// is in range [0..255] to avoid assert messages
// when using debug CRT that checks its input.
return int(uint(uchar(ch)));
}
int getTokenAfterPreprocessor();
void pushSkipping(bool skip);
bool popSkipping();
Location yyTokLoc;
Location yyCurLoc;
char *yyLexBuf1;
char *yyLexBuf2;
char *yyPrevLex;
char *yyLex;
size_t yyLexLen;
QStack<bool> yyPreprocessorSkipping;
int yyNumPreprocessorSkipping;
int yyBraceDepth;
int yyParenDepth;
int yyBracketDepth;
int yyCh;
QString yyVersion;
bool parsingMacro;
protected:
QByteArray yyIn;
int yyPos;
};
QT_END_NAMESPACE
#endif
|
