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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the utils of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** 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.
**
** 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.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef NFA_H
#define NFA_H
#include <QMap>
#include <QHash>
#include <QString>
#include <QVector>
#include <QDebug>
#include <QStack>
#include <QByteArray>
#include "global.h"
typedef QHash<InputType, int> TransitionMap;
struct State
{
QString symbol;
TransitionMap transitions;
};
inline QDataStream &operator<<(QDataStream &stream, const State &state)
{
return stream << state.symbol << state.transitions;
}
inline QDataStream &operator>>(QDataStream &stream, State &state)
{
return stream >> state.symbol >> state.transitions;
}
struct DFA : public QVector<State>
{
void debug() const;
DFA minimize() const;
};
class NFA
{
public:
static NFA createSingleInputNFA(InputType input);
static NFA createSymbolNFA(const QString &symbol);
static NFA createAlternatingNFA(const NFA &a, const NFA &b);
static NFA createConcatenatingNFA(const NFA &a, const NFA &b);
static NFA createOptionalNFA(const NFA &a);
// convenience
static NFA createStringNFA(const QByteArray &str);
static NFA createSetNFA(const QSet<InputType> &set);
static NFA createZeroOrOneNFA(const NFA &a);
static NFA applyQuantity(const NFA &a, int minOccurrences, int maxOccurrences);
void setTerminationSymbol(const QString &symbol);
DFA toDFA() const;
inline bool isEmpty() const { return states.isEmpty(); }
inline int stateCount() const { return states.count(); }
void debug();
private:
void initialize(int size);
void addTransition(int from, InputType input, int to);
void copyFrom(const NFA &other, int baseState);
void initializeFromPair(const NFA &a, const NFA &b,
int *initialA, int *finalA,
int *initialB, int *finalB);
QSet<int> epsilonClosure(const QSet<int> &initialClosure) const;
inline void assertValidState(int state)
{ Q_UNUSED(state); Q_ASSERT(state >= 0); Q_ASSERT(state < states.count()); }
#if defined(AUTOTEST)
public:
#endif
int initialState;
int finalState;
QVector<State> states;
};
#endif // NFA_H
|
