0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
|
8 |
**
|
|
9 |
** $QT_BEGIN_LICENSE:LGPL$
|
|
10 |
** No Commercial Usage
|
|
11 |
** This file contains pre-release code and may not be distributed.
|
|
12 |
** You may use this file in accordance with the terms and conditions
|
|
13 |
** contained in the Technology Preview License Agreement accompanying
|
|
14 |
** this package.
|
|
15 |
**
|
|
16 |
** GNU Lesser General Public License Usage
|
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
18 |
** General Public License version 2.1 as published by the Free Software
|
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
20 |
** packaging of this file. Please review the following information to
|
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
23 |
**
|
|
24 |
** In addition, as a special exception, Nokia gives you certain additional
|
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
27 |
**
|
|
28 |
** If you have questions regarding the use of this file, please contact
|
|
29 |
** Nokia at qt-info@nokia.com.
|
|
30 |
**
|
|
31 |
**
|
|
32 |
**
|
|
33 |
**
|
|
34 |
**
|
|
35 |
**
|
|
36 |
**
|
|
37 |
**
|
|
38 |
** $QT_END_LICENSE$
|
|
39 |
**
|
|
40 |
****************************************************************************/
|
|
41 |
|
|
42 |
//
|
|
43 |
// W A R N I N G
|
|
44 |
// -------------
|
|
45 |
//
|
|
46 |
// This file is not part of the Qt API. It exists purely as an
|
|
47 |
// implementation detail. This header file may change from version to
|
|
48 |
// version without notice, or even be removed.
|
|
49 |
//
|
|
50 |
// We mean it.
|
|
51 |
|
|
52 |
#ifndef Patternist_XsdStateMachine_H
|
|
53 |
#define Patternist_XsdStateMachine_H
|
|
54 |
|
|
55 |
#include "qnamepool_p.h"
|
|
56 |
|
|
57 |
#include <QtCore/QHash>
|
|
58 |
#include <QtCore/QSet>
|
|
59 |
#include <QtCore/QTextStream>
|
|
60 |
|
|
61 |
class QIODevice;
|
|
62 |
|
|
63 |
QT_BEGIN_HEADER
|
|
64 |
|
|
65 |
QT_BEGIN_NAMESPACE
|
|
66 |
|
|
67 |
namespace QPatternist
|
|
68 |
{
|
|
69 |
/**
|
|
70 |
* @short A state machine used for evaluation.
|
|
71 |
*
|
|
72 |
* @ingroup Patternist_schema
|
|
73 |
* @author Tobias Koenig <tobias.koenig@nokia.com>
|
|
74 |
*/
|
|
75 |
template <typename TransitionType>
|
|
76 |
class XsdStateMachine
|
|
77 |
{
|
|
78 |
public:
|
|
79 |
typedef qint32 StateId;
|
|
80 |
|
|
81 |
/**
|
|
82 |
* Describes the type of state.
|
|
83 |
*/
|
|
84 |
enum StateType
|
|
85 |
{
|
|
86 |
StartState, ///< The state the machine will start with.
|
|
87 |
StartEndState, ///< The state the machine will start with, can be end state as well.
|
|
88 |
InternalState, ///< Any state that is not start or end state.
|
|
89 |
EndState ///< Any state where the machine is allowed to stop.
|
|
90 |
};
|
|
91 |
|
|
92 |
/**
|
|
93 |
* Creates a new state machine object.
|
|
94 |
*/
|
|
95 |
XsdStateMachine();
|
|
96 |
|
|
97 |
/**
|
|
98 |
* Creates a new state machine object.
|
|
99 |
*
|
|
100 |
* The name pool to use for accessing object names.
|
|
101 |
*/
|
|
102 |
XsdStateMachine(const NamePool::Ptr &namePool);
|
|
103 |
|
|
104 |
/**
|
|
105 |
* Adds a new state of the given @p type to the state machine.
|
|
106 |
*
|
|
107 |
* @return The id of the new state.
|
|
108 |
*/
|
|
109 |
StateId addState(StateType type);
|
|
110 |
|
|
111 |
/**
|
|
112 |
* Adds a new @p transition to the state machine.
|
|
113 |
*
|
|
114 |
* @param start The start state.
|
|
115 |
* @param transition The transition to come from the start to the end state.
|
|
116 |
* @param end The end state.
|
|
117 |
*/
|
|
118 |
void addTransition(StateId start, TransitionType transition, StateId end);
|
|
119 |
|
|
120 |
/**
|
|
121 |
* Adds a new epsilon @p transition to the state machine.
|
|
122 |
*
|
|
123 |
* @param start The start state.
|
|
124 |
* @param end The end state.
|
|
125 |
*/
|
|
126 |
void addEpsilonTransition(StateId start, StateId end);
|
|
127 |
|
|
128 |
/**
|
|
129 |
* Resets the machine to the start state.
|
|
130 |
*/
|
|
131 |
void reset();
|
|
132 |
|
|
133 |
/**
|
|
134 |
* Removes all states and transitions from the state machine.
|
|
135 |
*/
|
|
136 |
void clear();
|
|
137 |
|
|
138 |
/**
|
|
139 |
* Continues execution of the machine with the given input @p transition.
|
|
140 |
*
|
|
141 |
* @return @c true if the transition was successfull, @c false otherwise.
|
|
142 |
*/
|
|
143 |
bool proceed(TransitionType transition);
|
|
144 |
|
|
145 |
/**
|
|
146 |
* Returns the list of transitions that are reachable from the current
|
|
147 |
* state.
|
|
148 |
*/
|
|
149 |
QList<TransitionType> possibleTransitions() const;
|
|
150 |
|
|
151 |
/**
|
|
152 |
* Continues execution of the machine with the given @p input.
|
|
153 |
*
|
|
154 |
* @note To use this method, inputEqualsTransition must be implemented
|
|
155 |
* to find the right transition to use.
|
|
156 |
*
|
|
157 |
* @return @c true if the transition was successfull, @c false otherwise.
|
|
158 |
*/
|
|
159 |
template <typename InputType>
|
|
160 |
bool proceed(InputType input);
|
|
161 |
|
|
162 |
/**
|
|
163 |
* Returns whether the given @p input matches the given @p transition.
|
|
164 |
*/
|
|
165 |
template <typename InputType>
|
|
166 |
bool inputEqualsTransition(InputType input, TransitionType transition) const;
|
|
167 |
|
|
168 |
/**
|
|
169 |
* Returns whether the machine is in an allowed end state.
|
|
170 |
*/
|
|
171 |
bool inEndState() const;
|
|
172 |
|
|
173 |
/**
|
|
174 |
* Returns the last transition that was taken.
|
|
175 |
*/
|
|
176 |
TransitionType lastTransition() const;
|
|
177 |
|
|
178 |
/**
|
|
179 |
* Returns the start state of the machine.
|
|
180 |
*/
|
|
181 |
StateId startState() const;
|
|
182 |
|
|
183 |
/**
|
|
184 |
* This method should be redefined by template specialization for every
|
|
185 |
* concret TransitionType.
|
|
186 |
*/
|
|
187 |
QString transitionTypeToString(TransitionType type) const;
|
|
188 |
|
|
189 |
/**
|
|
190 |
* Outputs the state machine in DOT format to the given
|
|
191 |
* output @p device.
|
|
192 |
*/
|
|
193 |
bool outputGraph(QIODevice *device, const QString &graphName) const;
|
|
194 |
|
|
195 |
/**
|
|
196 |
* Returns a DFA that is equal to the NFA of the state machine.
|
|
197 |
*/
|
|
198 |
XsdStateMachine<TransitionType> toDFA() const;
|
|
199 |
|
|
200 |
/**
|
|
201 |
* Returns the information of all states of the state machine.
|
|
202 |
*/
|
|
203 |
QHash<StateId, StateType> states() const;
|
|
204 |
|
|
205 |
/**
|
|
206 |
* Returns the information of all transitions of the state machine.
|
|
207 |
*/
|
|
208 |
QHash<StateId, QHash<TransitionType, QVector<StateId> > > transitions() const;
|
|
209 |
|
|
210 |
private:
|
|
211 |
/**
|
|
212 |
* Returns the DFA state for the given @p nfaStat from the given @p stateTable.
|
|
213 |
* If there is no corresponding DFA state yet, a new one is created.
|
|
214 |
*/
|
|
215 |
StateId dfaStateForNfaState(QSet<StateId> nfaState, QList< QPair< QSet<StateId>, StateId> > &stateTable, XsdStateMachine<TransitionType> &dfa) const;
|
|
216 |
|
|
217 |
/**
|
|
218 |
* Returns the set of all states that can be reached from the set of @p input states
|
|
219 |
* by the epsilon transition.
|
|
220 |
*/
|
|
221 |
QSet<StateId> epsilonClosure(const QSet<StateId> &input) const;
|
|
222 |
|
|
223 |
/**
|
|
224 |
* Returns the set of all states that can be reached from the set of given @p states
|
|
225 |
* by the given @p input.
|
|
226 |
*/
|
|
227 |
QSet<StateId> move(const QSet<StateId> &states, TransitionType input) const;
|
|
228 |
|
|
229 |
NamePool::Ptr m_namePool;
|
|
230 |
QHash<StateId, StateType> m_states;
|
|
231 |
QHash<StateId, QHash<TransitionType, QVector<StateId> > > m_transitions;
|
|
232 |
QHash<StateId, QVector<StateId> > m_epsilonTransitions;
|
|
233 |
StateId m_currentState;
|
|
234 |
qint32 m_counter;
|
|
235 |
TransitionType m_lastTransition;
|
|
236 |
};
|
|
237 |
|
|
238 |
#include "qxsdstatemachine.cpp"
|
|
239 |
}
|
|
240 |
|
|
241 |
QT_END_NAMESPACE
|
|
242 |
|
|
243 |
QT_END_HEADER
|
|
244 |
|
|
245 |
#endif
|