Parser.cpp 68 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838
  1. /*
  2. * Copyright (c) 2020, Stephan Unverwerth <s.unverwerth@gmx.de>
  3. * Copyright (c) 2020, Linus Groh <mail@linusgroh.de>
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. *
  9. * 1. Redistributions of source code must retain the above copyright notice, this
  10. * list of conditions and the following disclaimer.
  11. *
  12. * 2. Redistributions in binary form must reproduce the above copyright notice,
  13. * this list of conditions and the following disclaimer in the documentation
  14. * and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  20. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  25. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. #include "Parser.h"
  28. #include <AK/ScopeGuard.h>
  29. #include <AK/StdLibExtras.h>
  30. namespace JS {
  31. class ScopePusher {
  32. public:
  33. enum Type {
  34. Var = 1,
  35. Let = 2,
  36. Function = 3,
  37. };
  38. ScopePusher(Parser& parser, unsigned mask)
  39. : m_parser(parser)
  40. , m_mask(mask)
  41. {
  42. if (m_mask & Var)
  43. m_parser.m_parser_state.m_var_scopes.append(NonnullRefPtrVector<VariableDeclaration>());
  44. if (m_mask & Let)
  45. m_parser.m_parser_state.m_let_scopes.append(NonnullRefPtrVector<VariableDeclaration>());
  46. if (m_mask & Function)
  47. m_parser.m_parser_state.m_function_scopes.append(NonnullRefPtrVector<FunctionDeclaration>());
  48. }
  49. ~ScopePusher()
  50. {
  51. if (m_mask & Var)
  52. m_parser.m_parser_state.m_var_scopes.take_last();
  53. if (m_mask & Let)
  54. m_parser.m_parser_state.m_let_scopes.take_last();
  55. if (m_mask & Function)
  56. m_parser.m_parser_state.m_function_scopes.take_last();
  57. }
  58. Parser& m_parser;
  59. unsigned m_mask { 0 };
  60. };
  61. class OperatorPrecedenceTable {
  62. public:
  63. constexpr OperatorPrecedenceTable()
  64. : m_token_precedence()
  65. {
  66. for (size_t i = 0; i < array_size(m_operator_precedence); ++i) {
  67. auto& op = m_operator_precedence[i];
  68. m_token_precedence[static_cast<size_t>(op.token)] = op.precedence;
  69. }
  70. }
  71. constexpr int get(TokenType token) const
  72. {
  73. int p = m_token_precedence[static_cast<size_t>(token)];
  74. if (p == 0) {
  75. fprintf(stderr, "Internal Error: No precedence for operator %s\n", Token::name(token));
  76. ASSERT_NOT_REACHED();
  77. return -1;
  78. }
  79. return p;
  80. }
  81. private:
  82. int m_token_precedence[cs_num_of_js_tokens];
  83. struct OperatorPrecedence {
  84. TokenType token;
  85. int precedence;
  86. };
  87. // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_Precedence
  88. static constexpr const OperatorPrecedence m_operator_precedence[] = {
  89. { TokenType::Period, 20 },
  90. { TokenType::BracketOpen, 20 },
  91. { TokenType::ParenOpen, 20 },
  92. { TokenType::QuestionMarkPeriod, 20 },
  93. { TokenType::New, 19 },
  94. { TokenType::PlusPlus, 18 },
  95. { TokenType::MinusMinus, 18 },
  96. { TokenType::ExclamationMark, 17 },
  97. { TokenType::Tilde, 17 },
  98. { TokenType::Typeof, 17 },
  99. { TokenType::Void, 17 },
  100. { TokenType::Delete, 17 },
  101. { TokenType::Await, 17 },
  102. { TokenType::DoubleAsterisk, 16 },
  103. { TokenType::Asterisk, 15 },
  104. { TokenType::Slash, 15 },
  105. { TokenType::Percent, 15 },
  106. { TokenType::Plus, 14 },
  107. { TokenType::Minus, 14 },
  108. { TokenType::ShiftLeft, 13 },
  109. { TokenType::ShiftRight, 13 },
  110. { TokenType::UnsignedShiftRight, 13 },
  111. { TokenType::LessThan, 12 },
  112. { TokenType::LessThanEquals, 12 },
  113. { TokenType::GreaterThan, 12 },
  114. { TokenType::GreaterThanEquals, 12 },
  115. { TokenType::In, 12 },
  116. { TokenType::Instanceof, 12 },
  117. { TokenType::EqualsEquals, 11 },
  118. { TokenType::ExclamationMarkEquals, 11 },
  119. { TokenType::EqualsEqualsEquals, 11 },
  120. { TokenType::ExclamationMarkEqualsEquals, 11 },
  121. { TokenType::Ampersand, 10 },
  122. { TokenType::Caret, 9 },
  123. { TokenType::Pipe, 8 },
  124. { TokenType::DoubleQuestionMark, 7 },
  125. { TokenType::DoubleAmpersand, 6 },
  126. { TokenType::DoublePipe, 5 },
  127. { TokenType::QuestionMark, 4 },
  128. { TokenType::Equals, 3 },
  129. { TokenType::PlusEquals, 3 },
  130. { TokenType::MinusEquals, 3 },
  131. { TokenType::DoubleAsteriskEquals, 3 },
  132. { TokenType::AsteriskEquals, 3 },
  133. { TokenType::SlashEquals, 3 },
  134. { TokenType::PercentEquals, 3 },
  135. { TokenType::ShiftLeftEquals, 3 },
  136. { TokenType::ShiftRightEquals, 3 },
  137. { TokenType::UnsignedShiftRightEquals, 3 },
  138. { TokenType::AmpersandEquals, 3 },
  139. { TokenType::CaretEquals, 3 },
  140. { TokenType::PipeEquals, 3 },
  141. { TokenType::DoubleAmpersandEquals, 3 },
  142. { TokenType::DoublePipeEquals, 3 },
  143. { TokenType::DoubleQuestionMarkEquals, 3 },
  144. { TokenType::Yield, 2 },
  145. { TokenType::Comma, 1 },
  146. };
  147. };
  148. constexpr OperatorPrecedenceTable g_operator_precedence;
  149. Parser::ParserState::ParserState(Lexer lexer)
  150. : m_lexer(move(lexer))
  151. , m_current_token(m_lexer.next())
  152. {
  153. }
  154. Parser::Parser(Lexer lexer)
  155. : m_parser_state(move(lexer))
  156. {
  157. }
  158. Associativity Parser::operator_associativity(TokenType type) const
  159. {
  160. switch (type) {
  161. case TokenType::Period:
  162. case TokenType::BracketOpen:
  163. case TokenType::ParenOpen:
  164. case TokenType::QuestionMarkPeriod:
  165. case TokenType::Asterisk:
  166. case TokenType::Slash:
  167. case TokenType::Percent:
  168. case TokenType::Plus:
  169. case TokenType::Minus:
  170. case TokenType::ShiftLeft:
  171. case TokenType::ShiftRight:
  172. case TokenType::UnsignedShiftRight:
  173. case TokenType::LessThan:
  174. case TokenType::LessThanEquals:
  175. case TokenType::GreaterThan:
  176. case TokenType::GreaterThanEquals:
  177. case TokenType::In:
  178. case TokenType::Instanceof:
  179. case TokenType::EqualsEquals:
  180. case TokenType::ExclamationMarkEquals:
  181. case TokenType::EqualsEqualsEquals:
  182. case TokenType::ExclamationMarkEqualsEquals:
  183. case TokenType::Typeof:
  184. case TokenType::Void:
  185. case TokenType::Delete:
  186. case TokenType::Ampersand:
  187. case TokenType::Caret:
  188. case TokenType::Pipe:
  189. case TokenType::DoubleQuestionMark:
  190. case TokenType::DoubleAmpersand:
  191. case TokenType::DoublePipe:
  192. case TokenType::Comma:
  193. return Associativity::Left;
  194. default:
  195. return Associativity::Right;
  196. }
  197. }
  198. NonnullRefPtr<Program> Parser::parse_program()
  199. {
  200. ScopePusher scope(*this, ScopePusher::Var | ScopePusher::Let | ScopePusher::Function);
  201. auto program = adopt(*new Program);
  202. bool first = true;
  203. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::Looking;
  204. while (!done()) {
  205. if (match_statement()) {
  206. program->append(parse_statement());
  207. if (first) {
  208. if (m_parser_state.m_use_strict_directive == UseStrictDirectiveState::Found) {
  209. program->set_strict_mode();
  210. m_parser_state.m_strict_mode = true;
  211. }
  212. first = false;
  213. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::None;
  214. }
  215. } else {
  216. expected("statement");
  217. consume();
  218. }
  219. }
  220. if (m_parser_state.m_var_scopes.size() == 1) {
  221. program->add_variables(m_parser_state.m_var_scopes.last());
  222. program->add_variables(m_parser_state.m_let_scopes.last());
  223. program->add_functions(m_parser_state.m_function_scopes.last());
  224. } else {
  225. syntax_error("Unclosed scope");
  226. }
  227. return program;
  228. }
  229. NonnullRefPtr<Statement> Parser::parse_statement()
  230. {
  231. switch (m_parser_state.m_current_token.type()) {
  232. case TokenType::Class:
  233. return parse_class_declaration();
  234. case TokenType::Function: {
  235. auto declaration = parse_function_node<FunctionDeclaration>();
  236. m_parser_state.m_function_scopes.last().append(declaration);
  237. return declaration;
  238. }
  239. case TokenType::CurlyOpen:
  240. return parse_block_statement();
  241. case TokenType::Return:
  242. return parse_return_statement();
  243. case TokenType::Var:
  244. case TokenType::Let:
  245. case TokenType::Const:
  246. return parse_variable_declaration();
  247. case TokenType::For:
  248. return parse_for_statement();
  249. case TokenType::If:
  250. return parse_if_statement();
  251. case TokenType::Throw:
  252. return parse_throw_statement();
  253. case TokenType::Try:
  254. return parse_try_statement();
  255. case TokenType::Break:
  256. return parse_break_statement();
  257. case TokenType::Continue:
  258. return parse_continue_statement();
  259. case TokenType::Switch:
  260. return parse_switch_statement();
  261. case TokenType::Do:
  262. return parse_do_while_statement();
  263. case TokenType::While:
  264. return parse_while_statement();
  265. case TokenType::Debugger:
  266. return parse_debugger_statement();
  267. case TokenType::Semicolon:
  268. consume();
  269. return create_ast_node<EmptyStatement>();
  270. default:
  271. if (match(TokenType::Identifier)) {
  272. auto result = try_parse_labelled_statement();
  273. if (!result.is_null())
  274. return result.release_nonnull();
  275. }
  276. if (match_expression()) {
  277. auto expr = parse_expression(0);
  278. consume_or_insert_semicolon();
  279. return create_ast_node<ExpressionStatement>(move(expr));
  280. }
  281. expected("statement (missing switch case)");
  282. consume();
  283. return create_ast_node<ErrorStatement>();
  284. }
  285. }
  286. RefPtr<FunctionExpression> Parser::try_parse_arrow_function_expression(bool expect_parens)
  287. {
  288. save_state();
  289. m_parser_state.m_var_scopes.append(NonnullRefPtrVector<VariableDeclaration>());
  290. ArmedScopeGuard state_rollback_guard = [&] {
  291. m_parser_state.m_var_scopes.take_last();
  292. load_state();
  293. };
  294. Vector<FunctionNode::Parameter> parameters;
  295. bool parse_failed = false;
  296. bool has_rest_parameter = false;
  297. i32 function_length = -1;
  298. while (true) {
  299. if (match(TokenType::Comma)) {
  300. if (has_rest_parameter || !expect_parens) {
  301. parse_failed = true;
  302. break;
  303. }
  304. consume(TokenType::Comma);
  305. } else if (match(TokenType::Identifier)) {
  306. auto parameter_name = consume(TokenType::Identifier).value();
  307. RefPtr<Expression> default_value;
  308. if (expect_parens && match(TokenType::Equals)) {
  309. consume(TokenType::Equals);
  310. function_length = parameters.size();
  311. default_value = parse_expression(2);
  312. }
  313. parameters.append({ parameter_name, default_value });
  314. } else if (match(TokenType::TripleDot)) {
  315. consume();
  316. if (has_rest_parameter) {
  317. parse_failed = true;
  318. break;
  319. }
  320. has_rest_parameter = true;
  321. function_length = parameters.size();
  322. auto parameter_name = consume(TokenType::Identifier).value();
  323. parameters.append({ parameter_name, nullptr, true });
  324. } else if (match(TokenType::ParenClose)) {
  325. if (expect_parens) {
  326. consume(TokenType::ParenClose);
  327. if (match(TokenType::Arrow)) {
  328. consume(TokenType::Arrow);
  329. } else {
  330. parse_failed = true;
  331. }
  332. break;
  333. }
  334. parse_failed = true;
  335. break;
  336. } else if (match(TokenType::Arrow)) {
  337. if (!expect_parens) {
  338. consume(TokenType::Arrow);
  339. break;
  340. }
  341. parse_failed = true;
  342. break;
  343. } else {
  344. parse_failed = true;
  345. break;
  346. }
  347. }
  348. if (parse_failed)
  349. return nullptr;
  350. if (function_length == -1)
  351. function_length = parameters.size();
  352. bool is_strict = false;
  353. auto function_body_result = [&]() -> RefPtr<BlockStatement> {
  354. TemporaryChange change(m_parser_state.m_in_function_context, true);
  355. if (match(TokenType::CurlyOpen)) {
  356. // Parse a function body with statements
  357. return parse_block_statement(is_strict);
  358. }
  359. if (match_expression()) {
  360. // Parse a function body which returns a single expression
  361. // FIXME: We synthesize a block with a return statement
  362. // for arrow function bodies which are a single expression.
  363. // Esprima generates a single "ArrowFunctionExpression"
  364. // with a "body" property.
  365. auto return_expression = parse_expression(2);
  366. auto return_block = create_ast_node<BlockStatement>();
  367. return_block->append<ReturnStatement>(move(return_expression));
  368. return return_block;
  369. }
  370. // Invalid arrow function body
  371. return nullptr;
  372. }();
  373. if (!function_body_result.is_null()) {
  374. state_rollback_guard.disarm();
  375. auto body = function_body_result.release_nonnull();
  376. return create_ast_node<FunctionExpression>("", move(body), move(parameters), function_length, m_parser_state.m_var_scopes.take_last(), is_strict, true);
  377. }
  378. return nullptr;
  379. }
  380. RefPtr<Statement> Parser::try_parse_labelled_statement()
  381. {
  382. save_state();
  383. ArmedScopeGuard state_rollback_guard = [&] {
  384. load_state();
  385. };
  386. auto identifier = consume(TokenType::Identifier).value();
  387. if (!match(TokenType::Colon))
  388. return {};
  389. consume(TokenType::Colon);
  390. if (!match_statement())
  391. return {};
  392. auto statement = parse_statement();
  393. statement->set_label(identifier);
  394. state_rollback_guard.disarm();
  395. return statement;
  396. }
  397. NonnullRefPtr<ClassDeclaration> Parser::parse_class_declaration()
  398. {
  399. return create_ast_node<ClassDeclaration>(parse_class_expression(true));
  400. }
  401. NonnullRefPtr<ClassExpression> Parser::parse_class_expression(bool expect_class_name)
  402. {
  403. // Classes are always in strict mode.
  404. TemporaryChange strict_mode_rollback(m_parser_state.m_strict_mode, true);
  405. consume(TokenType::Class);
  406. NonnullRefPtrVector<ClassMethod> methods;
  407. RefPtr<Expression> super_class;
  408. RefPtr<FunctionExpression> constructor;
  409. String class_name = expect_class_name || match(TokenType::Identifier) ? consume(TokenType::Identifier).value().to_string() : "";
  410. if (match(TokenType::Extends)) {
  411. consume();
  412. super_class = parse_primary_expression();
  413. }
  414. consume(TokenType::CurlyOpen);
  415. while (!done() && !match(TokenType::CurlyClose)) {
  416. RefPtr<Expression> property_key;
  417. bool is_static = false;
  418. bool is_constructor = false;
  419. auto method_kind = ClassMethod::Kind::Method;
  420. if (match(TokenType::Semicolon)) {
  421. consume();
  422. continue;
  423. }
  424. if (match_property_key()) {
  425. StringView name;
  426. if (match(TokenType::Identifier) && m_parser_state.m_current_token.value() == "static") {
  427. consume();
  428. is_static = true;
  429. }
  430. if (match(TokenType::Identifier)) {
  431. auto identifier_name = m_parser_state.m_current_token.value();
  432. if (identifier_name == "get") {
  433. method_kind = ClassMethod::Kind::Getter;
  434. consume();
  435. } else if (identifier_name == "set") {
  436. method_kind = ClassMethod::Kind::Setter;
  437. consume();
  438. }
  439. }
  440. if (match_property_key()) {
  441. switch (m_parser_state.m_current_token.type()) {
  442. case TokenType::Identifier:
  443. name = consume().value();
  444. property_key = create_ast_node<StringLiteral>(name);
  445. break;
  446. case TokenType::StringLiteral: {
  447. auto string_literal = parse_string_literal(consume());
  448. name = string_literal->value();
  449. property_key = move(string_literal);
  450. break;
  451. }
  452. default:
  453. property_key = parse_property_key();
  454. break;
  455. }
  456. } else {
  457. expected("property key");
  458. }
  459. // Constructor may be a StringLiteral or an Identifier.
  460. if (!is_static && name == "constructor") {
  461. if (method_kind != ClassMethod::Kind::Method)
  462. syntax_error("Class constructor may not be an accessor");
  463. if (!constructor.is_null())
  464. syntax_error("Classes may not have more than one constructor");
  465. is_constructor = true;
  466. }
  467. }
  468. if (match(TokenType::ParenOpen)) {
  469. auto function = parse_function_node<FunctionExpression>(false, true, !super_class.is_null());
  470. auto arg_count = function->parameters().size();
  471. if (method_kind == ClassMethod::Kind::Getter && arg_count != 0) {
  472. syntax_error("Class getter method must have no arguments");
  473. } else if (method_kind == ClassMethod::Kind::Setter && arg_count != 1) {
  474. syntax_error("Class setter method must have one argument");
  475. }
  476. if (is_constructor) {
  477. constructor = move(function);
  478. } else if (!property_key.is_null()) {
  479. methods.append(create_ast_node<ClassMethod>(property_key.release_nonnull(), move(function), method_kind, is_static));
  480. } else {
  481. syntax_error("No key for class method");
  482. }
  483. } else {
  484. expected("ParenOpen");
  485. consume();
  486. }
  487. }
  488. consume(TokenType::CurlyClose);
  489. if (constructor.is_null()) {
  490. auto constructor_body = create_ast_node<BlockStatement>();
  491. if (!super_class.is_null()) {
  492. // Set constructor to the result of parsing the source text
  493. // constructor(... args){ super (...args);}
  494. auto super_call = create_ast_node<CallExpression>(create_ast_node<SuperExpression>(), Vector { CallExpression::Argument { create_ast_node<Identifier>("args"), true } });
  495. constructor_body->append(create_ast_node<ExpressionStatement>(move(super_call)));
  496. constructor_body->add_variables(m_parser_state.m_var_scopes.last());
  497. constructor = create_ast_node<FunctionExpression>(class_name, move(constructor_body), Vector { FunctionNode::Parameter { "args", nullptr, true } }, 0, NonnullRefPtrVector<VariableDeclaration>(), true);
  498. } else {
  499. constructor = create_ast_node<FunctionExpression>(class_name, move(constructor_body), Vector<FunctionNode::Parameter> {}, 0, NonnullRefPtrVector<VariableDeclaration>(), true);
  500. }
  501. }
  502. return create_ast_node<ClassExpression>(move(class_name), move(constructor), move(super_class), move(methods));
  503. }
  504. NonnullRefPtr<Expression> Parser::parse_primary_expression()
  505. {
  506. if (match_unary_prefixed_expression())
  507. return parse_unary_prefixed_expression();
  508. switch (m_parser_state.m_current_token.type()) {
  509. case TokenType::ParenOpen: {
  510. consume(TokenType::ParenOpen);
  511. if (match(TokenType::ParenClose) || match(TokenType::Identifier) || match(TokenType::TripleDot)) {
  512. auto arrow_function_result = try_parse_arrow_function_expression(true);
  513. if (!arrow_function_result.is_null()) {
  514. return arrow_function_result.release_nonnull();
  515. }
  516. }
  517. auto expression = parse_expression(0);
  518. consume(TokenType::ParenClose);
  519. return expression;
  520. }
  521. case TokenType::This:
  522. consume();
  523. return create_ast_node<ThisExpression>();
  524. case TokenType::Class:
  525. return parse_class_expression(false);
  526. case TokenType::Super:
  527. consume();
  528. if (!m_parser_state.m_allow_super_property_lookup)
  529. syntax_error("'super' keyword unexpected here");
  530. return create_ast_node<SuperExpression>();
  531. case TokenType::Identifier: {
  532. auto arrow_function_result = try_parse_arrow_function_expression(false);
  533. if (!arrow_function_result.is_null()) {
  534. return arrow_function_result.release_nonnull();
  535. }
  536. return create_ast_node<Identifier>(consume().value());
  537. }
  538. case TokenType::NumericLiteral:
  539. return create_ast_node<NumericLiteral>(consume().double_value());
  540. case TokenType::BigIntLiteral:
  541. return create_ast_node<BigIntLiteral>(consume().value());
  542. case TokenType::BoolLiteral:
  543. return create_ast_node<BooleanLiteral>(consume().bool_value());
  544. case TokenType::StringLiteral:
  545. return parse_string_literal(consume());
  546. case TokenType::NullLiteral:
  547. consume();
  548. return create_ast_node<NullLiteral>();
  549. case TokenType::CurlyOpen:
  550. return parse_object_expression();
  551. case TokenType::Function:
  552. return parse_function_node<FunctionExpression>();
  553. case TokenType::BracketOpen:
  554. return parse_array_expression();
  555. case TokenType::RegexLiteral:
  556. return parse_regexp_literal();
  557. case TokenType::TemplateLiteralStart:
  558. return parse_template_literal(false);
  559. case TokenType::New:
  560. return parse_new_expression();
  561. default:
  562. expected("primary expression (missing switch case)");
  563. consume();
  564. return create_ast_node<ErrorExpression>();
  565. }
  566. }
  567. NonnullRefPtr<RegExpLiteral> Parser::parse_regexp_literal()
  568. {
  569. auto content = consume().value();
  570. auto flags = match(TokenType::RegexFlags) ? consume().value() : "";
  571. return create_ast_node<RegExpLiteral>(content.substring_view(1, content.length() - 2), flags);
  572. }
  573. NonnullRefPtr<Expression> Parser::parse_unary_prefixed_expression()
  574. {
  575. auto precedence = g_operator_precedence.get(m_parser_state.m_current_token.type());
  576. auto associativity = operator_associativity(m_parser_state.m_current_token.type());
  577. switch (m_parser_state.m_current_token.type()) {
  578. case TokenType::PlusPlus: {
  579. consume();
  580. auto rhs_start_line = m_parser_state.m_current_token.line_number();
  581. auto rhs_start_column = m_parser_state.m_current_token.line_column();
  582. auto rhs = parse_expression(precedence, associativity);
  583. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  584. // other engines throw ReferenceError for ++foo()
  585. if (!rhs->is_identifier() && !rhs->is_member_expression())
  586. syntax_error(String::formatted("Right-hand side of prefix increment operator must be identifier or member expression, got {}", rhs->class_name()), rhs_start_line, rhs_start_column);
  587. return create_ast_node<UpdateExpression>(UpdateOp::Increment, move(rhs), true);
  588. }
  589. case TokenType::MinusMinus: {
  590. consume();
  591. auto rhs_start_line = m_parser_state.m_current_token.line_number();
  592. auto rhs_start_column = m_parser_state.m_current_token.line_column();
  593. auto rhs = parse_expression(precedence, associativity);
  594. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  595. // other engines throw ReferenceError for --foo()
  596. if (!rhs->is_identifier() && !rhs->is_member_expression())
  597. syntax_error(String::formatted("Right-hand side of prefix decrement operator must be identifier or member expression, got {}", rhs->class_name()), rhs_start_line, rhs_start_column);
  598. return create_ast_node<UpdateExpression>(UpdateOp::Decrement, move(rhs), true);
  599. }
  600. case TokenType::ExclamationMark:
  601. consume();
  602. return create_ast_node<UnaryExpression>(UnaryOp::Not, parse_expression(precedence, associativity));
  603. case TokenType::Tilde:
  604. consume();
  605. return create_ast_node<UnaryExpression>(UnaryOp::BitwiseNot, parse_expression(precedence, associativity));
  606. case TokenType::Plus:
  607. consume();
  608. return create_ast_node<UnaryExpression>(UnaryOp::Plus, parse_expression(precedence, associativity));
  609. case TokenType::Minus:
  610. consume();
  611. return create_ast_node<UnaryExpression>(UnaryOp::Minus, parse_expression(precedence, associativity));
  612. case TokenType::Typeof:
  613. consume();
  614. return create_ast_node<UnaryExpression>(UnaryOp::Typeof, parse_expression(precedence, associativity));
  615. case TokenType::Void:
  616. consume();
  617. return create_ast_node<UnaryExpression>(UnaryOp::Void, parse_expression(precedence, associativity));
  618. case TokenType::Delete:
  619. consume();
  620. return create_ast_node<UnaryExpression>(UnaryOp::Delete, parse_expression(precedence, associativity));
  621. default:
  622. expected("primary expression (missing switch case)");
  623. consume();
  624. return create_ast_node<ErrorExpression>();
  625. }
  626. }
  627. NonnullRefPtr<Expression> Parser::parse_property_key()
  628. {
  629. if (match(TokenType::StringLiteral)) {
  630. return parse_string_literal(consume());
  631. } else if (match(TokenType::NumericLiteral)) {
  632. return create_ast_node<StringLiteral>(consume(TokenType::NumericLiteral).value());
  633. } else if (match(TokenType::BigIntLiteral)) {
  634. auto value = consume(TokenType::BigIntLiteral).value();
  635. return create_ast_node<StringLiteral>(value.substring_view(0, value.length() - 1));
  636. } else if (match(TokenType::BracketOpen)) {
  637. consume(TokenType::BracketOpen);
  638. auto result = parse_expression(0);
  639. consume(TokenType::BracketClose);
  640. return result;
  641. } else {
  642. if (!match_identifier_name())
  643. expected("IdentifierName");
  644. return create_ast_node<StringLiteral>(consume().value());
  645. }
  646. }
  647. NonnullRefPtr<ObjectExpression> Parser::parse_object_expression()
  648. {
  649. consume(TokenType::CurlyOpen);
  650. NonnullRefPtrVector<ObjectProperty> properties;
  651. ObjectProperty::Type property_type;
  652. auto skip_to_next_property = [&] {
  653. while (!done() && !match(TokenType::Comma) && !match(TokenType::CurlyOpen))
  654. consume();
  655. };
  656. while (!done() && !match(TokenType::CurlyClose)) {
  657. property_type = ObjectProperty::Type::KeyValue;
  658. RefPtr<Expression> property_name;
  659. RefPtr<Expression> property_value;
  660. if (match(TokenType::TripleDot)) {
  661. consume();
  662. property_name = parse_expression(4);
  663. properties.append(create_ast_node<ObjectProperty>(*property_name, nullptr, ObjectProperty::Type::Spread, false));
  664. if (!match(TokenType::Comma))
  665. break;
  666. consume(TokenType::Comma);
  667. continue;
  668. }
  669. if (match(TokenType::Identifier)) {
  670. auto identifier = consume().value();
  671. if (identifier == "get" && match_property_key()) {
  672. property_type = ObjectProperty::Type::Getter;
  673. property_name = parse_property_key();
  674. } else if (identifier == "set" && match_property_key()) {
  675. property_type = ObjectProperty::Type::Setter;
  676. property_name = parse_property_key();
  677. } else {
  678. property_name = create_ast_node<StringLiteral>(identifier);
  679. property_value = create_ast_node<Identifier>(identifier);
  680. }
  681. } else {
  682. property_name = parse_property_key();
  683. }
  684. if (property_type == ObjectProperty::Type::Getter || property_type == ObjectProperty::Type::Setter) {
  685. if (!match(TokenType::ParenOpen)) {
  686. syntax_error(
  687. "Expected '(' for object getter or setter property",
  688. m_parser_state.m_current_token.line_number(),
  689. m_parser_state.m_current_token.line_column());
  690. skip_to_next_property();
  691. continue;
  692. }
  693. }
  694. if (match(TokenType::ParenOpen)) {
  695. ASSERT(property_name);
  696. auto function = parse_function_node<FunctionExpression>(false, true);
  697. auto arg_count = function->parameters().size();
  698. if (property_type == ObjectProperty::Type::Getter && arg_count != 0) {
  699. syntax_error(
  700. "Object getter property must have no arguments",
  701. m_parser_state.m_current_token.line_number(),
  702. m_parser_state.m_current_token.line_column());
  703. skip_to_next_property();
  704. continue;
  705. }
  706. if (property_type == ObjectProperty::Type::Setter && arg_count != 1) {
  707. syntax_error(
  708. "Object setter property must have one argument",
  709. m_parser_state.m_current_token.line_number(),
  710. m_parser_state.m_current_token.line_column());
  711. skip_to_next_property();
  712. continue;
  713. }
  714. properties.append(create_ast_node<ObjectProperty>(*property_name, function, property_type, true));
  715. } else if (match(TokenType::Colon)) {
  716. if (!property_name) {
  717. syntax_error("Expected a property name");
  718. skip_to_next_property();
  719. continue;
  720. }
  721. consume();
  722. properties.append(create_ast_node<ObjectProperty>(*property_name, parse_expression(2), property_type, false));
  723. } else if (property_name && property_value) {
  724. properties.append(create_ast_node<ObjectProperty>(*property_name, *property_value, property_type, false));
  725. } else {
  726. syntax_error("Expected a property");
  727. skip_to_next_property();
  728. continue;
  729. }
  730. if (!match(TokenType::Comma))
  731. break;
  732. consume(TokenType::Comma);
  733. }
  734. consume(TokenType::CurlyClose);
  735. return create_ast_node<ObjectExpression>(properties);
  736. }
  737. NonnullRefPtr<ArrayExpression> Parser::parse_array_expression()
  738. {
  739. consume(TokenType::BracketOpen);
  740. Vector<RefPtr<Expression>> elements;
  741. while (match_expression() || match(TokenType::TripleDot) || match(TokenType::Comma)) {
  742. RefPtr<Expression> expression;
  743. if (match(TokenType::TripleDot)) {
  744. consume(TokenType::TripleDot);
  745. expression = create_ast_node<SpreadExpression>(parse_expression(2));
  746. } else if (match_expression()) {
  747. expression = parse_expression(2);
  748. }
  749. elements.append(expression);
  750. if (!match(TokenType::Comma))
  751. break;
  752. consume(TokenType::Comma);
  753. }
  754. consume(TokenType::BracketClose);
  755. return create_ast_node<ArrayExpression>(move(elements));
  756. }
  757. NonnullRefPtr<StringLiteral> Parser::parse_string_literal(Token token)
  758. {
  759. auto status = Token::StringValueStatus::Ok;
  760. auto string = token.string_value(status);
  761. if (status != Token::StringValueStatus::Ok) {
  762. String message;
  763. if (status == Token::StringValueStatus::MalformedHexEscape || status == Token::StringValueStatus::MalformedUnicodeEscape) {
  764. auto type = status == Token::StringValueStatus::MalformedUnicodeEscape ? "unicode" : "hexadecimal";
  765. message = String::formatted("Malformed {} escape sequence", type);
  766. } else if (status == Token::StringValueStatus::UnicodeEscapeOverflow) {
  767. message = "Unicode code_point must not be greater than 0x10ffff in escape sequence";
  768. }
  769. syntax_error(
  770. message,
  771. m_parser_state.m_current_token.line_number(),
  772. m_parser_state.m_current_token.line_column());
  773. }
  774. if (m_parser_state.m_use_strict_directive == UseStrictDirectiveState::Looking) {
  775. if (string == "use strict" && token.type() != TokenType::TemplateLiteralString) {
  776. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::Found;
  777. } else {
  778. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::None;
  779. }
  780. }
  781. return create_ast_node<StringLiteral>(string);
  782. }
  783. NonnullRefPtr<TemplateLiteral> Parser::parse_template_literal(bool is_tagged)
  784. {
  785. consume(TokenType::TemplateLiteralStart);
  786. NonnullRefPtrVector<Expression> expressions;
  787. NonnullRefPtrVector<Expression> raw_strings;
  788. auto append_empty_string = [&expressions, &raw_strings, is_tagged]() {
  789. auto string_literal = create_ast_node<StringLiteral>("");
  790. expressions.append(string_literal);
  791. if (is_tagged)
  792. raw_strings.append(string_literal);
  793. };
  794. if (!match(TokenType::TemplateLiteralString))
  795. append_empty_string();
  796. while (!done() && !match(TokenType::TemplateLiteralEnd) && !match(TokenType::UnterminatedTemplateLiteral)) {
  797. if (match(TokenType::TemplateLiteralString)) {
  798. auto token = consume();
  799. expressions.append(parse_string_literal(token));
  800. if (is_tagged)
  801. raw_strings.append(create_ast_node<StringLiteral>(token.value()));
  802. } else if (match(TokenType::TemplateLiteralExprStart)) {
  803. consume(TokenType::TemplateLiteralExprStart);
  804. if (match(TokenType::TemplateLiteralExprEnd)) {
  805. syntax_error("Empty template literal expression block");
  806. return create_ast_node<TemplateLiteral>(expressions);
  807. }
  808. expressions.append(parse_expression(0));
  809. if (match(TokenType::UnterminatedTemplateLiteral)) {
  810. syntax_error("Unterminated template literal");
  811. return create_ast_node<TemplateLiteral>(expressions);
  812. }
  813. consume(TokenType::TemplateLiteralExprEnd);
  814. if (!match(TokenType::TemplateLiteralString))
  815. append_empty_string();
  816. } else {
  817. expected("Template literal string or expression");
  818. break;
  819. }
  820. }
  821. if (match(TokenType::UnterminatedTemplateLiteral)) {
  822. syntax_error("Unterminated template literal");
  823. } else {
  824. consume(TokenType::TemplateLiteralEnd);
  825. }
  826. if (is_tagged)
  827. return create_ast_node<TemplateLiteral>(expressions, raw_strings);
  828. return create_ast_node<TemplateLiteral>(expressions);
  829. }
  830. NonnullRefPtr<Expression> Parser::parse_expression(int min_precedence, Associativity associativity, Vector<TokenType> forbidden)
  831. {
  832. auto expression = parse_primary_expression();
  833. while (match(TokenType::TemplateLiteralStart)) {
  834. auto template_literal = parse_template_literal(true);
  835. expression = create_ast_node<TaggedTemplateLiteral>(move(expression), move(template_literal));
  836. }
  837. while (match_secondary_expression(forbidden)) {
  838. int new_precedence = g_operator_precedence.get(m_parser_state.m_current_token.type());
  839. if (new_precedence < min_precedence)
  840. break;
  841. if (new_precedence == min_precedence && associativity == Associativity::Left)
  842. break;
  843. Associativity new_associativity = operator_associativity(m_parser_state.m_current_token.type());
  844. expression = parse_secondary_expression(move(expression), new_precedence, new_associativity);
  845. while (match(TokenType::TemplateLiteralStart)) {
  846. auto template_literal = parse_template_literal(true);
  847. expression = create_ast_node<TaggedTemplateLiteral>(move(expression), move(template_literal));
  848. }
  849. }
  850. if (match(TokenType::Comma) && min_precedence <= 1) {
  851. NonnullRefPtrVector<Expression> expressions;
  852. expressions.append(expression);
  853. while (match(TokenType::Comma)) {
  854. consume();
  855. expressions.append(parse_expression(2));
  856. }
  857. expression = create_ast_node<SequenceExpression>(move(expressions));
  858. }
  859. return expression;
  860. }
  861. NonnullRefPtr<Expression> Parser::parse_secondary_expression(NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity)
  862. {
  863. switch (m_parser_state.m_current_token.type()) {
  864. case TokenType::Plus:
  865. consume();
  866. return create_ast_node<BinaryExpression>(BinaryOp::Addition, move(lhs), parse_expression(min_precedence, associativity));
  867. case TokenType::PlusEquals:
  868. return parse_assignment_expression(AssignmentOp::AdditionAssignment, move(lhs), min_precedence, associativity);
  869. case TokenType::Minus:
  870. consume();
  871. return create_ast_node<BinaryExpression>(BinaryOp::Subtraction, move(lhs), parse_expression(min_precedence, associativity));
  872. case TokenType::MinusEquals:
  873. return parse_assignment_expression(AssignmentOp::SubtractionAssignment, move(lhs), min_precedence, associativity);
  874. case TokenType::Asterisk:
  875. consume();
  876. return create_ast_node<BinaryExpression>(BinaryOp::Multiplication, move(lhs), parse_expression(min_precedence, associativity));
  877. case TokenType::AsteriskEquals:
  878. return parse_assignment_expression(AssignmentOp::MultiplicationAssignment, move(lhs), min_precedence, associativity);
  879. case TokenType::Slash:
  880. consume();
  881. return create_ast_node<BinaryExpression>(BinaryOp::Division, move(lhs), parse_expression(min_precedence, associativity));
  882. case TokenType::SlashEquals:
  883. return parse_assignment_expression(AssignmentOp::DivisionAssignment, move(lhs), min_precedence, associativity);
  884. case TokenType::Percent:
  885. consume();
  886. return create_ast_node<BinaryExpression>(BinaryOp::Modulo, move(lhs), parse_expression(min_precedence, associativity));
  887. case TokenType::PercentEquals:
  888. return parse_assignment_expression(AssignmentOp::ModuloAssignment, move(lhs), min_precedence, associativity);
  889. case TokenType::DoubleAsterisk:
  890. consume();
  891. return create_ast_node<BinaryExpression>(BinaryOp::Exponentiation, move(lhs), parse_expression(min_precedence, associativity));
  892. case TokenType::DoubleAsteriskEquals:
  893. return parse_assignment_expression(AssignmentOp::ExponentiationAssignment, move(lhs), min_precedence, associativity);
  894. case TokenType::GreaterThan:
  895. consume();
  896. return create_ast_node<BinaryExpression>(BinaryOp::GreaterThan, move(lhs), parse_expression(min_precedence, associativity));
  897. case TokenType::GreaterThanEquals:
  898. consume();
  899. return create_ast_node<BinaryExpression>(BinaryOp::GreaterThanEquals, move(lhs), parse_expression(min_precedence, associativity));
  900. case TokenType::LessThan:
  901. consume();
  902. return create_ast_node<BinaryExpression>(BinaryOp::LessThan, move(lhs), parse_expression(min_precedence, associativity));
  903. case TokenType::LessThanEquals:
  904. consume();
  905. return create_ast_node<BinaryExpression>(BinaryOp::LessThanEquals, move(lhs), parse_expression(min_precedence, associativity));
  906. case TokenType::EqualsEqualsEquals:
  907. consume();
  908. return create_ast_node<BinaryExpression>(BinaryOp::TypedEquals, move(lhs), parse_expression(min_precedence, associativity));
  909. case TokenType::ExclamationMarkEqualsEquals:
  910. consume();
  911. return create_ast_node<BinaryExpression>(BinaryOp::TypedInequals, move(lhs), parse_expression(min_precedence, associativity));
  912. case TokenType::EqualsEquals:
  913. consume();
  914. return create_ast_node<BinaryExpression>(BinaryOp::AbstractEquals, move(lhs), parse_expression(min_precedence, associativity));
  915. case TokenType::ExclamationMarkEquals:
  916. consume();
  917. return create_ast_node<BinaryExpression>(BinaryOp::AbstractInequals, move(lhs), parse_expression(min_precedence, associativity));
  918. case TokenType::In:
  919. consume();
  920. return create_ast_node<BinaryExpression>(BinaryOp::In, move(lhs), parse_expression(min_precedence, associativity));
  921. case TokenType::Instanceof:
  922. consume();
  923. return create_ast_node<BinaryExpression>(BinaryOp::InstanceOf, move(lhs), parse_expression(min_precedence, associativity));
  924. case TokenType::Ampersand:
  925. consume();
  926. return create_ast_node<BinaryExpression>(BinaryOp::BitwiseAnd, move(lhs), parse_expression(min_precedence, associativity));
  927. case TokenType::AmpersandEquals:
  928. return parse_assignment_expression(AssignmentOp::BitwiseAndAssignment, move(lhs), min_precedence, associativity);
  929. case TokenType::Pipe:
  930. consume();
  931. return create_ast_node<BinaryExpression>(BinaryOp::BitwiseOr, move(lhs), parse_expression(min_precedence, associativity));
  932. case TokenType::PipeEquals:
  933. return parse_assignment_expression(AssignmentOp::BitwiseOrAssignment, move(lhs), min_precedence, associativity);
  934. case TokenType::Caret:
  935. consume();
  936. return create_ast_node<BinaryExpression>(BinaryOp::BitwiseXor, move(lhs), parse_expression(min_precedence, associativity));
  937. case TokenType::CaretEquals:
  938. return parse_assignment_expression(AssignmentOp::BitwiseXorAssignment, move(lhs), min_precedence, associativity);
  939. case TokenType::ShiftLeft:
  940. consume();
  941. return create_ast_node<BinaryExpression>(BinaryOp::LeftShift, move(lhs), parse_expression(min_precedence, associativity));
  942. case TokenType::ShiftLeftEquals:
  943. return parse_assignment_expression(AssignmentOp::LeftShiftAssignment, move(lhs), min_precedence, associativity);
  944. case TokenType::ShiftRight:
  945. consume();
  946. return create_ast_node<BinaryExpression>(BinaryOp::RightShift, move(lhs), parse_expression(min_precedence, associativity));
  947. case TokenType::ShiftRightEquals:
  948. return parse_assignment_expression(AssignmentOp::RightShiftAssignment, move(lhs), min_precedence, associativity);
  949. case TokenType::UnsignedShiftRight:
  950. consume();
  951. return create_ast_node<BinaryExpression>(BinaryOp::UnsignedRightShift, move(lhs), parse_expression(min_precedence, associativity));
  952. case TokenType::UnsignedShiftRightEquals:
  953. return parse_assignment_expression(AssignmentOp::UnsignedRightShiftAssignment, move(lhs), min_precedence, associativity);
  954. case TokenType::ParenOpen:
  955. return parse_call_expression(move(lhs));
  956. case TokenType::Equals:
  957. return parse_assignment_expression(AssignmentOp::Assignment, move(lhs), min_precedence, associativity);
  958. case TokenType::Period:
  959. consume();
  960. if (!match_identifier_name())
  961. expected("IdentifierName");
  962. return create_ast_node<MemberExpression>(move(lhs), create_ast_node<Identifier>(consume().value()));
  963. case TokenType::BracketOpen: {
  964. consume(TokenType::BracketOpen);
  965. auto expression = create_ast_node<MemberExpression>(move(lhs), parse_expression(0), true);
  966. consume(TokenType::BracketClose);
  967. return expression;
  968. }
  969. case TokenType::PlusPlus:
  970. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  971. // other engines throw ReferenceError for foo()++
  972. if (!lhs->is_identifier() && !lhs->is_member_expression())
  973. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  974. consume();
  975. return create_ast_node<UpdateExpression>(UpdateOp::Increment, move(lhs));
  976. case TokenType::MinusMinus:
  977. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  978. // other engines throw ReferenceError for foo()--
  979. if (!lhs->is_identifier() && !lhs->is_member_expression())
  980. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  981. consume();
  982. return create_ast_node<UpdateExpression>(UpdateOp::Decrement, move(lhs));
  983. case TokenType::DoubleAmpersand:
  984. consume();
  985. return create_ast_node<LogicalExpression>(LogicalOp::And, move(lhs), parse_expression(min_precedence, associativity));
  986. case TokenType::DoubleAmpersandEquals:
  987. return parse_assignment_expression(AssignmentOp::AndAssignment, move(lhs), min_precedence, associativity);
  988. case TokenType::DoublePipe:
  989. consume();
  990. return create_ast_node<LogicalExpression>(LogicalOp::Or, move(lhs), parse_expression(min_precedence, associativity));
  991. case TokenType::DoublePipeEquals:
  992. return parse_assignment_expression(AssignmentOp::OrAssignment, move(lhs), min_precedence, associativity);
  993. case TokenType::DoubleQuestionMark:
  994. consume();
  995. return create_ast_node<LogicalExpression>(LogicalOp::NullishCoalescing, move(lhs), parse_expression(min_precedence, associativity));
  996. case TokenType::DoubleQuestionMarkEquals:
  997. return parse_assignment_expression(AssignmentOp::NullishAssignment, move(lhs), min_precedence, associativity);
  998. case TokenType::QuestionMark:
  999. return parse_conditional_expression(move(lhs));
  1000. default:
  1001. expected("secondary expression (missing switch case)");
  1002. consume();
  1003. return create_ast_node<ErrorExpression>();
  1004. }
  1005. }
  1006. NonnullRefPtr<AssignmentExpression> Parser::parse_assignment_expression(AssignmentOp assignment_op, NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity)
  1007. {
  1008. ASSERT(match(TokenType::Equals)
  1009. || match(TokenType::PlusEquals)
  1010. || match(TokenType::MinusEquals)
  1011. || match(TokenType::AsteriskEquals)
  1012. || match(TokenType::SlashEquals)
  1013. || match(TokenType::PercentEquals)
  1014. || match(TokenType::DoubleAsteriskEquals)
  1015. || match(TokenType::AmpersandEquals)
  1016. || match(TokenType::PipeEquals)
  1017. || match(TokenType::CaretEquals)
  1018. || match(TokenType::ShiftLeftEquals)
  1019. || match(TokenType::ShiftRightEquals)
  1020. || match(TokenType::UnsignedShiftRightEquals)
  1021. || match(TokenType::DoubleAmpersandEquals)
  1022. || match(TokenType::DoublePipeEquals)
  1023. || match(TokenType::DoubleQuestionMarkEquals));
  1024. consume();
  1025. if (!lhs->is_identifier() && !lhs->is_member_expression() && !lhs->is_call_expression()) {
  1026. syntax_error("Invalid left-hand side in assignment");
  1027. } else if (m_parser_state.m_strict_mode && lhs->is_identifier()) {
  1028. auto name = static_cast<const Identifier&>(*lhs).string();
  1029. if (name == "eval" || name == "arguments")
  1030. syntax_error(String::formatted("'{}' cannot be assigned to in strict mode code", name));
  1031. } else if (m_parser_state.m_strict_mode && lhs->is_call_expression()) {
  1032. syntax_error("Cannot assign to function call");
  1033. }
  1034. return create_ast_node<AssignmentExpression>(assignment_op, move(lhs), parse_expression(min_precedence, associativity));
  1035. }
  1036. NonnullRefPtr<CallExpression> Parser::parse_call_expression(NonnullRefPtr<Expression> lhs)
  1037. {
  1038. if (!m_parser_state.m_allow_super_constructor_call && lhs->is_super_expression())
  1039. syntax_error("'super' keyword unexpected here");
  1040. consume(TokenType::ParenOpen);
  1041. Vector<CallExpression::Argument> arguments;
  1042. while (match_expression() || match(TokenType::TripleDot)) {
  1043. if (match(TokenType::TripleDot)) {
  1044. consume();
  1045. arguments.append({ parse_expression(2), true });
  1046. } else {
  1047. arguments.append({ parse_expression(2), false });
  1048. }
  1049. if (!match(TokenType::Comma))
  1050. break;
  1051. consume();
  1052. }
  1053. consume(TokenType::ParenClose);
  1054. return create_ast_node<CallExpression>(move(lhs), move(arguments));
  1055. }
  1056. NonnullRefPtr<NewExpression> Parser::parse_new_expression()
  1057. {
  1058. consume(TokenType::New);
  1059. auto callee = parse_expression(g_operator_precedence.get(TokenType::New), Associativity::Right, { TokenType::ParenOpen });
  1060. Vector<CallExpression::Argument> arguments;
  1061. if (match(TokenType::ParenOpen)) {
  1062. consume(TokenType::ParenOpen);
  1063. while (match_expression() || match(TokenType::TripleDot)) {
  1064. if (match(TokenType::TripleDot)) {
  1065. consume();
  1066. arguments.append({ parse_expression(2), true });
  1067. } else {
  1068. arguments.append({ parse_expression(2), false });
  1069. }
  1070. if (!match(TokenType::Comma))
  1071. break;
  1072. consume();
  1073. }
  1074. consume(TokenType::ParenClose);
  1075. }
  1076. return create_ast_node<NewExpression>(move(callee), move(arguments));
  1077. }
  1078. NonnullRefPtr<ReturnStatement> Parser::parse_return_statement()
  1079. {
  1080. if (!m_parser_state.m_in_function_context)
  1081. syntax_error("'return' not allowed outside of a function");
  1082. consume(TokenType::Return);
  1083. // Automatic semicolon insertion: terminate statement when return is followed by newline
  1084. if (m_parser_state.m_current_token.trivia().contains('\n'))
  1085. return create_ast_node<ReturnStatement>(nullptr);
  1086. if (match_expression()) {
  1087. auto expression = parse_expression(0);
  1088. consume_or_insert_semicolon();
  1089. return create_ast_node<ReturnStatement>(move(expression));
  1090. }
  1091. consume_or_insert_semicolon();
  1092. return create_ast_node<ReturnStatement>(nullptr);
  1093. }
  1094. NonnullRefPtr<BlockStatement> Parser::parse_block_statement()
  1095. {
  1096. bool dummy = false;
  1097. return parse_block_statement(dummy);
  1098. }
  1099. NonnullRefPtr<BlockStatement> Parser::parse_block_statement(bool& is_strict)
  1100. {
  1101. ScopePusher scope(*this, ScopePusher::Let);
  1102. auto block = create_ast_node<BlockStatement>();
  1103. consume(TokenType::CurlyOpen);
  1104. bool first = true;
  1105. bool initial_strict_mode_state = m_parser_state.m_strict_mode;
  1106. if (initial_strict_mode_state) {
  1107. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::None;
  1108. is_strict = true;
  1109. } else {
  1110. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::Looking;
  1111. }
  1112. while (!done() && !match(TokenType::CurlyClose)) {
  1113. if (match(TokenType::Semicolon)) {
  1114. consume();
  1115. } else if (match_statement()) {
  1116. block->append(parse_statement());
  1117. if (first && !initial_strict_mode_state) {
  1118. if (m_parser_state.m_use_strict_directive == UseStrictDirectiveState::Found) {
  1119. is_strict = true;
  1120. m_parser_state.m_strict_mode = true;
  1121. }
  1122. m_parser_state.m_use_strict_directive = UseStrictDirectiveState::None;
  1123. }
  1124. } else {
  1125. expected("statement");
  1126. consume();
  1127. }
  1128. first = false;
  1129. }
  1130. m_parser_state.m_strict_mode = initial_strict_mode_state;
  1131. consume(TokenType::CurlyClose);
  1132. block->add_variables(m_parser_state.m_let_scopes.last());
  1133. block->add_functions(m_parser_state.m_function_scopes.last());
  1134. return block;
  1135. }
  1136. template<typename FunctionNodeType>
  1137. NonnullRefPtr<FunctionNodeType> Parser::parse_function_node(bool check_for_function_and_name, bool allow_super_property_lookup, bool allow_super_constructor_call)
  1138. {
  1139. TemporaryChange super_property_access_rollback(m_parser_state.m_allow_super_property_lookup, allow_super_property_lookup);
  1140. TemporaryChange super_constructor_call_rollback(m_parser_state.m_allow_super_constructor_call, allow_super_constructor_call);
  1141. ScopePusher scope(*this, ScopePusher::Var | ScopePusher::Function);
  1142. if (check_for_function_and_name)
  1143. consume(TokenType::Function);
  1144. String name;
  1145. if (check_for_function_and_name) {
  1146. if (FunctionNodeType::must_have_name()) {
  1147. name = consume(TokenType::Identifier).value();
  1148. } else {
  1149. if (match(TokenType::Identifier))
  1150. name = consume(TokenType::Identifier).value();
  1151. }
  1152. }
  1153. consume(TokenType::ParenOpen);
  1154. Vector<FunctionNode::Parameter> parameters;
  1155. i32 function_length = -1;
  1156. while (match(TokenType::Identifier) || match(TokenType::TripleDot)) {
  1157. if (match(TokenType::TripleDot)) {
  1158. consume();
  1159. auto parameter_name = consume(TokenType::Identifier).value();
  1160. function_length = parameters.size();
  1161. parameters.append({ parameter_name, nullptr, true });
  1162. break;
  1163. }
  1164. auto parameter_name = consume(TokenType::Identifier).value();
  1165. RefPtr<Expression> default_value;
  1166. if (match(TokenType::Equals)) {
  1167. consume(TokenType::Equals);
  1168. function_length = parameters.size();
  1169. default_value = parse_expression(2);
  1170. }
  1171. parameters.append({ parameter_name, default_value });
  1172. if (match(TokenType::ParenClose))
  1173. break;
  1174. consume(TokenType::Comma);
  1175. }
  1176. consume(TokenType::ParenClose);
  1177. if (function_length == -1)
  1178. function_length = parameters.size();
  1179. bool is_strict = false;
  1180. TemporaryChange change(m_parser_state.m_in_function_context, true);
  1181. auto body = parse_block_statement(is_strict);
  1182. body->add_variables(m_parser_state.m_var_scopes.last());
  1183. body->add_functions(m_parser_state.m_function_scopes.last());
  1184. return create_ast_node<FunctionNodeType>(name, move(body), move(parameters), function_length, NonnullRefPtrVector<VariableDeclaration>(), is_strict);
  1185. }
  1186. NonnullRefPtr<VariableDeclaration> Parser::parse_variable_declaration(bool with_semicolon)
  1187. {
  1188. DeclarationKind declaration_kind;
  1189. switch (m_parser_state.m_current_token.type()) {
  1190. case TokenType::Var:
  1191. declaration_kind = DeclarationKind::Var;
  1192. consume(TokenType::Var);
  1193. break;
  1194. case TokenType::Let:
  1195. declaration_kind = DeclarationKind::Let;
  1196. consume(TokenType::Let);
  1197. break;
  1198. case TokenType::Const:
  1199. declaration_kind = DeclarationKind::Const;
  1200. consume(TokenType::Const);
  1201. break;
  1202. default:
  1203. ASSERT_NOT_REACHED();
  1204. }
  1205. NonnullRefPtrVector<VariableDeclarator> declarations;
  1206. for (;;) {
  1207. auto id = consume(TokenType::Identifier).value();
  1208. RefPtr<Expression> init;
  1209. if (match(TokenType::Equals)) {
  1210. consume();
  1211. init = parse_expression(2);
  1212. }
  1213. declarations.append(create_ast_node<VariableDeclarator>(create_ast_node<Identifier>(move(id)), move(init)));
  1214. if (match(TokenType::Comma)) {
  1215. consume();
  1216. continue;
  1217. }
  1218. break;
  1219. }
  1220. if (with_semicolon)
  1221. consume_or_insert_semicolon();
  1222. auto declaration = create_ast_node<VariableDeclaration>(declaration_kind, move(declarations));
  1223. if (declaration_kind == DeclarationKind::Var)
  1224. m_parser_state.m_var_scopes.last().append(declaration);
  1225. else
  1226. m_parser_state.m_let_scopes.last().append(declaration);
  1227. return declaration;
  1228. }
  1229. NonnullRefPtr<ThrowStatement> Parser::parse_throw_statement()
  1230. {
  1231. consume(TokenType::Throw);
  1232. // Automatic semicolon insertion: terminate statement when throw is followed by newline
  1233. if (m_parser_state.m_current_token.trivia().contains('\n')) {
  1234. syntax_error("No line break is allowed between 'throw' and its expression");
  1235. return create_ast_node<ThrowStatement>(create_ast_node<ErrorExpression>());
  1236. }
  1237. auto expression = parse_expression(0);
  1238. consume_or_insert_semicolon();
  1239. return create_ast_node<ThrowStatement>(move(expression));
  1240. }
  1241. NonnullRefPtr<BreakStatement> Parser::parse_break_statement()
  1242. {
  1243. consume(TokenType::Break);
  1244. FlyString target_label;
  1245. if (match(TokenType::Semicolon)) {
  1246. consume();
  1247. return create_ast_node<BreakStatement>(target_label);
  1248. }
  1249. if (match(TokenType::Identifier) && !m_parser_state.m_current_token.trivia().contains('\n'))
  1250. target_label = consume().value();
  1251. consume_or_insert_semicolon();
  1252. return create_ast_node<BreakStatement>(target_label);
  1253. }
  1254. NonnullRefPtr<ContinueStatement> Parser::parse_continue_statement()
  1255. {
  1256. consume(TokenType::Continue);
  1257. FlyString target_label;
  1258. if (match(TokenType::Semicolon)) {
  1259. consume();
  1260. return create_ast_node<ContinueStatement>(target_label);
  1261. }
  1262. if (match(TokenType::Identifier) && !m_parser_state.m_current_token.trivia().contains('\n'))
  1263. target_label = consume().value();
  1264. consume_or_insert_semicolon();
  1265. return create_ast_node<ContinueStatement>(target_label);
  1266. }
  1267. NonnullRefPtr<ConditionalExpression> Parser::parse_conditional_expression(NonnullRefPtr<Expression> test)
  1268. {
  1269. consume(TokenType::QuestionMark);
  1270. auto consequent = parse_expression(2);
  1271. consume(TokenType::Colon);
  1272. auto alternate = parse_expression(2);
  1273. return create_ast_node<ConditionalExpression>(move(test), move(consequent), move(alternate));
  1274. }
  1275. NonnullRefPtr<TryStatement> Parser::parse_try_statement()
  1276. {
  1277. consume(TokenType::Try);
  1278. auto block = parse_block_statement();
  1279. RefPtr<CatchClause> handler;
  1280. if (match(TokenType::Catch))
  1281. handler = parse_catch_clause();
  1282. RefPtr<BlockStatement> finalizer;
  1283. if (match(TokenType::Finally)) {
  1284. consume();
  1285. finalizer = parse_block_statement();
  1286. }
  1287. return create_ast_node<TryStatement>(move(block), move(handler), move(finalizer));
  1288. }
  1289. NonnullRefPtr<DoWhileStatement> Parser::parse_do_while_statement()
  1290. {
  1291. consume(TokenType::Do);
  1292. auto body = parse_statement();
  1293. consume(TokenType::While);
  1294. consume(TokenType::ParenOpen);
  1295. auto test = parse_expression(0);
  1296. consume(TokenType::ParenClose);
  1297. consume_or_insert_semicolon();
  1298. return create_ast_node<DoWhileStatement>(move(test), move(body));
  1299. }
  1300. NonnullRefPtr<WhileStatement> Parser::parse_while_statement()
  1301. {
  1302. consume(TokenType::While);
  1303. consume(TokenType::ParenOpen);
  1304. auto test = parse_expression(0);
  1305. consume(TokenType::ParenClose);
  1306. auto body = parse_statement();
  1307. return create_ast_node<WhileStatement>(move(test), move(body));
  1308. }
  1309. NonnullRefPtr<SwitchStatement> Parser::parse_switch_statement()
  1310. {
  1311. consume(TokenType::Switch);
  1312. consume(TokenType::ParenOpen);
  1313. auto determinant = parse_expression(0);
  1314. consume(TokenType::ParenClose);
  1315. consume(TokenType::CurlyOpen);
  1316. NonnullRefPtrVector<SwitchCase> cases;
  1317. while (match(TokenType::Case) || match(TokenType::Default))
  1318. cases.append(parse_switch_case());
  1319. consume(TokenType::CurlyClose);
  1320. return create_ast_node<SwitchStatement>(move(determinant), move(cases));
  1321. }
  1322. NonnullRefPtr<SwitchCase> Parser::parse_switch_case()
  1323. {
  1324. RefPtr<Expression> test;
  1325. if (consume().type() == TokenType::Case) {
  1326. test = parse_expression(0);
  1327. }
  1328. consume(TokenType::Colon);
  1329. NonnullRefPtrVector<Statement> consequent;
  1330. while (match_statement())
  1331. consequent.append(parse_statement());
  1332. return create_ast_node<SwitchCase>(move(test), move(consequent));
  1333. }
  1334. NonnullRefPtr<CatchClause> Parser::parse_catch_clause()
  1335. {
  1336. consume(TokenType::Catch);
  1337. String parameter;
  1338. if (match(TokenType::ParenOpen)) {
  1339. consume();
  1340. parameter = consume(TokenType::Identifier).value();
  1341. consume(TokenType::ParenClose);
  1342. }
  1343. auto body = parse_block_statement();
  1344. return create_ast_node<CatchClause>(parameter, move(body));
  1345. }
  1346. NonnullRefPtr<IfStatement> Parser::parse_if_statement()
  1347. {
  1348. consume(TokenType::If);
  1349. consume(TokenType::ParenOpen);
  1350. auto predicate = parse_expression(0);
  1351. consume(TokenType::ParenClose);
  1352. auto consequent = parse_statement();
  1353. RefPtr<Statement> alternate;
  1354. if (match(TokenType::Else)) {
  1355. consume(TokenType::Else);
  1356. alternate = parse_statement();
  1357. }
  1358. return create_ast_node<IfStatement>(move(predicate), move(consequent), move(alternate));
  1359. }
  1360. NonnullRefPtr<Statement> Parser::parse_for_statement()
  1361. {
  1362. auto match_for_in_of = [&]() {
  1363. return match(TokenType::In) || (match(TokenType::Identifier) && m_parser_state.m_current_token.value() == "of");
  1364. };
  1365. consume(TokenType::For);
  1366. consume(TokenType::ParenOpen);
  1367. bool in_scope = false;
  1368. RefPtr<ASTNode> init;
  1369. if (!match(TokenType::Semicolon)) {
  1370. if (match_expression()) {
  1371. init = parse_expression(0, Associativity::Right, { TokenType::In });
  1372. if (match_for_in_of())
  1373. return parse_for_in_of_statement(*init);
  1374. } else if (match_variable_declaration()) {
  1375. if (!match(TokenType::Var)) {
  1376. m_parser_state.m_let_scopes.append(NonnullRefPtrVector<VariableDeclaration>());
  1377. in_scope = true;
  1378. }
  1379. init = parse_variable_declaration(false);
  1380. if (match_for_in_of())
  1381. return parse_for_in_of_statement(*init);
  1382. } else {
  1383. syntax_error("Unexpected token in for loop");
  1384. }
  1385. }
  1386. consume(TokenType::Semicolon);
  1387. RefPtr<Expression> test;
  1388. if (!match(TokenType::Semicolon))
  1389. test = parse_expression(0);
  1390. consume(TokenType::Semicolon);
  1391. RefPtr<Expression> update;
  1392. if (!match(TokenType::ParenClose))
  1393. update = parse_expression(0);
  1394. consume(TokenType::ParenClose);
  1395. auto body = parse_statement();
  1396. if (in_scope) {
  1397. m_parser_state.m_let_scopes.take_last();
  1398. }
  1399. return create_ast_node<ForStatement>(move(init), move(test), move(update), move(body));
  1400. }
  1401. NonnullRefPtr<Statement> Parser::parse_for_in_of_statement(NonnullRefPtr<ASTNode> lhs)
  1402. {
  1403. if (lhs->is_variable_declaration()) {
  1404. auto declarations = static_cast<VariableDeclaration*>(lhs.ptr())->declarations();
  1405. if (declarations.size() > 1) {
  1406. syntax_error("multiple declarations not allowed in for..in/of");
  1407. lhs = create_ast_node<ErrorExpression>();
  1408. }
  1409. if (declarations.first().init() != nullptr) {
  1410. syntax_error("variable initializer not allowed in for..in/of");
  1411. lhs = create_ast_node<ErrorExpression>();
  1412. }
  1413. }
  1414. auto in_or_of = consume();
  1415. auto rhs = parse_expression(0);
  1416. consume(TokenType::ParenClose);
  1417. auto body = parse_statement();
  1418. if (in_or_of.type() == TokenType::In)
  1419. return create_ast_node<ForInStatement>(move(lhs), move(rhs), move(body));
  1420. return create_ast_node<ForOfStatement>(move(lhs), move(rhs), move(body));
  1421. }
  1422. NonnullRefPtr<DebuggerStatement> Parser::parse_debugger_statement()
  1423. {
  1424. consume(TokenType::Debugger);
  1425. consume_or_insert_semicolon();
  1426. return create_ast_node<DebuggerStatement>();
  1427. }
  1428. bool Parser::match(TokenType type) const
  1429. {
  1430. return m_parser_state.m_current_token.type() == type;
  1431. }
  1432. bool Parser::match_variable_declaration() const
  1433. {
  1434. switch (m_parser_state.m_current_token.type()) {
  1435. case TokenType::Var:
  1436. case TokenType::Let:
  1437. case TokenType::Const:
  1438. return true;
  1439. default:
  1440. return false;
  1441. }
  1442. }
  1443. bool Parser::match_expression() const
  1444. {
  1445. auto type = m_parser_state.m_current_token.type();
  1446. return type == TokenType::BoolLiteral
  1447. || type == TokenType::NumericLiteral
  1448. || type == TokenType::BigIntLiteral
  1449. || type == TokenType::StringLiteral
  1450. || type == TokenType::TemplateLiteralStart
  1451. || type == TokenType::NullLiteral
  1452. || type == TokenType::Identifier
  1453. || type == TokenType::New
  1454. || type == TokenType::CurlyOpen
  1455. || type == TokenType::BracketOpen
  1456. || type == TokenType::ParenOpen
  1457. || type == TokenType::Function
  1458. || type == TokenType::This
  1459. || type == TokenType::Super
  1460. || type == TokenType::RegexLiteral
  1461. || match_unary_prefixed_expression();
  1462. }
  1463. bool Parser::match_unary_prefixed_expression() const
  1464. {
  1465. auto type = m_parser_state.m_current_token.type();
  1466. return type == TokenType::PlusPlus
  1467. || type == TokenType::MinusMinus
  1468. || type == TokenType::ExclamationMark
  1469. || type == TokenType::Tilde
  1470. || type == TokenType::Plus
  1471. || type == TokenType::Minus
  1472. || type == TokenType::Typeof
  1473. || type == TokenType::Void
  1474. || type == TokenType::Delete;
  1475. }
  1476. bool Parser::match_secondary_expression(Vector<TokenType> forbidden) const
  1477. {
  1478. auto type = m_parser_state.m_current_token.type();
  1479. if (forbidden.contains_slow(type))
  1480. return false;
  1481. return type == TokenType::Plus
  1482. || type == TokenType::PlusEquals
  1483. || type == TokenType::Minus
  1484. || type == TokenType::MinusEquals
  1485. || type == TokenType::Asterisk
  1486. || type == TokenType::AsteriskEquals
  1487. || type == TokenType::Slash
  1488. || type == TokenType::SlashEquals
  1489. || type == TokenType::Percent
  1490. || type == TokenType::PercentEquals
  1491. || type == TokenType::DoubleAsterisk
  1492. || type == TokenType::DoubleAsteriskEquals
  1493. || type == TokenType::Equals
  1494. || type == TokenType::EqualsEqualsEquals
  1495. || type == TokenType::ExclamationMarkEqualsEquals
  1496. || type == TokenType::EqualsEquals
  1497. || type == TokenType::ExclamationMarkEquals
  1498. || type == TokenType::GreaterThan
  1499. || type == TokenType::GreaterThanEquals
  1500. || type == TokenType::LessThan
  1501. || type == TokenType::LessThanEquals
  1502. || type == TokenType::ParenOpen
  1503. || type == TokenType::Period
  1504. || type == TokenType::BracketOpen
  1505. || type == TokenType::PlusPlus
  1506. || type == TokenType::MinusMinus
  1507. || type == TokenType::In
  1508. || type == TokenType::Instanceof
  1509. || type == TokenType::QuestionMark
  1510. || type == TokenType::Ampersand
  1511. || type == TokenType::AmpersandEquals
  1512. || type == TokenType::Pipe
  1513. || type == TokenType::PipeEquals
  1514. || type == TokenType::Caret
  1515. || type == TokenType::CaretEquals
  1516. || type == TokenType::ShiftLeft
  1517. || type == TokenType::ShiftLeftEquals
  1518. || type == TokenType::ShiftRight
  1519. || type == TokenType::ShiftRightEquals
  1520. || type == TokenType::UnsignedShiftRight
  1521. || type == TokenType::UnsignedShiftRightEquals
  1522. || type == TokenType::DoubleAmpersand
  1523. || type == TokenType::DoubleAmpersandEquals
  1524. || type == TokenType::DoublePipe
  1525. || type == TokenType::DoublePipeEquals
  1526. || type == TokenType::DoubleQuestionMark
  1527. || type == TokenType::DoubleQuestionMarkEquals;
  1528. }
  1529. bool Parser::match_statement() const
  1530. {
  1531. auto type = m_parser_state.m_current_token.type();
  1532. return match_expression()
  1533. || type == TokenType::Function
  1534. || type == TokenType::Return
  1535. || type == TokenType::Let
  1536. || type == TokenType::Class
  1537. || type == TokenType::Do
  1538. || type == TokenType::If
  1539. || type == TokenType::Throw
  1540. || type == TokenType::Try
  1541. || type == TokenType::While
  1542. || type == TokenType::For
  1543. || type == TokenType::Const
  1544. || type == TokenType::CurlyOpen
  1545. || type == TokenType::Switch
  1546. || type == TokenType::Break
  1547. || type == TokenType::Continue
  1548. || type == TokenType::Var
  1549. || type == TokenType::Debugger
  1550. || type == TokenType::Semicolon;
  1551. }
  1552. bool Parser::match_identifier_name() const
  1553. {
  1554. return m_parser_state.m_current_token.is_identifier_name();
  1555. }
  1556. bool Parser::match_property_key() const
  1557. {
  1558. auto type = m_parser_state.m_current_token.type();
  1559. return match_identifier_name()
  1560. || type == TokenType::BracketOpen
  1561. || type == TokenType::StringLiteral
  1562. || type == TokenType::NumericLiteral
  1563. || type == TokenType::BigIntLiteral;
  1564. }
  1565. bool Parser::done() const
  1566. {
  1567. return match(TokenType::Eof);
  1568. }
  1569. Token Parser::consume()
  1570. {
  1571. auto old_token = m_parser_state.m_current_token;
  1572. m_parser_state.m_current_token = m_parser_state.m_lexer.next();
  1573. return old_token;
  1574. }
  1575. void Parser::consume_or_insert_semicolon()
  1576. {
  1577. // Semicolon was found and will be consumed
  1578. if (match(TokenType::Semicolon)) {
  1579. consume();
  1580. return;
  1581. }
  1582. // Insert semicolon if...
  1583. // ...token is preceded by one or more newlines
  1584. if (m_parser_state.m_current_token.trivia().contains('\n'))
  1585. return;
  1586. // ...token is a closing curly brace
  1587. if (match(TokenType::CurlyClose))
  1588. return;
  1589. // ...token is eof
  1590. if (match(TokenType::Eof))
  1591. return;
  1592. // No rule for semicolon insertion applies -> syntax error
  1593. expected("Semicolon");
  1594. }
  1595. Token Parser::consume(TokenType expected_type)
  1596. {
  1597. if (!match(expected_type)) {
  1598. expected(Token::name(expected_type));
  1599. }
  1600. return consume();
  1601. }
  1602. void Parser::expected(const char* what)
  1603. {
  1604. syntax_error(String::formatted("Unexpected token {}. Expected {}", m_parser_state.m_current_token.name(), what));
  1605. }
  1606. void Parser::syntax_error(const String& message, size_t line, size_t column)
  1607. {
  1608. if (line == 0 || column == 0) {
  1609. line = m_parser_state.m_current_token.line_number();
  1610. column = m_parser_state.m_current_token.line_column();
  1611. }
  1612. m_parser_state.m_errors.append({ message, line, column });
  1613. }
  1614. void Parser::save_state()
  1615. {
  1616. m_saved_state.append(m_parser_state);
  1617. }
  1618. void Parser::load_state()
  1619. {
  1620. ASSERT(!m_saved_state.is_empty());
  1621. m_parser_state = m_saved_state.take_last();
  1622. }
  1623. }