This repository was archived by the owner on Jun 24, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathParserTokens.h
More file actions
300 lines (275 loc) · 9.46 KB
/
ParserTokens.h
File metadata and controls
300 lines (275 loc) · 9.46 KB
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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
/*
* Copyright (C) 2010, 2013 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. AND ITS CONTRIBUTORS ``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 ITS 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.
*/
#pragma once
#include <limits.h>
#include <stdint.h>
namespace JSC {
class Identifier;
enum {
// Token Bitfield: 0b000000000RTE00IIIIPPPPKUXXXXXXXX
// R = right-associative bit
// T = unterminated error flag
// E = error flag
// I = binary operator allows 'in'
// P = binary operator precedence
// K = keyword flag
// U = unary operator flag
//
// We must keep the upper 8bit (1byte) region empty. JSTokenType must be 24bits.
UnaryOpTokenFlag = 1 << 8,
KeywordTokenFlag = 1 << 9,
BinaryOpTokenPrecedenceShift = 10,
BinaryOpTokenAllowsInPrecedenceAdditionalShift = 4,
BinaryOpTokenPrecedenceMask = 15 << BinaryOpTokenPrecedenceShift,
ErrorTokenFlag = 1 << (BinaryOpTokenAllowsInPrecedenceAdditionalShift + BinaryOpTokenPrecedenceShift + 6),
UnterminatedErrorTokenFlag = ErrorTokenFlag << 1,
RightAssociativeBinaryOpTokenFlag = UnterminatedErrorTokenFlag << 1
};
#define BINARY_OP_PRECEDENCE(prec) (((prec) << BinaryOpTokenPrecedenceShift) | ((prec) << (BinaryOpTokenPrecedenceShift + BinaryOpTokenAllowsInPrecedenceAdditionalShift)))
#define IN_OP_PRECEDENCE(prec) ((prec) << (BinaryOpTokenPrecedenceShift + BinaryOpTokenAllowsInPrecedenceAdditionalShift))
enum JSTokenType {
NULLTOKEN = KeywordTokenFlag,
TRUETOKEN,
FALSETOKEN,
BREAK,
CASE,
DEFAULT,
FOR,
NEW,
VAR,
CONSTTOKEN,
CONTINUE,
FUNCTION,
RETURN,
IF,
THISTOKEN,
DO,
WHILE,
SWITCH,
WITH,
RESERVED,
RESERVED_IF_STRICT,
THROW,
TRY,
CATCH,
FINALLY,
DEBUGGER,
ELSE,
IMPORT,
EXPORT_,
CLASSTOKEN,
EXTENDS,
SUPER,
// Contextual keywords
LET,
YIELD,
AWAIT,
FirstContextualKeywordToken = LET,
LastContextualKeywordToken = AWAIT,
FirstSafeContextualKeywordToken = AWAIT,
LastSafeContextualKeywordToken = LastContextualKeywordToken,
OPENBRACE = 0,
CLOSEBRACE,
OPENPAREN,
CLOSEPAREN,
OPENBRACKET,
CLOSEBRACKET,
COMMA,
QUESTION,
BACKQUOTE,
INTEGER,
DOUBLE,
BIGINT,
IDENT,
PRIVATENAME,
STRING,
TEMPLATE,
REGEXP,
SEMICOLON,
COLON,
DOT,
EOFTOK,
EQUAL,
PLUSEQUAL,
MINUSEQUAL,
MULTEQUAL,
DIVEQUAL,
LSHIFTEQUAL,
RSHIFTEQUAL,
URSHIFTEQUAL,
MODEQUAL,
POWEQUAL,
BITANDEQUAL,
BITXOREQUAL,
BITOREQUAL,
COALESCEEQUAL,
OREQUAL,
ANDEQUAL,
DOTDOTDOT,
ARROWFUNCTION,
QUESTIONDOT,
LastUntaggedToken,
// Begin tagged tokens
PLUSPLUS = 0 | UnaryOpTokenFlag,
MINUSMINUS = 1 | UnaryOpTokenFlag,
AUTOPLUSPLUS = 2 | UnaryOpTokenFlag,
AUTOMINUSMINUS = 3 | UnaryOpTokenFlag,
EXCLAMATION = 4 | UnaryOpTokenFlag,
TILDE = 5 | UnaryOpTokenFlag,
TYPEOF = 6 | UnaryOpTokenFlag | KeywordTokenFlag,
VOIDTOKEN = 7 | UnaryOpTokenFlag | KeywordTokenFlag,
DELETETOKEN = 8 | UnaryOpTokenFlag | KeywordTokenFlag,
COALESCE = 0 | BINARY_OP_PRECEDENCE(1),
OR = 0 | BINARY_OP_PRECEDENCE(2),
AND = 0 | BINARY_OP_PRECEDENCE(3),
BITOR = 0 | BINARY_OP_PRECEDENCE(4),
BITXOR = 0 | BINARY_OP_PRECEDENCE(5),
BITAND = 0 | BINARY_OP_PRECEDENCE(6),
EQEQ = 0 | BINARY_OP_PRECEDENCE(7),
NE = 1 | BINARY_OP_PRECEDENCE(7),
STREQ = 2 | BINARY_OP_PRECEDENCE(7),
STRNEQ = 3 | BINARY_OP_PRECEDENCE(7),
LT = 0 | BINARY_OP_PRECEDENCE(8),
GT = 1 | BINARY_OP_PRECEDENCE(8),
LE = 2 | BINARY_OP_PRECEDENCE(8),
GE = 3 | BINARY_OP_PRECEDENCE(8),
INSTANCEOF = 4 | BINARY_OP_PRECEDENCE(8) | KeywordTokenFlag,
INTOKEN = 5 | IN_OP_PRECEDENCE(8) | KeywordTokenFlag,
LSHIFT = 0 | BINARY_OP_PRECEDENCE(9),
RSHIFT = 1 | BINARY_OP_PRECEDENCE(9),
URSHIFT = 2 | BINARY_OP_PRECEDENCE(9),
PLUS = 0 | BINARY_OP_PRECEDENCE(10) | UnaryOpTokenFlag,
MINUS = 1 | BINARY_OP_PRECEDENCE(10) | UnaryOpTokenFlag,
TIMES = 0 | BINARY_OP_PRECEDENCE(11),
DIVIDE = 1 | BINARY_OP_PRECEDENCE(11),
MOD = 2 | BINARY_OP_PRECEDENCE(11),
POW = 0 | BINARY_OP_PRECEDENCE(12) | RightAssociativeBinaryOpTokenFlag, // Make sure that POW has the highest operator precedence.
ERRORTOK = 0 | ErrorTokenFlag,
UNTERMINATED_IDENTIFIER_ESCAPE_ERRORTOK = 0 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
INVALID_IDENTIFIER_ESCAPE_ERRORTOK = 1 | ErrorTokenFlag,
UNTERMINATED_IDENTIFIER_UNICODE_ESCAPE_ERRORTOK = 2 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
INVALID_IDENTIFIER_UNICODE_ESCAPE_ERRORTOK = 3 | ErrorTokenFlag,
UNTERMINATED_MULTILINE_COMMENT_ERRORTOK = 4 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
UNTERMINATED_NUMERIC_LITERAL_ERRORTOK = 5 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
UNTERMINATED_OCTAL_NUMBER_ERRORTOK = 6 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
INVALID_NUMERIC_LITERAL_ERRORTOK = 7 | ErrorTokenFlag,
UNTERMINATED_STRING_LITERAL_ERRORTOK = 8 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
INVALID_STRING_LITERAL_ERRORTOK = 9 | ErrorTokenFlag,
INVALID_PRIVATE_NAME_ERRORTOK = 10 | ErrorTokenFlag,
UNTERMINATED_HEX_NUMBER_ERRORTOK = 11 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
UNTERMINATED_BINARY_NUMBER_ERRORTOK = 12 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
UNTERMINATED_TEMPLATE_LITERAL_ERRORTOK = 13 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
UNTERMINATED_REGEXP_LITERAL_ERRORTOK = 14 | ErrorTokenFlag | UnterminatedErrorTokenFlag,
INVALID_TEMPLATE_LITERAL_ERRORTOK = 15 | ErrorTokenFlag,
UNEXPECTED_ESCAPE_ERRORTOK = 16 | ErrorTokenFlag,
INVALID_UNICODE_ENCODING_ERRORTOK = 17 | ErrorTokenFlag,
INVALID_IDENTIFIER_UNICODE_ERRORTOK = 18 | ErrorTokenFlag,
};
static_assert(static_cast<unsigned>(POW) <= 0x00ffffffU, "JSTokenType must be 24bits.");
struct JSTextPosition {
JSTextPosition() = default;
JSTextPosition(int _line, int _offset, int _lineStartOffset)
: line(_line)
, offset(_offset)
, lineStartOffset(_lineStartOffset)
{
checkConsistency();
}
JSTextPosition operator+(int adjustment) const { return JSTextPosition(line, offset + adjustment, lineStartOffset); }
JSTextPosition operator+(unsigned adjustment) const { return *this + static_cast<int>(adjustment); }
JSTextPosition operator-(int adjustment) const { return *this + (- adjustment); }
JSTextPosition operator-(unsigned adjustment) const { return *this + (- static_cast<int>(adjustment)); }
operator int() const { return offset; }
bool operator==(const JSTextPosition& other) const
{
return line == other.line
&& offset == other.offset
&& lineStartOffset == other.lineStartOffset;
}
bool operator!=(const JSTextPosition& other) const
{
return !(*this == other);
}
int column() const { return offset - lineStartOffset; }
void checkConsistency()
{
// FIXME: We should test ASSERT(offset >= lineStartOffset); but that breaks a lot of tests.
ASSERT(line >= 0);
ASSERT(offset >= 0);
ASSERT(lineStartOffset >= 0);
}
// FIXME: these should be unsigned.
int line { -1 };
int offset { -1 };
int lineStartOffset { -1 };
};
union JSTokenData {
struct {
const Identifier* cooked;
const Identifier* raw;
bool isTail;
};
struct {
uint32_t line;
uint32_t offset;
uint32_t lineStartOffset;
};
double doubleValue;
struct {
const Identifier* ident;
bool escaped;
};
struct {
const Identifier* bigIntString;
uint8_t radix;
};
struct {
const Identifier* pattern;
const Identifier* flags;
};
};
struct JSTokenLocation {
JSTokenLocation() = default;
int line { 0 };
unsigned lineStartOffset { 0 };
unsigned startOffset { 0 };
unsigned endOffset { 0 };
};
struct JSToken {
JSTokenType m_type { ERRORTOK };
JSTokenData m_data { { nullptr, nullptr, false } };
JSTokenLocation m_location;
JSTextPosition m_startPosition;
JSTextPosition m_endPosition;
};
ALWAYS_INLINE bool isUpdateOp(JSTokenType token)
{
return token >= PLUSPLUS && token <= AUTOMINUSMINUS;
}
ALWAYS_INLINE bool isUnaryOp(JSTokenType token)
{
return token & UnaryOpTokenFlag;
}
} // namespace JSC