blob: efa50272c028ecd22bd0ca77c0e88af9d0b1e09a (
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
|
/****************************************************************************
**
** Copyright (C) 2021 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the tools applications of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:COMM$
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** $QT_END_LICENSE$
**
**
**
**
**
**
**
**
****************************************************************************/
#ifndef PARSER_H
#define PARSER_H
#include "symbols.h"
#include <stack>
QT_BEGIN_NAMESPACE
class Parser
{
public:
Parser():index(0), displayWarnings(true), displayNotes(true) {}
Symbols symbols;
int index;
bool displayWarnings;
bool displayNotes;
struct IncludePath
{
inline explicit IncludePath(const QByteArray &_path)
: path(_path), isFrameworkPath(false) {}
QByteArray path;
bool isFrameworkPath;
};
QList<IncludePath> includes;
std::stack<QByteArray, QByteArrayList> currentFilenames;
inline bool hasNext() const { return (index < symbols.size()); }
inline Token next() { if (index >= symbols.size()) return NOTOKEN; return symbols.at(index++).token; }
bool test(Token);
void next(Token);
void next(Token, const char *msg);
inline void prev() {--index;}
inline Token lookup(int k = 1);
inline const Symbol &symbol_lookup(int k = 1) { return symbols.at(index-1+k);}
inline Token token() { return symbols.at(index-1).token;}
inline QByteArray lexem() { return symbols.at(index-1).lexem();}
inline QByteArray unquotedLexem() { return symbols.at(index-1).unquotedLexem();}
inline const Symbol &symbol() { return symbols.at(index-1);}
Q_NORETURN void error(int rollback);
Q_NORETURN void error(const char *msg = nullptr);
void warning(const char * = nullptr);
void note(const char * = nullptr);
};
inline bool Parser::test(Token token)
{
if (index < symbols.size() && symbols.at(index).token == token) {
++index;
return true;
}
return false;
}
inline Token Parser::lookup(int k)
{
const int l = index - 1 + k;
return l < symbols.size() ? symbols.at(l).token : NOTOKEN;
}
inline void Parser::next(Token token)
{
if (!test(token))
error();
}
inline void Parser::next(Token token, const char *msg)
{
if (!test(token))
error(msg);
}
QT_END_NAMESPACE
#endif
|