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
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
use super::{Input, Lexer};
use enum_kind::Kind;
use slog::Logger;
use swc_common::BytePos;
use token::*;
/// State of lexer.
///
/// Ported from babylon.
#[derive(Debug)]
pub(super) struct State {
pub is_expr_allowed: bool,
pub octal_pos: Option<BytePos>,
/// if line break exists between previous token and new token?
pub had_line_break: bool,
/// TODO: Remove this field.
is_first: bool,
context: Context,
// TODO: Create a new enum `TokenType` instead of cloning token.
token_type: Option<Token>,
}
impl<'a, I: Input> Iterator for Lexer<'a, I> {
type Item = TokenAndSpan;
fn next(&mut self) -> Option<Self::Item> {
self.state.had_line_break = self.state.is_first;
self.state.is_first = false;
// skip spaces before getting next character, if we are allowed to.
if self.state.can_skip_space() {
let start = self.cur_pos();
match self.skip_space() {
Err(err) => {
return Some(Token::Error(err)).map(|token| {
// Attatch span to token.
TokenAndSpan {
token,
had_line_break: self.had_line_break_before_last(),
span: self.span(start),
}
});
}
_ => {}
}
};
let start = self.cur_pos();
let res = if let Some(Type::Tpl {
start: start_pos_of_tpl,
}) = self.state.context.current()
{
self.read_tmpl_token(start_pos_of_tpl).map(Some)
} else {
self.read_token()
};
let token = match res.map_err(Token::Error).map_err(Some) {
Ok(t) => t,
Err(e) => e,
};
if let Some(ref token) = token {
self.state.update(&self.session.logger, start, &token)
}
token.map(|token| {
// Attatch span to token.
TokenAndSpan {
token,
had_line_break: self.had_line_break_before_last(),
span: self.span(start),
}
})
}
}
impl Default for State {
fn default() -> Self {
State {
is_expr_allowed: true,
octal_pos: None,
is_first: true,
had_line_break: false,
context: Context(vec![Type::BraceStmt]),
token_type: None,
}
}
}
impl State {
pub fn can_skip_space(&self) -> bool {
!self
.context
.current()
.map(|t| t.preserve_space())
.unwrap_or(false)
}
pub fn last_was_tpl_element(&self) -> bool {
match self.token_type {
Some(Template { .. }) => true,
_ => false,
}
}
fn update(&mut self, logger: &Logger, start: BytePos, next: &Token) {
trace!(
logger,
"updating state: next={:?}, had_line_break={} ",
next,
self.had_line_break
);
let prev = self.token_type.take();
self.token_type = Some(next.clone());
self.is_expr_allowed = Self::is_expr_allowed_on_next(
logger,
&mut self.context,
prev,
start,
next,
self.had_line_break,
self.is_expr_allowed,
);
}
/// `is_expr_allowed`: previous value.
/// `start`: start of newly produced token.
fn is_expr_allowed_on_next(
logger: &Logger,
context: &mut Context,
prev: Option<Token>,
start: BytePos,
next: &Token,
had_line_break: bool,
is_expr_allowed: bool,
) -> bool {
let is_next_keyword = match next {
&Word(Keyword(..)) => true,
_ => false,
};
if is_next_keyword && prev == Some(Token::Dot) {
return false;
} else {
// ported updateContext
match *next {
tok!(')') | tok!('}') => {
// TODO: Verify
if context.len() == 1 {
return true;
}
let out = context.pop(logger).unwrap();
// let a = function(){}
if out == Type::BraceStmt && context.current() == Some(Type::FnExpr) {
context.pop(logger);
return false;
}
// ${} in template
if out == Type::TplQuasi {
return true;
}
// expression cannot follow expression
return !out.is_expr();
}
tok!("function") => {
// This is required to lex
// `x = function(){}/42/i`
if is_expr_allowed
&& !context.is_brace_block(prev, had_line_break, is_expr_allowed)
{
context.push(logger, Type::FnExpr);
}
return false;
}
// for (a of b) {}
tok!("of") if Some(Type::ParenStmt { is_for_loop: true }) == context.current() => {
// e.g. for (a of _) => true
!prev
.expect("context.current() if ParenStmt, so prev token cannot be None")
.before_expr()
}
Word(Ident(ref ident)) => {
// variable declaration
return match prev {
Some(prev) => match prev {
// handle automatic semicolon insertion.
Word(Keyword(Let)) | Word(Keyword(Const)) | Word(Keyword(Var))
if had_line_break =>
{
true
}
_ => false,
},
_ => false,
};
}
tok!('{') => {
let next_ctxt = if context.is_brace_block(prev, had_line_break, is_expr_allowed)
{
Type::BraceStmt
} else {
Type::BraceExpr
};
context.push(logger, next_ctxt);
true
}
tok!("${") => {
context.push(logger, Type::TplQuasi);
return true;
}
tok!('(') => {
// if, for, with, while is statement
context.push(
logger,
match prev {
Some(Word(Keyword(k))) => match k {
If | With | While => Type::ParenStmt { is_for_loop: false },
For => Type::ParenStmt { is_for_loop: true },
_ => Type::ParenExpr,
},
_ => Type::ParenExpr,
},
);
return true;
}
// remains unchanged.
tok!("++") | tok!("--") => is_expr_allowed,
tok!('`') => {
// If we are in template, ` terminates template.
if let Some(Type::Tpl { .. }) = context.current() {
context.pop(logger);
} else {
context.push(logger, Type::Tpl { start });
}
return false;
}
_ => {
return next.before_expr();
}
}
}
}
}
#[derive(Debug, Default)]
struct Context(Vec<Type>);
impl Context {
/// Returns true if following `LBrace` token is `block statement` according
/// to `ctx`, `prev`, `is_expr_allowed`.
fn is_brace_block(
&self,
prev: Option<Token>,
had_line_break: bool,
is_expr_allowed: bool,
) -> bool {
match prev {
Some(tok!(':')) => match self.current() {
Some(Type::BraceStmt) => return true,
// `{ a: {} }`
// ^ ^
Some(Type::BraceExpr) => return false,
_ => {}
},
_ => {}
}
match prev {
// function a() {
// return { a: "" };
// }
// function a() {
// return
// {
// function b(){}
// };
// }
Some(tok!("return")) | Some(tok!("yield")) => {
return had_line_break;
}
Some(tok!("else")) | Some(Semi) | None | Some(tok!(')')) => return true,
// If previous token was `{`
Some(tok!('{')) => return self.current() == Some(Type::BraceStmt),
// `class C<T> { ... }`
Some(tok!('<')) | Some(tok!('>')) => return true,
_ => {}
}
return !is_expr_allowed;
}
fn len(&self) -> usize {
self.0.len()
}
fn pop(&mut self, logger: &Logger) -> Option<Type> {
let opt = self.0.pop();
trace!(logger, "context.pop({:?})", opt);
opt
}
fn current(&self) -> Option<Type> {
self.0.last().cloned()
}
fn push(&mut self, logger: &Logger, t: Type) {
trace!(logger, "context.push({:?})", t);
self.0.push(t)
}
}
/// The algorithm used to determine whether a regexp can appear at a
/// given point in the program is loosely based on sweet.js' approach.
/// See https://github.com/mozilla/sweet.js/wiki/design
#[derive(Debug, Clone, Copy, PartialEq, Eq, Kind)]
#[kind(fucntion(is_expr = "bool", preserve_space = "bool"))]
enum Type {
BraceStmt,
#[kind(is_expr)]
BraceExpr,
#[kind(is_expr)]
TplQuasi,
ParenStmt {
/// Is this `for` loop?
is_for_loop: bool,
},
#[kind(is_expr)]
ParenExpr,
#[kind(is_expr, preserve_space)]
Tpl {
/// Start of a template literal.
start: BytePos,
},
#[kind(is_expr)]
FnExpr,
}