blob: 39fc7ca1ef38fb96ed558fe5abcd78ca1f963555 (
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
236
237
|
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the utils 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$
**
****************************************************************************/
// auto generated. DO NOT EDIT.
class RegExpTokenizer
{
public:
RegExpTokenizer(const QString &inp);
inline QChar next() {
return (pos < input.length()) ? input.at(pos++) : QChar();
}
int lex();
QString input;
int pos;
int lexemStart;
int lexemLength;
};
RegExpTokenizer::RegExpTokenizer(const QString &inp)
{
input = inp;
pos = 0;
lexemStart = 0;
lexemLength = 0;
}
int RegExpTokenizer::lex()
{
lexemStart = pos;
lexemLength = 0;
int lastAcceptingPos = -1;
int token = -1;
QChar ch;
// initial state
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 33)
goto state_1;
if (ch.unicode() == 34)
goto state_2;
if (ch.unicode() >= 35 && ch.unicode() <= 39)
goto state_1;
if (ch.unicode() == 40) {
token = RE2NFA::TOK_LPAREN;
goto found;
}
if (ch.unicode() == 41) {
token = RE2NFA::TOK_RPAREN;
goto found;
}
if (ch.unicode() == 42) {
token = RE2NFA::TOK_STAR;
goto found;
}
if (ch.unicode() == 43) {
token = RE2NFA::TOK_PLUS;
goto found;
}
if (ch.unicode() == 44) {
token = RE2NFA::TOK_COMMA;
goto found;
}
if (ch.unicode() == 45)
goto state_1;
if (ch.unicode() == 46) {
token = RE2NFA::TOK_DOT;
goto found;
}
if (ch.unicode() >= 47 && ch.unicode() <= 62)
goto state_1;
if (ch.unicode() == 63) {
token = RE2NFA::TOK_QUESTION;
goto found;
}
if (ch.unicode() >= 64 && ch.unicode() <= 90)
goto state_1;
if (ch.unicode() == 91)
goto state_10;
if (ch.unicode() == 92)
goto state_11;
if (ch.unicode() >= 93 && ch.unicode() <= 122)
goto state_1;
if (ch.unicode() == 123) {
token = RE2NFA::TOK_LBRACE;
goto found;
}
if (ch.unicode() == 124) {
token = RE2NFA::TOK_OR;
goto found;
}
if (ch.unicode() == 125) {
token = RE2NFA::TOK_RBRACE;
goto found;
}
if (ch.unicode() >= 126)
goto state_1;
goto out;
state_1:
lastAcceptingPos = pos;
token = RE2NFA::TOK_STRING;
goto out;
state_2:
lastAcceptingPos = pos;
token = RE2NFA::TOK_STRING;
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 33)
goto state_15;
if (ch.unicode() == 34)
goto state_16;
if (ch.unicode() >= 35)
goto state_15;
goto out;
state_10:
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 91)
goto state_17;
if (ch.unicode() == 92)
goto state_18;
if (ch.unicode() == 93)
goto state_19;
if (ch.unicode() >= 94)
goto state_17;
goto out;
state_11:
lastAcceptingPos = pos;
token = RE2NFA::TOK_STRING;
ch = next();
if (ch.unicode() >= 1)
goto state_20;
goto out;
state_15:
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 33)
goto state_15;
if (ch.unicode() == 34)
goto state_16;
if (ch.unicode() >= 35)
goto state_15;
goto out;
state_16:
lastAcceptingPos = pos;
token = RE2NFA::TOK_QUOTED_STRING;
goto out;
state_17:
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 91)
goto state_17;
if (ch.unicode() == 92)
goto state_18;
if (ch.unicode() == 93)
goto state_19;
if (ch.unicode() >= 94)
goto state_17;
goto out;
state_18:
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 91)
goto state_17;
if (ch.unicode() == 92)
goto state_18;
if (ch.unicode() == 93)
goto state_21;
if (ch.unicode() >= 94)
goto state_17;
goto out;
state_19:
lastAcceptingPos = pos;
token = RE2NFA::TOK_SEQUENCE;
goto out;
state_20:
lastAcceptingPos = pos;
token = RE2NFA::TOK_STRING;
goto out;
state_21:
lastAcceptingPos = pos;
token = RE2NFA::TOK_SEQUENCE;
ch = next();
if (ch.unicode() >= 1 && ch.unicode() <= 91)
goto state_17;
if (ch.unicode() == 92)
goto state_18;
if (ch.unicode() == 93)
goto state_19;
if (ch.unicode() >= 94)
goto state_17;
goto out;
found:
lastAcceptingPos = pos;
out:
if (lastAcceptingPos != -1) {
lexemLength = lastAcceptingPos - lexemStart;
pos = lastAcceptingPos;
}
return token;
}
|
