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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
// Copyright (C) 2016 Jochen Becher
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0 WITH Qt-GPL-exception-1.0
#include "qstringparser.h"
// Possible Improvements
// %w: skip optional whitespaces in m_source
// more types: different int types, float, char, word, some character delimited string
// some Q Types: QColor (named, hex rgb)
// introduce public type ParseState which can be got from Parser and gives some info like error state, error index etc
QStringParser::QStringParser(const QString &source)
: m_source(source)
{
}
QStringParser::~QStringParser()
{
}
QStringParser::Parser QStringParser::parse(const QString &pattern)
{
return Parser(m_source, pattern);
}
QStringParser::Parser::Parser(const QString &source, const QString &pattern)
: m_source(source),
m_pattern(pattern)
{
}
QStringParser::Parser::~Parser()
{
evaluate();
qDeleteAll(m_nodes);
}
bool QStringParser::Parser::failed()
{
evaluate();
return m_evaluationFailed;
}
bool QStringParser::Parser::scan(int *i, int *index)
{
*i = 0;
int sign = 1;
while (*index < m_source.length() && m_source.at(*index).isSpace())
++(*index);
if (*index >= m_source.length())
return false;
if (m_source.at(*index) == QLatin1Char('+')) {
++(*index);
} else if (m_source.at(*index) == QLatin1Char('-')) {
sign = -1;
++(*index);
}
if (*index >= m_source.length() || !m_source.at(*index).isDigit())
return false;
while (*index < m_source.length() && m_source.at(*index).isDigit()) {
*i = *i * 10 + m_source.at(*index).digitValue();
++(*index);
}
*i *= sign;
return true;
}
bool QStringParser::Parser::scan(double *d, int *index)
{
int startIndex = *index;
// skip whitespaces
while (*index < m_source.length() && m_source.at(*index).isSpace())
++(*index);
if (*index >= m_source.length())
return false;
// sign
if (m_source.at(*index) == QLatin1Char('+'))
++(*index);
else if (m_source.at(*index) == QLatin1Char('-'))
++(*index);
// int
while (*index < m_source.length() && m_source.at(*index).isDigit())
++(*index);
// point
if (*index < m_source.length() && m_source.at(*index) == QLatin1Char('.'))
++(*index);
// int
while (*index < m_source.length() && m_source.at(*index).isDigit())
++(*index);
// exponent
if (*index < m_source.length() && m_source.at(*index).toLower() == QLatin1Char('e')) {
++(*index);
if (*index >= m_source.length())
return false;
// sign
if (m_source.at(*index) == QLatin1Char('+'))
++(*index);
else if (m_source.at(*index) == QLatin1Char('-'))
++(*index);
// int
while (*index < m_source.length() && m_source.at(*index).isDigit())
++(*index);
}
bool ok = false;
*d = m_source.mid(startIndex, *index - startIndex).toDouble(&ok);
return ok;
}
void QStringParser::Parser::evaluate()
{
if (!m_isEvaluated) {
m_isEvaluated = true;
m_evaluationFailed = false;
int p = 0;
int i = 0;
while (p < m_pattern.length()) {
if (m_pattern.at(p) == QLatin1Char('%')) {
++p;
// a % must be followed by a another char.
if (p >= m_pattern.length()) {
// syntax error in pattern
m_evaluationFailed = true;
return;
}
if (m_pattern.at(p) == QLatin1Char('%')) {
// two %% are handled like a simple % in m_source
++p;
if (i >= m_source.length() || m_source.at(i) != QLatin1Char('%')) {
m_evaluationFailed = true;
return;
}
++i;
} else if (m_pattern.at(p).isDigit()) {
// now extract a value matching the Nth node type
int N = 0;
while (p < m_pattern.length() && m_pattern.at(p).isDigit()) {
N = N * 10 + m_pattern.at(p).digitValue();
++p;
}
if (N < 1 || N > m_nodes.length()) {
// argument out of bounds in pattern
m_evaluationFailed = true;
return;
}
if (!m_nodes.at(N-1)->accept(*this, &i)) {
m_evaluationFailed = true;
return;
}
} else {
// any other % syntax is an error
m_evaluationFailed = true;
return;
}
} else {
if (m_pattern.at(p).isSpace()) {
++p;
// m_source must end or have at least one space
if (i < m_source.length() && !m_source.at(i).isSpace()) {
m_evaluationFailed = true;
return;
}
// skip spaces in m_pattern
while (p < m_pattern.length() && m_pattern.at(p).isSpace())
++p;
// skip spaces in m_source
while (i < m_source.length() && m_source.at(i).isSpace())
++i;
} else if (i >= m_source.length() || m_source.at(i) != m_pattern.at(p)) {
m_evaluationFailed = true;
return;
} else {
++p;
++i;
}
}
}
// m_source and m_pattern must both be scanned completely
if (i < m_source.length() || p < m_pattern.length()) {
m_evaluationFailed = true;
return;
}
}
}
|
