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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/*
* Copyright (C) 2008 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef Parser_h
#define Parser_h
#include <wtf/Platform.h>
#if ENABLE(WREC)
#include "Escapes.h"
#include "Quantifier.h"
#include "UString.h"
#include "WRECGenerator.h"
#include <wtf/ASCIICType.h>
namespace JSC { namespace WREC {
struct CharacterClass;
class Parser {
typedef Generator::JumpList JumpList;
typedef Generator::ParenthesesType ParenthesesType;
friend class SavedState;
public:
Parser(const UString& pattern, bool ignoreCase, bool multiline)
: m_generator(*this)
, m_data(pattern.data())
, m_size(pattern.size())
, m_ignoreCase(ignoreCase)
, m_multiline(multiline)
{
reset();
}
Generator& generator() { return m_generator; }
bool ignoreCase() const { return m_ignoreCase; }
bool multiline() const { return m_multiline; }
void recordSubpattern() { ++m_numSubpatterns; }
unsigned numSubpatterns() const { return m_numSubpatterns; }
const char* error() const { return m_error; }
const char* syntaxError() const { return m_error == ParenthesesNotSupported ? 0 : m_error; }
void parsePattern(JumpList& failures)
{
reset();
parseDisjunction(failures);
if (peek() != EndOfPattern)
setError(ParenthesesUnmatched); // Parsing the pattern should fully consume it.
}
void parseDisjunction(JumpList& failures);
void parseAlternative(JumpList& failures);
bool parseTerm(JumpList& failures);
bool parseNonCharacterEscape(JumpList& failures, const Escape&);
bool parseParentheses(JumpList& failures);
bool parseCharacterClass(JumpList& failures);
bool parseCharacterClassQuantifier(JumpList& failures, const CharacterClass& charClass, bool invert);
bool parseBackreferenceQuantifier(JumpList& failures, unsigned subpatternId);
private:
class SavedState {
public:
SavedState(Parser& parser)
: m_parser(parser)
, m_index(parser.m_index)
{
}
void restore()
{
m_parser.m_index = m_index;
}
private:
Parser& m_parser;
unsigned m_index;
};
void reset()
{
m_index = 0;
m_numSubpatterns = 0;
m_error = 0;
}
void setError(const char* error)
{
if (m_error)
return;
m_error = error;
}
int peek()
{
if (m_index >= m_size)
return EndOfPattern;
return m_data[m_index];
}
int consume()
{
if (m_index >= m_size)
return EndOfPattern;
return m_data[m_index++];
}
bool peekIsDigit()
{
return WTF::isASCIIDigit(peek());
}
unsigned peekDigit()
{
ASSERT(peekIsDigit());
return peek() - '0';
}
unsigned consumeDigit()
{
ASSERT(peekIsDigit());
return consume() - '0';
}
unsigned consumeNumber()
{
int n = consumeDigit();
while (peekIsDigit()) {
n *= 10;
n += consumeDigit();
}
return n;
}
int consumeHex(int count)
{
int n = 0;
while (count--) {
if (!WTF::isASCIIHexDigit(peek()))
return -1;
n = (n << 4) | WTF::toASCIIHexValue(consume());
}
return n;
}
unsigned consumeOctal()
{
unsigned n = 0;
while (n < 32 && WTF::isASCIIOctalDigit(peek()))
n = n * 8 + consumeDigit();
return n;
}
ALWAYS_INLINE Quantifier consumeGreedyQuantifier();
Quantifier consumeQuantifier();
Escape consumeEscape(bool inCharacterClass);
ParenthesesType consumeParenthesesType();
static const int EndOfPattern = -1;
// Error messages.
static const char* QuantifierOutOfOrder;
static const char* QuantifierWithoutAtom;
static const char* ParenthesesUnmatched;
static const char* ParenthesesTypeInvalid;
static const char* ParenthesesNotSupported;
static const char* CharacterClassUnmatched;
static const char* CharacterClassOutOfOrder;
static const char* EscapeUnterminated;
Generator m_generator;
const UChar* m_data;
unsigned m_size;
unsigned m_index;
bool m_ignoreCase;
bool m_multiline;
unsigned m_numSubpatterns;
const char* m_error;
};
} } // namespace JSC::WREC
#endif // ENABLE(WREC)
#endif // Parser_h
|
