Lines Matching defs:token
165 // Either we already have the next token lined up, in which case next_next_
167 // clear its token to indicate that it wasn't scanned yet. Otherwise we use
169 if (V8_LIKELY(next_next().token == Token::UNINITIALIZED)) {
178 previous->token = Token::UNINITIALIZED;
179 DCHECK_NE(Token::UNINITIALIZED, current().token);
181 return current().token;
185 DCHECK(next().token != Token::DIV);
186 DCHECK(next().token != Token::ASSIGN_DIV);
188 if (next_next().token != Token::UNINITIALIZED) {
189 return next_next().token;
197 return next_next().token;
335 void Scanner::SanityCheckTokenDesc(const TokenDesc& token) const {
339 switch (token.token) {
342 // token.literal_chars & other members might be garbage. That's ok.
347 DCHECK_EQ(token.invalid_template_escape_message, MessageTemplate::kNone);
354 // After this call, we will have the token at the given position as
355 // the "next" token. The "current" token will be invalid.
359 // Positions inside the lookahead token aren't supported.
365 // of the end of a function (at the "}" token). It doesn't matter
505 Token::Value token = ScanIdentifierOrKeywordInner();
506 return token == Token::ILLEGAL ? Token::ILLEGAL : Token::PRIVATE_NAME;
588 next().token = result;
930 Token::Value token =
932 if (base::IsInRange(token, Token::IDENTIFIER, Token::YIELD)) return token;
934 if (token == Token::FUTURE_STRICT_RESERVED_WORD) {
936 return token;
939 if (!escaped) return token;
942 if (base::IsInRange(token, Token::LET, Token::STATIC)) {
952 DCHECK_EQ(Token::UNINITIALIZED, next_next().token);
953 DCHECK(next().token == Token::DIV || next().token == Token::ASSIGN_DIV);
962 if (next().token == Token::ASSIGN_DIV) {
991 next().token = Token::REGEXP_LITERAL;
996 DCHECK_EQ(Token::REGEXP_LITERAL, next().token);
1062 for (TokenDesc& token : token_storage_) {
1063 token.token = Token::UNINITIALIZED;
1064 token.invalid_template_escape_message = MessageTemplate::kNone;
1068 // 3, re-scan, by scanning the look-ahead char + 1 token (next_).