Parser.cpp 67 KB

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