Parser.cpp 59 KB

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