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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** 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 either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** 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.0, 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.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef RE2NFA_H
#define RE2NFA_H
#include "nfa.h"
#include <QSet>
class RE2NFA
{
public:
RE2NFA(const QMap<QString, NFA> ¯os, const QSet<InputType> &maxInputSet, Qt::CaseSensitivity cs);
NFA parse(const QString &expression, int *errorColumn = 0);
private:
NFA parseExpr();
NFA parseBranch();
NFA parsePiece();
NFA parseAtom();
NFA parseMaybeQuantifier(const NFA &nfa);
NFA parseSet();
NFA parseSet2();
NFA createCharNFA();
private:
friend class RegExpTokenizer;
enum Token {
TOK_INVALID,
TOK_STRING,
TOK_LBRACE, // {
TOK_RBRACE, // }
TOK_LBRACKET, // [
TOK_RBRACKET, // ]
TOK_LPAREN, // (
TOK_RPAREN, // )
TOK_COMMA,
TOK_STAR,
TOK_OR,
TOK_QUESTION,
TOK_DOT,
TOK_PLUS,
TOK_SEQUENCE,
TOK_QUOTED_STRING
};
struct Symbol
{
inline Symbol() : token(TOK_INVALID), column(-1) {}
inline Symbol(Token t, const QString &l = QString()) : token(t), lexem(l), column(-1) {}
Token token;
QString lexem;
int column;
};
inline bool hasNext() const { return index < symbols.count(); }
inline Token next() { return symbols.at(index++).token; }
bool next(Token t);
bool test(Token t);
inline void prev() { index--; }
inline const Symbol &symbol() const { return symbols.at(index - 1); }
QString lexemUntil(Token t);
void tokenize(const QString &input);
QMap<QString, NFA> macros;
QVector<Symbol> symbols;
int index;
int errorColumn;
const QSet<InputType> maxInputSet;
Qt::CaseSensitivity caseSensitivity;
};
#endif // RE2NFA_H
|
