0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 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 tools applications 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 |
#ifndef PARSER_H
|
|
43 |
#define PARSER_H
|
|
44 |
|
|
45 |
#include <QStack>
|
|
46 |
#include "symbols.h"
|
|
47 |
|
|
48 |
QT_BEGIN_NAMESPACE
|
|
49 |
|
|
50 |
class Parser
|
|
51 |
{
|
|
52 |
public:
|
|
53 |
Parser():index(0), displayWarnings(true){}
|
|
54 |
Symbols symbols;
|
|
55 |
int index;
|
|
56 |
bool displayWarnings;
|
|
57 |
|
|
58 |
QStack<QByteArray> currentFilenames;
|
|
59 |
|
|
60 |
inline bool hasNext() const { return (index < symbols.size()); }
|
|
61 |
inline Token next() { if (index >= symbols.size()) return NOTOKEN; return symbols.at(index++).token; }
|
|
62 |
bool test(Token);
|
|
63 |
void next(Token);
|
|
64 |
void next(Token, const char *msg);
|
|
65 |
inline void prev() {--index;}
|
|
66 |
inline Token lookup(int k = 1);
|
|
67 |
inline const Symbol &symbol_lookup(int k = 1) { return symbols.at(index-1+k);}
|
|
68 |
inline Token token() { return symbols.at(index-1).token;}
|
|
69 |
inline QByteArray lexem() { return symbols.at(index-1).lexem();}
|
|
70 |
inline QByteArray unquotedLexem() { return symbols.at(index-1).unquotedLexem();}
|
|
71 |
inline const Symbol &symbol() { return symbols.at(index-1);}
|
|
72 |
|
|
73 |
void error(int rollback);
|
|
74 |
void error(const char *msg = 0);
|
|
75 |
void warning(const char * = 0);
|
|
76 |
|
|
77 |
};
|
|
78 |
|
|
79 |
inline bool Parser::test(Token token)
|
|
80 |
{
|
|
81 |
if (index < symbols.size() && symbols.at(index).token == token) {
|
|
82 |
++index;
|
|
83 |
return true;
|
|
84 |
}
|
|
85 |
return false;
|
|
86 |
}
|
|
87 |
|
|
88 |
inline Token Parser::lookup(int k)
|
|
89 |
{
|
|
90 |
const int l = index - 1 + k;
|
|
91 |
return l < symbols.size() ? symbols.at(l).token : NOTOKEN;
|
|
92 |
}
|
|
93 |
|
|
94 |
inline void Parser::next(Token token)
|
|
95 |
{
|
|
96 |
if (!test(token))
|
|
97 |
error();
|
|
98 |
}
|
|
99 |
|
|
100 |
inline void Parser::next(Token token, const char *msg)
|
|
101 |
{
|
|
102 |
if (!test(token))
|
|
103 |
error(msg);
|
|
104 |
}
|
|
105 |
|
|
106 |
QT_END_NAMESPACE
|
|
107 |
|
|
108 |
#endif
|