Parser.cpp 75 KB

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