Parser.cpp 201 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674
  1. /*
  2. * Copyright (c) 2020, Stephan Unverwerth <s.unverwerth@serenityos.org>
  3. * Copyright (c) 2020-2022, Linus Groh <linusg@serenityos.org>
  4. * Copyright (c) 2021-2022, David Tuin <davidot@serenityos.org>
  5. * Copyright (c) 2021, Ali Mohammad Pur <mpfard@serenityos.org>
  6. * Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
  7. *
  8. * SPDX-License-Identifier: BSD-2-Clause
  9. */
  10. #include "Parser.h"
  11. #include <AK/Array.h>
  12. #include <AK/CharacterTypes.h>
  13. #include <AK/HashTable.h>
  14. #include <AK/ScopeGuard.h>
  15. #include <AK/StdLibExtras.h>
  16. #include <AK/TemporaryChange.h>
  17. #include <LibJS/Runtime/RegExpObject.h>
  18. #include <LibRegex/Regex.h>
  19. namespace JS {
  20. class ScopePusher {
  21. // NOTE: We really only need ModuleTopLevel and NotModuleTopLevel as the only
  22. // difference seems to be in https://tc39.es/ecma262/#sec-static-semantics-varscopeddeclarations
  23. // where ModuleItemList only does the VarScopedDeclaration and not the
  24. // TopLevelVarScopedDeclarations.
  25. enum class ScopeLevel {
  26. NotTopLevel,
  27. ScriptTopLevel,
  28. ModuleTopLevel,
  29. FunctionTopLevel,
  30. StaticInitTopLevel
  31. };
  32. private:
  33. ScopePusher(Parser& parser, ScopeNode* node, ScopeLevel scope_level)
  34. : m_parser(parser)
  35. , m_scope_level(scope_level)
  36. {
  37. m_parent_scope = exchange(m_parser.m_state.current_scope_pusher, this);
  38. VERIFY(node || (m_parent_scope && scope_level == ScopeLevel::NotTopLevel));
  39. if (!node)
  40. m_node = m_parent_scope->m_node;
  41. else
  42. m_node = node;
  43. VERIFY(m_node);
  44. if (!is_top_level())
  45. m_top_level_scope = m_parent_scope->m_top_level_scope;
  46. else
  47. m_top_level_scope = this;
  48. }
  49. bool is_top_level()
  50. {
  51. return m_scope_level != ScopeLevel::NotTopLevel;
  52. }
  53. public:
  54. static ScopePusher function_scope(Parser& parser, FunctionBody& function_body, Vector<FunctionParameter> const& parameters)
  55. {
  56. ScopePusher scope_pusher(parser, &function_body, ScopeLevel::FunctionTopLevel);
  57. scope_pusher.m_function_parameters = parameters;
  58. for (auto& parameter : parameters) {
  59. parameter.binding.visit(
  60. [&](FlyString const& name) {
  61. scope_pusher.m_forbidden_lexical_names.set(name);
  62. },
  63. [&](NonnullRefPtr<BindingPattern> const& binding_pattern) {
  64. binding_pattern->for_each_bound_name([&](auto const& name) {
  65. scope_pusher.m_forbidden_lexical_names.set(name);
  66. });
  67. });
  68. }
  69. return scope_pusher;
  70. }
  71. static ScopePusher program_scope(Parser& parser, Program& program)
  72. {
  73. return ScopePusher(parser, &program, program.type() == Program::Type::Script ? ScopeLevel::ScriptTopLevel : ScopeLevel::ModuleTopLevel);
  74. }
  75. static ScopePusher block_scope(Parser& parser, ScopeNode& node)
  76. {
  77. return ScopePusher(parser, &node, ScopeLevel::NotTopLevel);
  78. }
  79. static ScopePusher for_loop_scope(Parser& parser, RefPtr<ASTNode> const& init)
  80. {
  81. ScopePusher scope_pusher(parser, nullptr, ScopeLevel::NotTopLevel);
  82. if (init && is<VariableDeclaration>(*init)) {
  83. auto& variable_declaration = static_cast<VariableDeclaration const&>(*init);
  84. if (variable_declaration.declaration_kind() != DeclarationKind::Var) {
  85. variable_declaration.for_each_bound_name([&](auto const& name) {
  86. scope_pusher.m_forbidden_var_names.set(name);
  87. });
  88. }
  89. }
  90. return scope_pusher;
  91. }
  92. static ScopePusher catch_scope(Parser& parser, RefPtr<BindingPattern> const& pattern, FlyString const& parameter)
  93. {
  94. ScopePusher scope_pusher(parser, nullptr, ScopeLevel::NotTopLevel);
  95. if (pattern) {
  96. pattern->for_each_bound_name([&](auto const& name) {
  97. scope_pusher.m_forbidden_var_names.set(name);
  98. });
  99. } else if (!parameter.is_empty()) {
  100. scope_pusher.m_var_names.set(parameter);
  101. }
  102. return scope_pusher;
  103. }
  104. static ScopePusher static_init_block_scope(Parser& parser, ScopeNode& node)
  105. {
  106. return ScopePusher(parser, &node, ScopeLevel::StaticInitTopLevel);
  107. }
  108. static ScopePusher class_field_scope(Parser& parser)
  109. {
  110. return ScopePusher(parser, nullptr, ScopeLevel::NotTopLevel);
  111. }
  112. void add_declaration(NonnullRefPtr<Declaration> declaration)
  113. {
  114. if (declaration->is_lexical_declaration()) {
  115. declaration->for_each_bound_name([&](auto const& name) {
  116. if (m_var_names.contains(name) || m_forbidden_lexical_names.contains(name) || m_function_names.contains(name))
  117. throw_identifier_declared(name, declaration);
  118. if (m_lexical_names.set(name) != AK::HashSetResult::InsertedNewEntry)
  119. throw_identifier_declared(name, declaration);
  120. });
  121. m_node->add_lexical_declaration(move(declaration));
  122. } else if (!declaration->is_function_declaration()) {
  123. declaration->for_each_bound_name([&](auto const& name) {
  124. ScopePusher* pusher = this;
  125. while (true) {
  126. if (pusher->m_lexical_names.contains(name)
  127. || pusher->m_function_names.contains(name)
  128. || pusher->m_forbidden_var_names.contains(name))
  129. throw_identifier_declared(name, declaration);
  130. pusher->m_var_names.set(name);
  131. if (pusher->is_top_level())
  132. break;
  133. VERIFY(pusher->m_parent_scope != nullptr);
  134. pusher = pusher->m_parent_scope;
  135. }
  136. VERIFY(pusher->is_top_level() && pusher->m_node);
  137. pusher->m_node->add_var_scoped_declaration(declaration);
  138. });
  139. VERIFY(m_top_level_scope);
  140. m_top_level_scope->m_node->add_var_scoped_declaration(move(declaration));
  141. } else {
  142. if (m_scope_level != ScopeLevel::NotTopLevel && m_scope_level != ScopeLevel::ModuleTopLevel) {
  143. // Only non-top levels and Module don't var declare the top functions
  144. declaration->for_each_bound_name([&](auto const& name) {
  145. m_var_names.set(name);
  146. });
  147. m_node->add_var_scoped_declaration(move(declaration));
  148. } else {
  149. VERIFY(is<FunctionDeclaration>(*declaration));
  150. auto& function_declaration = static_cast<FunctionDeclaration const&>(*declaration);
  151. auto& function_name = function_declaration.name();
  152. if (m_var_names.contains(function_name) || m_lexical_names.contains(function_name))
  153. throw_identifier_declared(function_name, declaration);
  154. if (function_declaration.kind() != FunctionKind::Normal || m_parser.m_state.strict_mode) {
  155. if (m_function_names.contains(function_name))
  156. throw_identifier_declared(function_name, declaration);
  157. m_lexical_names.set(function_name);
  158. m_node->add_lexical_declaration(move(declaration));
  159. return;
  160. }
  161. m_function_names.set(function_name);
  162. if (!m_lexical_names.contains(function_name))
  163. m_functions_to_hoist.append(static_ptr_cast<FunctionDeclaration>(declaration));
  164. m_node->add_lexical_declaration(move(declaration));
  165. }
  166. }
  167. }
  168. ScopePusher const* last_function_scope() const
  169. {
  170. for (auto scope_ptr = this; scope_ptr; scope_ptr = scope_ptr->m_parent_scope) {
  171. if (scope_ptr->m_function_parameters.has_value())
  172. return scope_ptr;
  173. }
  174. return nullptr;
  175. }
  176. Vector<FunctionParameter> const& function_parameters() const
  177. {
  178. return *m_function_parameters;
  179. }
  180. ScopePusher* parent_scope() { return m_parent_scope; }
  181. ScopePusher const* parent_scope() const { return m_parent_scope; }
  182. [[nodiscard]] bool has_declaration(FlyString const& name) const
  183. {
  184. return m_lexical_names.contains(name) || m_var_names.contains(name) || !m_functions_to_hoist.find_if([&name](auto& function) { return function->name() == name; }).is_end();
  185. }
  186. bool contains_direct_call_to_eval() const { return m_contains_direct_call_to_eval; }
  187. bool contains_access_to_arguments_object() const { return m_contains_access_to_arguments_object; }
  188. void set_contains_direct_call_to_eval() { m_contains_direct_call_to_eval = true; }
  189. void set_contains_access_to_arguments_object() { m_contains_access_to_arguments_object = true; }
  190. ~ScopePusher()
  191. {
  192. VERIFY(is_top_level() || m_parent_scope);
  193. for (size_t i = 0; i < m_functions_to_hoist.size(); i++) {
  194. auto const& function_declaration = m_functions_to_hoist[i];
  195. if (m_lexical_names.contains(function_declaration.name()) || m_forbidden_var_names.contains(function_declaration.name()))
  196. continue;
  197. if (is_top_level()) {
  198. m_node->add_hoisted_function(move(m_functions_to_hoist[i]));
  199. } else {
  200. if (!m_parent_scope->m_lexical_names.contains(function_declaration.name()) && !m_parent_scope->m_function_names.contains(function_declaration.name()))
  201. m_parent_scope->m_functions_to_hoist.append(move(m_functions_to_hoist[i]));
  202. }
  203. }
  204. if (m_parent_scope && !m_function_parameters.has_value()) {
  205. m_parent_scope->m_contains_access_to_arguments_object |= m_contains_access_to_arguments_object;
  206. m_parent_scope->m_contains_direct_call_to_eval |= m_contains_direct_call_to_eval;
  207. }
  208. VERIFY(m_parser.m_state.current_scope_pusher == this);
  209. m_parser.m_state.current_scope_pusher = m_parent_scope;
  210. }
  211. void set_contains_await_expression()
  212. {
  213. m_contains_await_expression = true;
  214. }
  215. bool contains_await_expression() const
  216. {
  217. return m_contains_await_expression;
  218. }
  219. private:
  220. void throw_identifier_declared(FlyString const& name, NonnullRefPtr<Declaration> const& declaration)
  221. {
  222. m_parser.syntax_error(String::formatted("Identifier '{}' already declared", name), declaration->source_range().start);
  223. }
  224. Parser& m_parser;
  225. ScopeNode* m_node { nullptr };
  226. ScopeLevel m_scope_level { ScopeLevel::NotTopLevel };
  227. ScopePusher* m_parent_scope { nullptr };
  228. ScopePusher* m_top_level_scope { nullptr };
  229. HashTable<FlyString> m_lexical_names;
  230. HashTable<FlyString> m_var_names;
  231. HashTable<FlyString> m_function_names;
  232. HashTable<FlyString> m_forbidden_lexical_names;
  233. HashTable<FlyString> m_forbidden_var_names;
  234. NonnullRefPtrVector<FunctionDeclaration> m_functions_to_hoist;
  235. Optional<Vector<FunctionParameter>> m_function_parameters;
  236. bool m_contains_access_to_arguments_object { false };
  237. bool m_contains_direct_call_to_eval { false };
  238. bool m_contains_await_expression { false };
  239. };
  240. class OperatorPrecedenceTable {
  241. public:
  242. constexpr OperatorPrecedenceTable()
  243. : m_token_precedence()
  244. {
  245. for (size_t i = 0; i < array_size(m_operator_precedence); ++i) {
  246. auto& op = m_operator_precedence[i];
  247. m_token_precedence[static_cast<size_t>(op.token)] = op.precedence;
  248. }
  249. }
  250. constexpr int get(TokenType token) const
  251. {
  252. int p = m_token_precedence[static_cast<size_t>(token)];
  253. if (p == 0) {
  254. warnln("Internal Error: No precedence for operator {}", Token::name(token));
  255. VERIFY_NOT_REACHED();
  256. return -1;
  257. }
  258. return p;
  259. }
  260. private:
  261. int m_token_precedence[cs_num_of_js_tokens];
  262. struct OperatorPrecedence {
  263. TokenType token;
  264. int precedence;
  265. };
  266. // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_Precedence
  267. static constexpr const OperatorPrecedence m_operator_precedence[] = {
  268. { TokenType::Period, 20 },
  269. { TokenType::BracketOpen, 20 },
  270. { TokenType::ParenOpen, 20 },
  271. { TokenType::QuestionMarkPeriod, 20 },
  272. { TokenType::New, 19 },
  273. { TokenType::PlusPlus, 18 },
  274. { TokenType::MinusMinus, 18 },
  275. { TokenType::ExclamationMark, 17 },
  276. { TokenType::Tilde, 17 },
  277. { TokenType::Typeof, 17 },
  278. { TokenType::Void, 17 },
  279. { TokenType::Delete, 17 },
  280. { TokenType::Await, 17 },
  281. { TokenType::DoubleAsterisk, 16 },
  282. { TokenType::Asterisk, 15 },
  283. { TokenType::Slash, 15 },
  284. { TokenType::Percent, 15 },
  285. { TokenType::Plus, 14 },
  286. { TokenType::Minus, 14 },
  287. { TokenType::ShiftLeft, 13 },
  288. { TokenType::ShiftRight, 13 },
  289. { TokenType::UnsignedShiftRight, 13 },
  290. { TokenType::LessThan, 12 },
  291. { TokenType::LessThanEquals, 12 },
  292. { TokenType::GreaterThan, 12 },
  293. { TokenType::GreaterThanEquals, 12 },
  294. { TokenType::In, 12 },
  295. { TokenType::Instanceof, 12 },
  296. { TokenType::EqualsEquals, 11 },
  297. { TokenType::ExclamationMarkEquals, 11 },
  298. { TokenType::EqualsEqualsEquals, 11 },
  299. { TokenType::ExclamationMarkEqualsEquals, 11 },
  300. { TokenType::Ampersand, 10 },
  301. { TokenType::Caret, 9 },
  302. { TokenType::Pipe, 8 },
  303. { TokenType::DoubleQuestionMark, 7 },
  304. { TokenType::DoubleAmpersand, 6 },
  305. { TokenType::DoublePipe, 5 },
  306. { TokenType::QuestionMark, 4 },
  307. { TokenType::Equals, 3 },
  308. { TokenType::PlusEquals, 3 },
  309. { TokenType::MinusEquals, 3 },
  310. { TokenType::DoubleAsteriskEquals, 3 },
  311. { TokenType::AsteriskEquals, 3 },
  312. { TokenType::SlashEquals, 3 },
  313. { TokenType::PercentEquals, 3 },
  314. { TokenType::ShiftLeftEquals, 3 },
  315. { TokenType::ShiftRightEquals, 3 },
  316. { TokenType::UnsignedShiftRightEquals, 3 },
  317. { TokenType::AmpersandEquals, 3 },
  318. { TokenType::CaretEquals, 3 },
  319. { TokenType::PipeEquals, 3 },
  320. { TokenType::DoubleAmpersandEquals, 3 },
  321. { TokenType::DoublePipeEquals, 3 },
  322. { TokenType::DoubleQuestionMarkEquals, 3 },
  323. { TokenType::Yield, 2 },
  324. { TokenType::Comma, 1 },
  325. };
  326. };
  327. constexpr OperatorPrecedenceTable g_operator_precedence;
  328. Parser::ParserState::ParserState(Lexer l, Program::Type program_type)
  329. : lexer(move(l))
  330. {
  331. if (program_type == Program::Type::Module)
  332. lexer.disallow_html_comments();
  333. current_token = lexer.next();
  334. }
  335. Parser::Parser(Lexer lexer, Program::Type program_type, Optional<EvalInitialState> initial_state_for_eval)
  336. : m_source_code(SourceCode::create(lexer.filename(), lexer.source()))
  337. , m_state(move(lexer), program_type)
  338. , m_program_type(program_type)
  339. {
  340. if (initial_state_for_eval.has_value()) {
  341. m_state.in_eval_function_context = initial_state_for_eval->in_eval_function_context;
  342. m_state.allow_super_property_lookup = initial_state_for_eval->allow_super_property_lookup;
  343. m_state.allow_super_constructor_call = initial_state_for_eval->allow_super_constructor_call;
  344. m_state.in_class_field_initializer = initial_state_for_eval->in_class_field_initializer;
  345. }
  346. }
  347. Associativity Parser::operator_associativity(TokenType type) const
  348. {
  349. switch (type) {
  350. case TokenType::Period:
  351. case TokenType::BracketOpen:
  352. case TokenType::ParenOpen:
  353. case TokenType::QuestionMarkPeriod:
  354. case TokenType::Asterisk:
  355. case TokenType::Slash:
  356. case TokenType::Percent:
  357. case TokenType::Plus:
  358. case TokenType::Minus:
  359. case TokenType::ShiftLeft:
  360. case TokenType::ShiftRight:
  361. case TokenType::UnsignedShiftRight:
  362. case TokenType::LessThan:
  363. case TokenType::LessThanEquals:
  364. case TokenType::GreaterThan:
  365. case TokenType::GreaterThanEquals:
  366. case TokenType::In:
  367. case TokenType::Instanceof:
  368. case TokenType::EqualsEquals:
  369. case TokenType::ExclamationMarkEquals:
  370. case TokenType::EqualsEqualsEquals:
  371. case TokenType::ExclamationMarkEqualsEquals:
  372. case TokenType::Typeof:
  373. case TokenType::Void:
  374. case TokenType::Delete:
  375. case TokenType::Await:
  376. case TokenType::Ampersand:
  377. case TokenType::Caret:
  378. case TokenType::Pipe:
  379. case TokenType::DoubleQuestionMark:
  380. case TokenType::DoubleAmpersand:
  381. case TokenType::DoublePipe:
  382. case TokenType::Comma:
  383. return Associativity::Left;
  384. default:
  385. return Associativity::Right;
  386. }
  387. }
  388. bool Parser::parse_directive(ScopeNode& body)
  389. {
  390. bool found_use_strict = false;
  391. while (!done() && match(TokenType::StringLiteral)) {
  392. auto raw_value = m_state.current_token.original_value();
  393. // It cannot be a labelled function since we hit a string literal.
  394. auto statement = parse_statement(AllowLabelledFunction::No);
  395. body.append(statement);
  396. VERIFY(is<ExpressionStatement>(*statement));
  397. auto& expression = static_cast<ExpressionStatement const&>(*statement).expression();
  398. if (!is<StringLiteral>(expression))
  399. break;
  400. if (raw_value.is_one_of("'use strict'"sv, "\"use strict\"")) {
  401. found_use_strict = true;
  402. if (m_state.string_legacy_octal_escape_sequence_in_scope)
  403. syntax_error("Octal escape sequence in string literal not allowed in strict mode");
  404. break;
  405. }
  406. }
  407. m_state.string_legacy_octal_escape_sequence_in_scope = false;
  408. return found_use_strict;
  409. }
  410. NonnullRefPtr<Program> Parser::parse_program(bool starts_in_strict_mode)
  411. {
  412. auto rule_start = push_start();
  413. auto program = adopt_ref(*new Program({ m_source_code, rule_start.position(), position() }, m_program_type));
  414. ScopePusher program_scope = ScopePusher::program_scope(*this, *program);
  415. if (m_program_type == Program::Type::Script)
  416. parse_script(program, starts_in_strict_mode);
  417. else
  418. parse_module(program);
  419. program->set_end_offset({}, position().offset);
  420. return program;
  421. }
  422. void Parser::parse_script(Program& program, bool starts_in_strict_mode)
  423. {
  424. bool strict_before = m_state.strict_mode;
  425. if (starts_in_strict_mode)
  426. m_state.strict_mode = true;
  427. bool has_use_strict = parse_directive(program);
  428. if (m_state.strict_mode || has_use_strict) {
  429. program.set_strict_mode();
  430. m_state.strict_mode = true;
  431. }
  432. parse_statement_list(program, AllowLabelledFunction::Yes);
  433. if (!done()) {
  434. expected("statement or declaration");
  435. consume();
  436. }
  437. m_state.strict_mode = strict_before;
  438. }
  439. void Parser::parse_module(Program& program)
  440. {
  441. TemporaryChange strict_mode_rollback(m_state.strict_mode, true);
  442. TemporaryChange await_expression_valid_rollback(m_state.await_expression_is_valid, true);
  443. // Since strict mode is already enabled we skip any directive parsing.
  444. while (!done()) {
  445. parse_statement_list(program, AllowLabelledFunction::Yes);
  446. if (done())
  447. break;
  448. if (match_export_or_import()) {
  449. VERIFY(m_state.current_token.type() == TokenType::Export || m_state.current_token.type() == TokenType::Import);
  450. if (m_state.current_token.type() == TokenType::Export)
  451. program.append_export(parse_export_statement(program));
  452. else
  453. program.append_import(parse_import_statement(program));
  454. } else {
  455. expected("statement or declaration");
  456. consume();
  457. }
  458. }
  459. VERIFY(m_state.current_scope_pusher);
  460. if (m_state.current_scope_pusher->contains_await_expression())
  461. program.set_has_top_level_await();
  462. for (auto& export_statement : program.exports()) {
  463. if (export_statement.has_statement())
  464. continue;
  465. for (auto& entry : export_statement.entries()) {
  466. if (entry.is_module_request() || entry.kind == ExportEntry::Kind::EmptyNamedExport)
  467. return;
  468. auto const& exported_name = entry.local_or_import_name;
  469. bool found = false;
  470. program.for_each_lexically_declared_name([&](auto const& name) {
  471. if (name == exported_name)
  472. found = true;
  473. });
  474. if (found)
  475. continue;
  476. program.for_each_var_declared_name([&](auto const& name) {
  477. if (name == exported_name)
  478. found = true;
  479. });
  480. for (auto& import : program.imports()) {
  481. if (import.has_bound_name(exported_name)) {
  482. found = true;
  483. break;
  484. }
  485. }
  486. if (!found)
  487. syntax_error(String::formatted("'{}' in export is not declared", exported_name), export_statement.source_range().start);
  488. }
  489. }
  490. }
  491. NonnullRefPtr<Declaration> Parser::parse_declaration()
  492. {
  493. auto rule_start = push_start();
  494. if (m_state.current_token.type() == TokenType::Async && next_token().type() == TokenType::Function)
  495. return parse_function_node<FunctionDeclaration>();
  496. switch (m_state.current_token.type()) {
  497. case TokenType::Class:
  498. return parse_class_declaration();
  499. case TokenType::Function:
  500. return parse_function_node<FunctionDeclaration>();
  501. case TokenType::Let:
  502. case TokenType::Const:
  503. return parse_variable_declaration();
  504. default:
  505. expected("declaration");
  506. consume();
  507. return create_ast_node<ErrorDeclaration>({ m_source_code, rule_start.position(), position() });
  508. }
  509. }
  510. NonnullRefPtr<Statement> Parser::parse_statement(AllowLabelledFunction allow_labelled_function)
  511. {
  512. auto rule_start = push_start();
  513. auto type = m_state.current_token.type();
  514. switch (type) {
  515. case TokenType::CurlyOpen:
  516. return parse_block_statement();
  517. case TokenType::Return:
  518. return parse_return_statement();
  519. case TokenType::Var: {
  520. auto declaration = parse_variable_declaration();
  521. m_state.current_scope_pusher->add_declaration(declaration);
  522. return declaration;
  523. }
  524. case TokenType::For:
  525. return parse_for_statement();
  526. case TokenType::If:
  527. return parse_if_statement();
  528. case TokenType::Throw:
  529. return parse_throw_statement();
  530. case TokenType::Try:
  531. return parse_try_statement();
  532. case TokenType::Break:
  533. return parse_break_statement();
  534. case TokenType::Continue:
  535. return parse_continue_statement();
  536. case TokenType::Switch:
  537. return parse_switch_statement();
  538. case TokenType::Do:
  539. return parse_do_while_statement();
  540. case TokenType::While:
  541. return parse_while_statement();
  542. case TokenType::With:
  543. if (m_state.strict_mode)
  544. syntax_error("'with' statement not allowed in strict mode");
  545. return parse_with_statement();
  546. case TokenType::Debugger:
  547. return parse_debugger_statement();
  548. case TokenType::Semicolon:
  549. consume();
  550. return create_ast_node<EmptyStatement>({ m_source_code, rule_start.position(), position() });
  551. case TokenType::Slash:
  552. case TokenType::SlashEquals:
  553. m_state.current_token = m_state.lexer.force_slash_as_regex();
  554. [[fallthrough]];
  555. default:
  556. if (match_invalid_escaped_keyword())
  557. syntax_error("Keyword must not contain escaped characters");
  558. if (match_identifier_name()) {
  559. auto result = try_parse_labelled_statement(allow_labelled_function);
  560. if (!result.is_null())
  561. return result.release_nonnull();
  562. }
  563. if (match_expression()) {
  564. if (match(TokenType::Async)) {
  565. auto lookahead_token = next_token();
  566. if (lookahead_token.type() == TokenType::Function && !lookahead_token.trivia_contains_line_terminator())
  567. syntax_error("Async function declaration not allowed in single-statement context");
  568. } else if (match(TokenType::Function) || match(TokenType::Class)) {
  569. syntax_error(String::formatted("{} declaration not allowed in single-statement context", m_state.current_token.name()));
  570. } else if (match(TokenType::Let) && next_token().type() == TokenType::BracketOpen) {
  571. syntax_error(String::formatted("let followed by [ is not allowed in single-statement context"));
  572. }
  573. auto expr = parse_expression(0);
  574. consume_or_insert_semicolon();
  575. return create_ast_node<ExpressionStatement>({ m_source_code, rule_start.position(), position() }, move(expr));
  576. }
  577. expected("statement");
  578. consume();
  579. return create_ast_node<ErrorStatement>({ m_source_code, rule_start.position(), position() });
  580. }
  581. }
  582. bool Parser::match_invalid_escaped_keyword() const
  583. {
  584. if (m_state.current_token.type() != TokenType::EscapedKeyword)
  585. return false;
  586. auto token_value = m_state.current_token.value();
  587. if (token_value == "await"sv)
  588. return m_program_type == Program::Type::Module || m_state.await_expression_is_valid;
  589. if (token_value == "async"sv)
  590. return false;
  591. if (token_value == "yield"sv)
  592. return m_state.in_generator_function_context;
  593. if (m_state.strict_mode)
  594. return true;
  595. return token_value != "let"sv;
  596. }
  597. static constexpr AK::Array<StringView, 9> strict_reserved_words = { "implements"sv, "interface"sv, "let"sv, "package"sv, "private"sv, "protected"sv, "public"sv, "static"sv, "yield"sv };
  598. static bool is_strict_reserved_word(StringView str)
  599. {
  600. return any_of(strict_reserved_words, [&str](StringView word) {
  601. return word == str;
  602. });
  603. }
  604. static bool is_simple_parameter_list(Vector<FunctionParameter> const& parameters)
  605. {
  606. return all_of(parameters, [](FunctionParameter const& parameter) {
  607. return !parameter.is_rest && parameter.default_value.is_null() && parameter.binding.has<FlyString>();
  608. });
  609. }
  610. RefPtr<FunctionExpression> Parser::try_parse_arrow_function_expression(bool expect_parens, bool is_async)
  611. {
  612. if (is_async)
  613. VERIFY(match(TokenType::Async));
  614. if (!expect_parens && !is_async) {
  615. // NOTE: This is a fast path where we try to fail early in case this can't possibly
  616. // be a match. The idea is to avoid the expensive parser state save/load mechanism.
  617. // The logic is duplicated below in the "real" !expect_parens branch.
  618. if (!match_identifier() && !match(TokenType::Yield) && !match(TokenType::Await))
  619. return nullptr;
  620. auto token = next_token();
  621. if (token.trivia_contains_line_terminator())
  622. return nullptr;
  623. if (token.type() != TokenType::Arrow)
  624. return nullptr;
  625. }
  626. save_state();
  627. auto rule_start = (expect_parens && !is_async)
  628. // Someone has consumed the opening parenthesis for us! Start there.
  629. ? RulePosition { *this, m_rule_starts.last() }
  630. // We've not encountered one yet, so the rule start is actually here.
  631. : push_start();
  632. ArmedScopeGuard state_rollback_guard = [&] {
  633. load_state();
  634. };
  635. auto function_kind = FunctionKind::Normal;
  636. if (is_async) {
  637. consume(TokenType::Async);
  638. function_kind = FunctionKind::Async;
  639. if (m_state.current_token.trivia_contains_line_terminator())
  640. return nullptr;
  641. // Since we have async it can be followed by paren open in the expect_parens case
  642. // so we also consume that token.
  643. if (expect_parens) {
  644. VERIFY(match(TokenType::ParenOpen));
  645. consume(TokenType::ParenOpen);
  646. }
  647. }
  648. Vector<FunctionParameter> parameters;
  649. i32 function_length = -1;
  650. if (expect_parens) {
  651. // We have parens around the function parameters and can re-use the same parsing
  652. // logic used for regular functions: multiple parameters, default values, rest
  653. // parameter, maybe a trailing comma. If we have a new syntax error afterwards we
  654. // check if it's about a wrong token (something like duplicate parameter name must
  655. // not abort), know parsing failed and rollback the parser state.
  656. auto previous_syntax_errors = m_state.errors.size();
  657. TemporaryChange in_async_context(m_state.await_expression_is_valid, is_async || m_state.await_expression_is_valid);
  658. parameters = parse_formal_parameters(function_length, FunctionNodeParseOptions::IsArrowFunction | (is_async ? FunctionNodeParseOptions::IsAsyncFunction : 0));
  659. if (m_state.errors.size() > previous_syntax_errors && m_state.errors[previous_syntax_errors].message.starts_with("Unexpected token"sv))
  660. return nullptr;
  661. if (!match(TokenType::ParenClose))
  662. return nullptr;
  663. consume();
  664. } else {
  665. // No parens - this must be an identifier followed by arrow. That's it.
  666. if (!match_identifier() && !match(TokenType::Yield) && !match(TokenType::Await))
  667. return nullptr;
  668. auto token = consume_identifier_reference();
  669. if (m_state.strict_mode && token.value().is_one_of("arguments"sv, "eval"sv))
  670. syntax_error("BindingIdentifier may not be 'arguments' or 'eval' in strict mode");
  671. if (is_async && token.value() == "await"sv)
  672. syntax_error("'await' is a reserved identifier in async functions");
  673. parameters.append({ FlyString { token.value() }, {} });
  674. }
  675. // If there's a newline between the closing paren and arrow it's not a valid arrow function,
  676. // ASI should kick in instead (it'll then fail with "Unexpected token Arrow")
  677. if (m_state.current_token.trivia_contains_line_terminator())
  678. return nullptr;
  679. if (!match(TokenType::Arrow))
  680. return nullptr;
  681. consume();
  682. if (function_length == -1)
  683. function_length = parameters.size();
  684. auto old_labels_in_scope = move(m_state.labels_in_scope);
  685. ScopeGuard guard([&]() {
  686. m_state.labels_in_scope = move(old_labels_in_scope);
  687. });
  688. bool contains_direct_call_to_eval = false;
  689. auto function_body_result = [&]() -> RefPtr<FunctionBody> {
  690. TemporaryChange change(m_state.in_arrow_function_context, true);
  691. TemporaryChange async_context_change(m_state.await_expression_is_valid, is_async);
  692. TemporaryChange in_class_static_init_block_change(m_state.in_class_static_init_block, false);
  693. if (match(TokenType::CurlyOpen)) {
  694. // Parse a function body with statements
  695. consume(TokenType::CurlyOpen);
  696. auto body = parse_function_body(parameters, function_kind, contains_direct_call_to_eval);
  697. consume(TokenType::CurlyClose);
  698. return body;
  699. }
  700. if (match_expression()) {
  701. // Parse a function body which returns a single expression
  702. // FIXME: We synthesize a block with a return statement
  703. // for arrow function bodies which are a single expression.
  704. // Esprima generates a single "ArrowFunctionExpression"
  705. // with a "body" property.
  706. auto return_block = create_ast_node<FunctionBody>({ m_source_code, rule_start.position(), position() });
  707. ScopePusher function_scope = ScopePusher::function_scope(*this, return_block, parameters);
  708. auto return_expression = parse_expression(2);
  709. return_block->append<ReturnStatement>({ m_source_code, rule_start.position(), position() }, move(return_expression));
  710. if (m_state.strict_mode)
  711. return_block->set_strict_mode();
  712. contains_direct_call_to_eval = function_scope.contains_direct_call_to_eval();
  713. return return_block;
  714. }
  715. // Invalid arrow function body
  716. return nullptr;
  717. }();
  718. if (function_body_result.is_null())
  719. return nullptr;
  720. state_rollback_guard.disarm();
  721. discard_saved_state();
  722. auto body = function_body_result.release_nonnull();
  723. if (body->in_strict_mode()) {
  724. for (auto& parameter : parameters) {
  725. parameter.binding.visit(
  726. [&](FlyString const& name) {
  727. check_identifier_name_for_assignment_validity(name, true);
  728. },
  729. [&](auto const&) {});
  730. }
  731. }
  732. auto function_start_offset = rule_start.position().offset;
  733. auto function_end_offset = position().offset - m_state.current_token.trivia().length();
  734. auto source_text = String { m_state.lexer.source().substring_view(function_start_offset, function_end_offset - function_start_offset) };
  735. return create_ast_node<FunctionExpression>(
  736. { m_source_code, rule_start.position(), position() }, "", move(source_text),
  737. move(body), move(parameters), function_length, function_kind, body->in_strict_mode(),
  738. /* might_need_arguments_object */ false, contains_direct_call_to_eval, /* is_arrow_function */ true);
  739. }
  740. RefPtr<LabelledStatement> Parser::try_parse_labelled_statement(AllowLabelledFunction allow_function)
  741. {
  742. {
  743. // NOTE: This is a fast path where we try to fail early to avoid the expensive save_state+load_state.
  744. if (next_token().type() != TokenType::Colon)
  745. return {};
  746. }
  747. save_state();
  748. auto rule_start = push_start();
  749. ArmedScopeGuard state_rollback_guard = [&] {
  750. load_state();
  751. };
  752. if (m_state.current_token.value() == "yield"sv && (m_state.strict_mode || m_state.in_generator_function_context)) {
  753. return {};
  754. }
  755. if (m_state.current_token.value() == "await"sv && (m_program_type == Program::Type::Module || m_state.await_expression_is_valid || m_state.in_class_static_init_block)) {
  756. return {};
  757. }
  758. auto identifier = [&] {
  759. if (m_state.current_token.value() == "await"sv) {
  760. return consume().value();
  761. }
  762. return consume_identifier_reference().value();
  763. }();
  764. if (!match(TokenType::Colon))
  765. return {};
  766. consume(TokenType::Colon);
  767. if (!match_statement())
  768. return {};
  769. state_rollback_guard.disarm();
  770. discard_saved_state();
  771. if (m_state.strict_mode && identifier == "let"sv) {
  772. syntax_error("Strict mode reserved word 'let' is not allowed in label", rule_start.position());
  773. return {};
  774. }
  775. if (match(TokenType::Function) && (allow_function == AllowLabelledFunction::No || m_state.strict_mode)) {
  776. syntax_error("Not allowed to declare a function here");
  777. return {};
  778. }
  779. if (m_state.labels_in_scope.contains(identifier))
  780. syntax_error(String::formatted("Label '{}' has already been declared", identifier));
  781. RefPtr<Statement> labelled_item;
  782. auto is_iteration_statement = false;
  783. if (match(TokenType::Function)) {
  784. m_state.labels_in_scope.set(identifier, {});
  785. auto function_declaration = parse_function_node<FunctionDeclaration>();
  786. VERIFY(m_state.current_scope_pusher);
  787. m_state.current_scope_pusher->add_declaration(function_declaration);
  788. if (function_declaration->kind() == FunctionKind::Generator)
  789. syntax_error("Generator functions cannot be defined in labelled statements");
  790. if (function_declaration->kind() == FunctionKind::Async)
  791. syntax_error("Async functions cannot be defined in labelled statements");
  792. labelled_item = move(function_declaration);
  793. } else {
  794. m_state.labels_in_scope.set(identifier, {});
  795. labelled_item = parse_statement(allow_function);
  796. // Extract the innermost statement from a potentially nested chain of LabelledStatements.
  797. auto statement = labelled_item;
  798. while (is<LabelledStatement>(*statement))
  799. statement = static_cast<LabelledStatement&>(*statement).labelled_item();
  800. if (is<IterationStatement>(*statement))
  801. is_iteration_statement = true;
  802. }
  803. if (!is_iteration_statement) {
  804. if (auto entry = m_state.labels_in_scope.find(identifier); entry != m_state.labels_in_scope.end() && entry->value.has_value())
  805. syntax_error("labelled continue statement cannot use non iterating statement", m_state.labels_in_scope.get(identifier).value());
  806. }
  807. m_state.labels_in_scope.remove(identifier);
  808. return create_ast_node<LabelledStatement>({ m_source_code, rule_start.position(), position() }, identifier, labelled_item.release_nonnull());
  809. }
  810. RefPtr<MetaProperty> Parser::try_parse_new_target_expression()
  811. {
  812. // Optimization which skips the save/load state.
  813. if (next_token().type() != TokenType::Period)
  814. return {};
  815. save_state();
  816. auto rule_start = push_start();
  817. ArmedScopeGuard state_rollback_guard = [&] {
  818. load_state();
  819. };
  820. consume(TokenType::New);
  821. consume(TokenType::Period);
  822. if (!match(TokenType::Identifier))
  823. return {};
  824. // The string 'target' cannot have escapes so we check original value.
  825. if (consume().original_value() != "target"sv)
  826. return {};
  827. state_rollback_guard.disarm();
  828. discard_saved_state();
  829. return create_ast_node<MetaProperty>({ m_source_code, rule_start.position(), position() }, MetaProperty::Type::NewTarget);
  830. }
  831. RefPtr<MetaProperty> Parser::try_parse_import_meta_expression()
  832. {
  833. // Optimization which skips the save/load state.
  834. if (next_token().type() != TokenType::Period)
  835. return {};
  836. save_state();
  837. auto rule_start = push_start();
  838. ArmedScopeGuard state_rollback_guard = [&] {
  839. load_state();
  840. };
  841. consume(TokenType::Import);
  842. consume(TokenType::Period);
  843. if (!match(TokenType::Identifier))
  844. return {};
  845. // The string 'meta' cannot have escapes so we check original value.
  846. if (consume().original_value() != "meta"sv)
  847. return {};
  848. state_rollback_guard.disarm();
  849. discard_saved_state();
  850. return create_ast_node<MetaProperty>({ m_source_code, rule_start.position(), position() }, MetaProperty::Type::ImportMeta);
  851. }
  852. NonnullRefPtr<ImportCall> Parser::parse_import_call()
  853. {
  854. auto rule_start = push_start();
  855. // We use the extended definition:
  856. // ImportCall[Yield, Await]:
  857. // import(AssignmentExpression[+In, ?Yield, ?Await] ,opt)
  858. // import(AssignmentExpression[+In, ?Yield, ?Await] ,AssignmentExpression[+In, ?Yield, ?Await] ,opt)
  859. // From https://tc39.es/proposal-import-assertions/#sec-evaluate-import-call
  860. consume(TokenType::Import);
  861. consume(TokenType::ParenOpen);
  862. auto argument = parse_expression(2);
  863. RefPtr<Expression> options;
  864. if (match(TokenType::Comma)) {
  865. consume(TokenType::Comma);
  866. if (!match(TokenType::ParenClose)) {
  867. options = parse_expression(2);
  868. // Second optional comma
  869. if (match(TokenType::Comma))
  870. consume(TokenType::Comma);
  871. }
  872. }
  873. consume(TokenType::ParenClose);
  874. return create_ast_node<ImportCall>({ m_source_code, rule_start.position(), position() }, move(argument), move(options));
  875. }
  876. NonnullRefPtr<ClassDeclaration> Parser::parse_class_declaration()
  877. {
  878. auto rule_start = push_start();
  879. return create_ast_node<ClassDeclaration>({ m_source_code, rule_start.position(), position() }, parse_class_expression(true));
  880. }
  881. NonnullRefPtr<ClassExpression> Parser::parse_class_expression(bool expect_class_name)
  882. {
  883. auto rule_start = push_start();
  884. // Classes are always in strict mode.
  885. TemporaryChange strict_mode_rollback(m_state.strict_mode, true);
  886. consume(TokenType::Class);
  887. NonnullRefPtrVector<ClassElement> elements;
  888. RefPtr<Expression> super_class;
  889. RefPtr<FunctionExpression> constructor;
  890. HashTable<FlyString> found_private_names;
  891. FlyString class_name = expect_class_name || match_identifier() || match(TokenType::Yield) || match(TokenType::Await)
  892. ? consume_identifier_reference().flystring_value()
  893. : "";
  894. check_identifier_name_for_assignment_validity(class_name, true);
  895. if (m_state.in_class_static_init_block && class_name == "await"sv)
  896. syntax_error("Identifier must not be a reserved word in modules ('await')");
  897. if (match(TokenType::Extends)) {
  898. consume();
  899. auto [expression, should_continue_parsing] = parse_primary_expression();
  900. // Basically a (much) simplified parse_secondary_expression().
  901. for (;;) {
  902. if (match(TokenType::TemplateLiteralStart)) {
  903. auto template_literal = parse_template_literal(true);
  904. expression = create_ast_node<TaggedTemplateLiteral>({ m_source_code, rule_start.position(), position() }, move(expression), move(template_literal));
  905. continue;
  906. }
  907. if (match(TokenType::BracketOpen) || match(TokenType::Period) || match(TokenType::ParenOpen)) {
  908. auto precedence = g_operator_precedence.get(m_state.current_token.type());
  909. expression = parse_secondary_expression(move(expression), precedence).expression;
  910. continue;
  911. }
  912. break;
  913. }
  914. super_class = move(expression);
  915. (void)should_continue_parsing;
  916. }
  917. consume(TokenType::CurlyOpen);
  918. HashTable<StringView> referenced_private_names;
  919. HashTable<StringView>* outer_referenced_private_names = m_state.referenced_private_names;
  920. m_state.referenced_private_names = &referenced_private_names;
  921. ScopeGuard restore_private_name_table = [&] {
  922. m_state.referenced_private_names = outer_referenced_private_names;
  923. };
  924. while (!done() && !match(TokenType::CurlyClose)) {
  925. RefPtr<Expression> property_key;
  926. bool is_static = false;
  927. bool is_constructor = false;
  928. bool is_generator = false;
  929. bool is_async = false;
  930. auto method_kind = ClassMethod::Kind::Method;
  931. if (match(TokenType::Semicolon)) {
  932. consume();
  933. continue;
  934. }
  935. auto function_start = position();
  936. if (match(TokenType::Async)) {
  937. auto lookahead_token = next_token();
  938. // If async is followed by a Semicolon or CurlyClose it is a field (CurlyClose indicates end of class)
  939. // Otherwise if it is followed by a ParenOpen it is a function named async
  940. if (lookahead_token.type() != TokenType::Semicolon && lookahead_token.type() != TokenType::CurlyClose && lookahead_token.type() != TokenType::ParenOpen
  941. && !lookahead_token.trivia_contains_line_terminator()) {
  942. consume();
  943. is_async = true;
  944. }
  945. }
  946. if (match(TokenType::Asterisk)) {
  947. consume();
  948. is_generator = true;
  949. }
  950. StringView name;
  951. if (match_property_key() || match(TokenType::PrivateIdentifier)) {
  952. if (!is_generator && !is_async && m_state.current_token.original_value() == "static"sv) {
  953. if (match(TokenType::Identifier)) {
  954. consume();
  955. is_static = true;
  956. function_start = position();
  957. if (match(TokenType::Async)) {
  958. consume();
  959. is_async = true;
  960. }
  961. if (match(TokenType::Asterisk)) {
  962. consume();
  963. is_generator = true;
  964. }
  965. }
  966. }
  967. if (match(TokenType::Identifier)) {
  968. auto identifier_name = m_state.current_token.original_value();
  969. if (identifier_name == "get"sv) {
  970. method_kind = ClassMethod::Kind::Getter;
  971. consume();
  972. } else if (identifier_name == "set"sv) {
  973. method_kind = ClassMethod::Kind::Setter;
  974. consume();
  975. }
  976. }
  977. if (match_property_key() || match(TokenType::PrivateIdentifier)) {
  978. switch (m_state.current_token.type()) {
  979. case TokenType::Identifier:
  980. name = consume().value();
  981. property_key = create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, name);
  982. break;
  983. case TokenType::PrivateIdentifier:
  984. name = consume().value();
  985. if (name == "#constructor")
  986. syntax_error("Private property with name '#constructor' is not allowed");
  987. if (method_kind != ClassMethod::Kind::Method) {
  988. // It is a Syntax Error if PrivateBoundIdentifiers of ClassElementList contains any duplicate entries,
  989. // unless the name is used once for a getter and once for a setter and in no other entries,
  990. // and the getter and setter are either both static or both non-static.
  991. for (auto& element : elements) {
  992. auto private_name = element.private_bound_identifier();
  993. if (!private_name.has_value() || private_name.value() != name)
  994. continue;
  995. if (element.class_element_kind() != ClassElement::ElementKind::Method
  996. || element.is_static() != is_static) {
  997. syntax_error(String::formatted("Duplicate private field or method named '{}'", name));
  998. break;
  999. }
  1000. VERIFY(is<ClassMethod>(element));
  1001. auto& class_method_element = static_cast<ClassMethod const&>(element);
  1002. if (class_method_element.kind() == ClassMethod::Kind::Method || class_method_element.kind() == method_kind) {
  1003. syntax_error(String::formatted("Duplicate private field or method named '{}'", name));
  1004. break;
  1005. }
  1006. }
  1007. found_private_names.set(name);
  1008. } else if (found_private_names.set(name) != AK::HashSetResult::InsertedNewEntry) {
  1009. syntax_error(String::formatted("Duplicate private field or method named '{}'", name));
  1010. }
  1011. property_key = create_ast_node<PrivateIdentifier>({ m_source_code, rule_start.position(), position() }, name);
  1012. break;
  1013. case TokenType::StringLiteral: {
  1014. auto string_literal = parse_string_literal(consume());
  1015. name = string_literal->value();
  1016. property_key = move(string_literal);
  1017. break;
  1018. }
  1019. default:
  1020. property_key = parse_property_key();
  1021. break;
  1022. }
  1023. // https://tc39.es/ecma262/#sec-class-definitions-static-semantics-early-errors
  1024. // ClassElement : static MethodDefinition
  1025. // It is a Syntax Error if PropName of MethodDefinition is "prototype".
  1026. if (is_static && name == "prototype"sv)
  1027. syntax_error("Classes may not have a static property named 'prototype'");
  1028. } else if ((match(TokenType::ParenOpen) || match(TokenType::Equals) || match(TokenType::Semicolon) || match(TokenType::CurlyClose)) && (is_static || is_async || method_kind != ClassMethod::Kind::Method)) {
  1029. switch (method_kind) {
  1030. case ClassMethod::Kind::Method:
  1031. if (is_async) {
  1032. name = "async"sv;
  1033. is_async = false;
  1034. } else {
  1035. VERIFY(is_static);
  1036. name = "static"sv;
  1037. is_static = false;
  1038. }
  1039. break;
  1040. case ClassMethod::Kind::Getter:
  1041. name = "get"sv;
  1042. method_kind = ClassMethod::Kind::Method;
  1043. break;
  1044. case ClassMethod::Kind::Setter:
  1045. name = "set"sv;
  1046. method_kind = ClassMethod::Kind::Method;
  1047. break;
  1048. }
  1049. property_key = create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, name);
  1050. } else if (match(TokenType::CurlyOpen) && is_static) {
  1051. auto static_start = push_start();
  1052. consume(TokenType::CurlyOpen);
  1053. auto static_init_block = create_ast_node<FunctionBody>({ m_source_code, rule_start.position(), position() });
  1054. TemporaryChange break_context_rollback(m_state.in_break_context, false);
  1055. TemporaryChange continue_context_rollback(m_state.in_continue_context, false);
  1056. TemporaryChange function_context_rollback(m_state.in_function_context, false);
  1057. TemporaryChange generator_function_context_rollback(m_state.in_generator_function_context, false);
  1058. TemporaryChange async_function_context_rollback(m_state.await_expression_is_valid, false);
  1059. TemporaryChange class_field_initializer_rollback(m_state.in_class_field_initializer, true);
  1060. TemporaryChange class_static_init_block_rollback(m_state.in_class_static_init_block, true);
  1061. TemporaryChange super_property_access_rollback(m_state.allow_super_property_lookup, true);
  1062. ScopePusher static_init_scope = ScopePusher::static_init_block_scope(*this, *static_init_block);
  1063. parse_statement_list(static_init_block);
  1064. consume(TokenType::CurlyClose);
  1065. elements.append(create_ast_node<StaticInitializer>({ m_source_code, static_start.position(), position() }, move(static_init_block), static_init_scope.contains_direct_call_to_eval()));
  1066. continue;
  1067. } else {
  1068. expected("property key");
  1069. }
  1070. // Constructor may be a StringLiteral or an Identifier.
  1071. if (!is_static && name == "constructor"sv) {
  1072. if (method_kind != ClassMethod::Kind::Method)
  1073. syntax_error("Class constructor may not be an accessor");
  1074. if (!constructor.is_null())
  1075. syntax_error("Classes may not have more than one constructor");
  1076. if (is_generator)
  1077. syntax_error("Class constructor may not be a generator");
  1078. if (is_async)
  1079. syntax_error("Class constructor may not be async");
  1080. is_constructor = true;
  1081. }
  1082. }
  1083. if (match(TokenType::ParenOpen)) {
  1084. u8 parse_options = FunctionNodeParseOptions::AllowSuperPropertyLookup;
  1085. if (!super_class.is_null() && !is_static && is_constructor)
  1086. parse_options |= FunctionNodeParseOptions::AllowSuperConstructorCall;
  1087. if (method_kind == ClassMethod::Kind::Getter)
  1088. parse_options |= FunctionNodeParseOptions::IsGetterFunction;
  1089. if (method_kind == ClassMethod::Kind::Setter)
  1090. parse_options |= FunctionNodeParseOptions::IsSetterFunction;
  1091. if (is_generator)
  1092. parse_options |= FunctionNodeParseOptions::IsGeneratorFunction;
  1093. if (is_async)
  1094. parse_options |= FunctionNodeParseOptions::IsAsyncFunction;
  1095. auto function = parse_function_node<FunctionExpression>(parse_options, function_start);
  1096. if (is_constructor) {
  1097. constructor = move(function);
  1098. } else if (!property_key.is_null()) {
  1099. elements.append(create_ast_node<ClassMethod>({ m_source_code, rule_start.position(), position() }, property_key.release_nonnull(), move(function), method_kind, is_static));
  1100. } else {
  1101. syntax_error("No key for class method");
  1102. }
  1103. } else if (is_generator || is_async) {
  1104. expected("ParenOpen");
  1105. consume();
  1106. } else if (property_key.is_null()) {
  1107. expected("property key");
  1108. consume();
  1109. } else {
  1110. if (name == "constructor"sv)
  1111. syntax_error("Class cannot have field named 'constructor'");
  1112. RefPtr<Expression> initializer;
  1113. bool contains_direct_call_to_eval = false;
  1114. if (match(TokenType::Equals)) {
  1115. consume();
  1116. TemporaryChange super_property_access_rollback(m_state.allow_super_property_lookup, true);
  1117. TemporaryChange field_initializer_rollback(m_state.in_class_field_initializer, true);
  1118. auto class_field_scope = ScopePusher::class_field_scope(*this);
  1119. initializer = parse_expression(2);
  1120. contains_direct_call_to_eval = class_field_scope.contains_direct_call_to_eval();
  1121. }
  1122. elements.append(create_ast_node<ClassField>({ m_source_code, rule_start.position(), position() }, property_key.release_nonnull(), move(initializer), contains_direct_call_to_eval, is_static));
  1123. consume_or_insert_semicolon();
  1124. }
  1125. }
  1126. consume(TokenType::CurlyClose);
  1127. if (constructor.is_null()) {
  1128. auto constructor_body = create_ast_node<BlockStatement>({ m_source_code, rule_start.position(), position() });
  1129. if (!super_class.is_null()) {
  1130. // Set constructor to the result of parsing the source text
  1131. // constructor(... args){ super (...args);}
  1132. // However: The most notable distinction is that while the aforementioned ECMAScript
  1133. // source text observably calls the @@iterator method on %Array.prototype%,
  1134. // this function does not.
  1135. // So we use a custom version of SuperCall which doesn't use the @@iterator
  1136. // method on %Array.prototype% visibly.
  1137. FlyString argument_name = "args";
  1138. auto super_call = create_ast_node<SuperCall>(
  1139. { m_source_code, rule_start.position(), position() },
  1140. SuperCall::IsPartOfSyntheticConstructor::Yes,
  1141. CallExpression::Argument { create_ast_node<Identifier>({ m_source_code, rule_start.position(), position() }, "args"), true });
  1142. // NOTE: While the JS approximation above doesn't do `return super(...args)`, the
  1143. // abstract closure is expected to capture and return the result, so we do need a
  1144. // return statement here to create the correct completion.
  1145. constructor_body->append(create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, move(super_call)));
  1146. constructor = create_ast_node<FunctionExpression>(
  1147. { m_source_code, rule_start.position(), position() }, class_name, "",
  1148. move(constructor_body), Vector { FunctionParameter { move(argument_name), nullptr, true } }, 0, FunctionKind::Normal,
  1149. /* is_strict_mode */ true, /* might_need_arguments_object */ false, /* contains_direct_call_to_eval */ false);
  1150. } else {
  1151. constructor = create_ast_node<FunctionExpression>(
  1152. { m_source_code, rule_start.position(), position() }, class_name, "",
  1153. move(constructor_body), Vector<FunctionParameter> {}, 0, FunctionKind::Normal,
  1154. /* is_strict_mode */ true, /* might_need_arguments_object */ false, /* contains_direct_call_to_eval */ false);
  1155. }
  1156. }
  1157. // We could be in a subclass defined within the main class so must move all non declared private names to outer.
  1158. for (auto& private_name : referenced_private_names) {
  1159. if (found_private_names.contains(private_name))
  1160. continue;
  1161. if (outer_referenced_private_names)
  1162. outer_referenced_private_names->set(private_name);
  1163. else // FIXME: Make these error appear in the appropriate places.
  1164. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", private_name));
  1165. }
  1166. auto function_start_offset = rule_start.position().offset;
  1167. auto function_end_offset = position().offset - m_state.current_token.trivia().length();
  1168. auto source_text = String { m_state.lexer.source().substring_view(function_start_offset, function_end_offset - function_start_offset) };
  1169. return create_ast_node<ClassExpression>({ m_source_code, rule_start.position(), position() }, move(class_name), move(source_text), move(constructor), move(super_class), move(elements));
  1170. }
  1171. Parser::PrimaryExpressionParseResult Parser::parse_primary_expression()
  1172. {
  1173. auto rule_start = push_start();
  1174. if (match_unary_prefixed_expression())
  1175. return { parse_unary_prefixed_expression() };
  1176. auto try_arrow_function_parse_or_fail = [this](Position const& position, bool expect_paren, bool is_async = false) -> RefPtr<FunctionExpression> {
  1177. if (try_parse_arrow_function_expression_failed_at_position(position))
  1178. return nullptr;
  1179. auto arrow_function = try_parse_arrow_function_expression(expect_paren, is_async);
  1180. if (arrow_function)
  1181. return arrow_function;
  1182. set_try_parse_arrow_function_expression_failed_at_position(position, true);
  1183. return nullptr;
  1184. };
  1185. switch (m_state.current_token.type()) {
  1186. case TokenType::ParenOpen: {
  1187. auto paren_position = position();
  1188. consume(TokenType::ParenOpen);
  1189. if ((match(TokenType::ParenClose) || match_identifier() || match(TokenType::TripleDot) || match(TokenType::CurlyOpen) || match(TokenType::BracketOpen))) {
  1190. if (auto arrow_function_result = try_arrow_function_parse_or_fail(paren_position, true))
  1191. return { arrow_function_result.release_nonnull(), false };
  1192. }
  1193. auto expression = parse_expression(0);
  1194. consume(TokenType::ParenClose);
  1195. if (is<FunctionExpression>(*expression)) {
  1196. auto& function = static_cast<FunctionExpression&>(*expression);
  1197. if (function.kind() == FunctionKind::Generator && function.name() == "yield"sv)
  1198. syntax_error("function is not allowed to be called 'yield' in this context", function.source_range().start);
  1199. if (function.kind() == FunctionKind::Async && function.name() == "await"sv)
  1200. syntax_error("function is not allowed to be called 'await' in this context", function.source_range().start);
  1201. }
  1202. return { move(expression) };
  1203. }
  1204. case TokenType::This:
  1205. consume();
  1206. return { create_ast_node<ThisExpression>({ m_source_code, rule_start.position(), position() }) };
  1207. case TokenType::Class:
  1208. return { parse_class_expression(false) };
  1209. case TokenType::Super:
  1210. consume();
  1211. if (!m_state.allow_super_property_lookup)
  1212. syntax_error("'super' keyword unexpected here");
  1213. return { create_ast_node<SuperExpression>({ m_source_code, rule_start.position(), position() }) };
  1214. case TokenType::EscapedKeyword:
  1215. if (match_invalid_escaped_keyword())
  1216. syntax_error("Keyword must not contain escaped characters");
  1217. [[fallthrough]];
  1218. case TokenType::Identifier: {
  1219. read_as_identifier:;
  1220. if (auto arrow_function_result = try_arrow_function_parse_or_fail(position(), false))
  1221. return { arrow_function_result.release_nonnull(), false };
  1222. auto string = m_state.current_token.value();
  1223. // This could be 'eval' or 'arguments' and thus needs a custom check (`eval[1] = true`)
  1224. if (m_state.strict_mode && (string == "let" || is_strict_reserved_word(string)))
  1225. syntax_error(String::formatted("Identifier must not be a reserved word in strict mode ('{}')", string));
  1226. return { parse_identifier() };
  1227. }
  1228. case TokenType::NumericLiteral:
  1229. return { create_ast_node<NumericLiteral>({ m_source_code, rule_start.position(), position() }, consume_and_validate_numeric_literal().double_value()) };
  1230. case TokenType::BigIntLiteral:
  1231. return { create_ast_node<BigIntLiteral>({ m_source_code, rule_start.position(), position() }, consume().value()) };
  1232. case TokenType::BoolLiteral:
  1233. return { create_ast_node<BooleanLiteral>({ m_source_code, rule_start.position(), position() }, consume().bool_value()) };
  1234. case TokenType::StringLiteral:
  1235. return { parse_string_literal(consume()) };
  1236. case TokenType::NullLiteral:
  1237. consume();
  1238. return { create_ast_node<NullLiteral>({ m_source_code, rule_start.position(), position() }) };
  1239. case TokenType::CurlyOpen:
  1240. return { parse_object_expression() };
  1241. case TokenType::Async: {
  1242. auto lookahead_token = next_token();
  1243. // No valid async function (arrow or not) can have a line terminator after the async since asi would kick in.
  1244. if (lookahead_token.trivia_contains_line_terminator())
  1245. goto read_as_identifier;
  1246. if (lookahead_token.type() == TokenType::Function)
  1247. return { parse_function_node<FunctionExpression>() };
  1248. if (lookahead_token.type() == TokenType::ParenOpen) {
  1249. if (auto arrow_function_result = try_arrow_function_parse_or_fail(position(), true, true))
  1250. return { arrow_function_result.release_nonnull(), false };
  1251. } else if (lookahead_token.is_identifier_name()) {
  1252. if (auto arrow_function_result = try_arrow_function_parse_or_fail(position(), false, true))
  1253. return { arrow_function_result.release_nonnull(), false };
  1254. }
  1255. goto read_as_identifier;
  1256. }
  1257. case TokenType::Function:
  1258. return { parse_function_node<FunctionExpression>() };
  1259. case TokenType::BracketOpen:
  1260. return { parse_array_expression() };
  1261. case TokenType::RegexLiteral:
  1262. return { parse_regexp_literal() };
  1263. case TokenType::TemplateLiteralStart:
  1264. return { parse_template_literal(false) };
  1265. case TokenType::New: {
  1266. auto new_start = position();
  1267. auto new_target_result = try_parse_new_target_expression();
  1268. if (!new_target_result.is_null()) {
  1269. if (!m_state.in_function_context && !m_state.in_eval_function_context && !m_state.in_class_static_init_block)
  1270. syntax_error("'new.target' not allowed outside of a function", new_start);
  1271. return { new_target_result.release_nonnull() };
  1272. }
  1273. return { parse_new_expression() };
  1274. }
  1275. case TokenType::Import: {
  1276. auto lookahead_token = next_token();
  1277. if (lookahead_token.type() == TokenType::ParenOpen)
  1278. return { parse_import_call() };
  1279. if (lookahead_token.type() == TokenType::Period) {
  1280. if (auto import_meta = try_parse_import_meta_expression()) {
  1281. if (m_program_type != Program::Type::Module)
  1282. syntax_error("import.meta is only allowed in modules");
  1283. return { import_meta.release_nonnull() };
  1284. }
  1285. } else {
  1286. consume();
  1287. expected("import.meta or import call");
  1288. }
  1289. break;
  1290. }
  1291. case TokenType::Yield:
  1292. if (!m_state.in_generator_function_context)
  1293. goto read_as_identifier;
  1294. return { parse_yield_expression(), false };
  1295. case TokenType::Await:
  1296. if (!m_state.await_expression_is_valid)
  1297. goto read_as_identifier;
  1298. return { parse_await_expression() };
  1299. case TokenType::PrivateIdentifier:
  1300. if (!is_private_identifier_valid())
  1301. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  1302. if (next_token().type() != TokenType::In)
  1303. syntax_error("Cannot have a private identifier in expression if not followed by 'in'");
  1304. return { create_ast_node<PrivateIdentifier>({ m_source_code, rule_start.position(), position() }, consume().value()) };
  1305. default:
  1306. if (match_identifier_name())
  1307. goto read_as_identifier;
  1308. break;
  1309. }
  1310. expected("primary expression");
  1311. consume();
  1312. return { create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() }) };
  1313. }
  1314. NonnullRefPtr<RegExpLiteral> Parser::parse_regexp_literal()
  1315. {
  1316. auto rule_start = push_start();
  1317. auto pattern = consume().value();
  1318. // Remove leading and trailing slash.
  1319. pattern = pattern.substring_view(1, pattern.length() - 2);
  1320. auto flags = String::empty();
  1321. auto parsed_flags = RegExpObject::default_flags;
  1322. if (match(TokenType::RegexFlags)) {
  1323. auto flags_start = position();
  1324. flags = consume().value();
  1325. auto parsed_flags_or_error = regex_flags_from_string(flags);
  1326. if (parsed_flags_or_error.is_error())
  1327. syntax_error(parsed_flags_or_error.release_error(), flags_start);
  1328. else
  1329. parsed_flags = parsed_flags_or_error.release_value();
  1330. }
  1331. String parsed_pattern;
  1332. auto parsed_pattern_result = parse_regex_pattern(pattern, parsed_flags.has_flag_set(ECMAScriptFlags::Unicode), parsed_flags.has_flag_set(ECMAScriptFlags::UnicodeSets));
  1333. if (parsed_pattern_result.is_error()) {
  1334. syntax_error(parsed_pattern_result.release_error().error, rule_start.position());
  1335. parsed_pattern = String::empty();
  1336. } else {
  1337. parsed_pattern = parsed_pattern_result.release_value();
  1338. }
  1339. auto parsed_regex = Regex<ECMA262>::parse_pattern(parsed_pattern, parsed_flags);
  1340. if (parsed_regex.error != regex::Error::NoError)
  1341. syntax_error(String::formatted("RegExp compile error: {}", Regex<ECMA262>(parsed_regex, parsed_pattern, parsed_flags).error_string()), rule_start.position());
  1342. SourceRange range { m_source_code, rule_start.position(), position() };
  1343. return create_ast_node<RegExpLiteral>(move(range), move(parsed_regex), move(parsed_pattern), move(parsed_flags), pattern.to_string(), move(flags));
  1344. }
  1345. NonnullRefPtr<Expression> Parser::parse_unary_prefixed_expression()
  1346. {
  1347. auto rule_start = push_start();
  1348. auto precedence = g_operator_precedence.get(m_state.current_token.type());
  1349. auto associativity = operator_associativity(m_state.current_token.type());
  1350. switch (m_state.current_token.type()) {
  1351. case TokenType::PlusPlus: {
  1352. consume();
  1353. auto rhs_start = position();
  1354. auto rhs = parse_expression(precedence, associativity);
  1355. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1356. // other engines throw ReferenceError for ++foo()
  1357. if (!is<Identifier>(*rhs) && !is<MemberExpression>(*rhs))
  1358. syntax_error(String::formatted("Right-hand side of prefix increment operator must be identifier or member expression, got {}", rhs->class_name()), rhs_start);
  1359. if (m_state.strict_mode && is<Identifier>(*rhs)) {
  1360. auto& identifier = static_cast<Identifier&>(*rhs);
  1361. auto& name = identifier.string();
  1362. check_identifier_name_for_assignment_validity(name);
  1363. }
  1364. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Increment, move(rhs), true);
  1365. }
  1366. case TokenType::MinusMinus: {
  1367. consume();
  1368. auto rhs_start = position();
  1369. auto rhs = parse_expression(precedence, associativity);
  1370. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1371. // other engines throw ReferenceError for --foo()
  1372. if (!is<Identifier>(*rhs) && !is<MemberExpression>(*rhs))
  1373. syntax_error(String::formatted("Right-hand side of prefix decrement operator must be identifier or member expression, got {}", rhs->class_name()), rhs_start);
  1374. if (m_state.strict_mode && is<Identifier>(*rhs)) {
  1375. auto& identifier = static_cast<Identifier&>(*rhs);
  1376. auto& name = identifier.string();
  1377. check_identifier_name_for_assignment_validity(name);
  1378. }
  1379. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Decrement, move(rhs), true);
  1380. }
  1381. case TokenType::ExclamationMark:
  1382. consume();
  1383. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Not, parse_expression(precedence, associativity));
  1384. case TokenType::Tilde:
  1385. consume();
  1386. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::BitwiseNot, parse_expression(precedence, associativity));
  1387. case TokenType::Plus:
  1388. consume();
  1389. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Plus, parse_expression(precedence, associativity));
  1390. case TokenType::Minus:
  1391. consume();
  1392. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Minus, parse_expression(precedence, associativity));
  1393. case TokenType::Typeof:
  1394. consume();
  1395. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Typeof, parse_expression(precedence, associativity));
  1396. case TokenType::Void:
  1397. consume();
  1398. // FIXME: This check is really hiding the fact that we don't deal with different expressions correctly.
  1399. if (match(TokenType::Yield) && m_state.in_generator_function_context)
  1400. syntax_error("'yield' is not an identifier in generator function context");
  1401. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Void, parse_expression(precedence, associativity));
  1402. case TokenType::Delete: {
  1403. consume();
  1404. auto rhs_start = position();
  1405. auto rhs = parse_expression(precedence, associativity);
  1406. if (is<Identifier>(*rhs) && m_state.strict_mode) {
  1407. syntax_error("Delete of an unqualified identifier in strict mode.", rhs_start);
  1408. }
  1409. if (is<MemberExpression>(*rhs)) {
  1410. auto& member_expression = static_cast<MemberExpression const&>(*rhs);
  1411. if (member_expression.ends_in_private_name())
  1412. syntax_error("Private fields cannot be deleted");
  1413. }
  1414. return create_ast_node<UnaryExpression>({ m_source_code, rule_start.position(), position() }, UnaryOp::Delete, move(rhs));
  1415. }
  1416. default:
  1417. expected("primary expression");
  1418. consume();
  1419. return create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() });
  1420. }
  1421. }
  1422. NonnullRefPtr<Expression> Parser::parse_property_key()
  1423. {
  1424. auto rule_start = push_start();
  1425. if (match(TokenType::StringLiteral)) {
  1426. return parse_string_literal(consume());
  1427. } else if (match(TokenType::NumericLiteral)) {
  1428. return create_ast_node<NumericLiteral>({ m_source_code, rule_start.position(), position() }, consume().double_value());
  1429. } else if (match(TokenType::BigIntLiteral)) {
  1430. return create_ast_node<BigIntLiteral>({ m_source_code, rule_start.position(), position() }, consume().value());
  1431. } else if (match(TokenType::BracketOpen)) {
  1432. consume(TokenType::BracketOpen);
  1433. auto result = parse_expression(2);
  1434. consume(TokenType::BracketClose);
  1435. return result;
  1436. } else {
  1437. if (!match_identifier_name())
  1438. expected("IdentifierName");
  1439. return create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, consume().value());
  1440. }
  1441. }
  1442. NonnullRefPtr<ObjectExpression> Parser::parse_object_expression()
  1443. {
  1444. auto rule_start = push_start();
  1445. consume(TokenType::CurlyOpen);
  1446. NonnullRefPtrVector<ObjectProperty> properties;
  1447. ObjectProperty::Type property_type;
  1448. Optional<SourceRange> invalid_object_literal_property_range;
  1449. auto skip_to_next_property = [&] {
  1450. while (!done() && !match(TokenType::Comma) && !match(TokenType::CurlyOpen))
  1451. consume();
  1452. };
  1453. // It is a Syntax Error if PropertyNameList of PropertyDefinitionList contains any duplicate
  1454. // entries for "__proto__" and at least two of those entries were obtained from productions of
  1455. // the form PropertyDefinition : PropertyKey : AssignmentExpression .
  1456. bool has_direct_proto_property = false;
  1457. while (!done() && !match(TokenType::CurlyClose)) {
  1458. property_type = ObjectProperty::Type::KeyValue;
  1459. RefPtr<Expression> property_key;
  1460. RefPtr<Expression> property_value;
  1461. FunctionKind function_kind { FunctionKind::Normal };
  1462. if (match(TokenType::TripleDot)) {
  1463. consume();
  1464. property_key = parse_expression(4);
  1465. properties.append(create_ast_node<ObjectProperty>({ m_source_code, rule_start.position(), position() }, *property_key, nullptr, ObjectProperty::Type::Spread, false));
  1466. if (!match(TokenType::Comma))
  1467. break;
  1468. consume(TokenType::Comma);
  1469. continue;
  1470. }
  1471. auto type = m_state.current_token.type();
  1472. auto function_start = position();
  1473. if (match(TokenType::Async)) {
  1474. auto lookahead_token = next_token();
  1475. if (lookahead_token.type() != TokenType::ParenOpen && lookahead_token.type() != TokenType::Colon
  1476. && lookahead_token.type() != TokenType::Comma && lookahead_token.type() != TokenType::CurlyClose
  1477. && lookahead_token.type() != TokenType::Async
  1478. && !lookahead_token.trivia_contains_line_terminator()) {
  1479. consume(TokenType::Async);
  1480. function_kind = FunctionKind::Async;
  1481. }
  1482. }
  1483. if (match(TokenType::Asterisk)) {
  1484. consume();
  1485. property_type = ObjectProperty::Type::KeyValue;
  1486. property_key = parse_property_key();
  1487. VERIFY(function_kind == FunctionKind::Normal || function_kind == FunctionKind::Async);
  1488. function_kind = function_kind == FunctionKind::Normal ? FunctionKind::Generator : FunctionKind::AsyncGenerator;
  1489. } else if (match_identifier()) {
  1490. auto identifier = consume();
  1491. if (identifier.original_value() == "get"sv && match_property_key()) {
  1492. property_type = ObjectProperty::Type::Getter;
  1493. property_key = parse_property_key();
  1494. } else if (identifier.original_value() == "set"sv && match_property_key()) {
  1495. property_type = ObjectProperty::Type::Setter;
  1496. property_key = parse_property_key();
  1497. } else {
  1498. property_key = create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, identifier.value());
  1499. property_value = create_ast_node<Identifier>({ m_source_code, rule_start.position(), position() }, identifier.flystring_value());
  1500. }
  1501. } else {
  1502. property_key = parse_property_key();
  1503. }
  1504. // 4. Else if propKey is the String value "__proto__" and if IsComputedPropertyKey of PropertyName is false, then
  1505. // a. Let isProtoSetter be true.
  1506. bool is_proto = (type == TokenType::StringLiteral || type == TokenType::Identifier) && is<StringLiteral>(*property_key) && static_cast<StringLiteral const&>(*property_key).value() == "__proto__";
  1507. if (property_type == ObjectProperty::Type::Getter || property_type == ObjectProperty::Type::Setter) {
  1508. if (!match(TokenType::ParenOpen)) {
  1509. expected("'(' for object getter or setter property");
  1510. skip_to_next_property();
  1511. continue;
  1512. }
  1513. }
  1514. if (match(TokenType::Equals)) {
  1515. // Not a valid object literal, but a valid assignment target
  1516. consume();
  1517. // Parse the expression and throw it away
  1518. auto expression = parse_expression(2);
  1519. if (!invalid_object_literal_property_range.has_value())
  1520. invalid_object_literal_property_range = expression->source_range();
  1521. } else if (match(TokenType::ParenOpen)) {
  1522. VERIFY(property_key);
  1523. u8 parse_options = FunctionNodeParseOptions::AllowSuperPropertyLookup;
  1524. if (property_type == ObjectProperty::Type::Getter)
  1525. parse_options |= FunctionNodeParseOptions::IsGetterFunction;
  1526. if (property_type == ObjectProperty::Type::Setter)
  1527. parse_options |= FunctionNodeParseOptions::IsSetterFunction;
  1528. if (function_kind == FunctionKind::Generator || function_kind == FunctionKind::AsyncGenerator)
  1529. parse_options |= FunctionNodeParseOptions::IsGeneratorFunction;
  1530. if (function_kind == FunctionKind::Async || function_kind == FunctionKind::AsyncGenerator)
  1531. parse_options |= FunctionNodeParseOptions::IsAsyncFunction;
  1532. auto function = parse_function_node<FunctionExpression>(parse_options, function_start);
  1533. properties.append(create_ast_node<ObjectProperty>({ m_source_code, rule_start.position(), position() }, *property_key, function, property_type, true));
  1534. } else if (match(TokenType::Colon)) {
  1535. if (!property_key) {
  1536. expected("a property name");
  1537. skip_to_next_property();
  1538. continue;
  1539. }
  1540. consume();
  1541. if (is_proto) {
  1542. if (has_direct_proto_property)
  1543. syntax_error("Property name '__proto__' must not appear more than once in object literal");
  1544. has_direct_proto_property = true;
  1545. }
  1546. if (is_proto && property_type == ObjectProperty::Type::KeyValue)
  1547. property_type = ObjectProperty::Type::ProtoSetter;
  1548. properties.append(create_ast_node<ObjectProperty>({ m_source_code, rule_start.position(), position() }, *property_key, parse_expression(2), property_type, false));
  1549. } else if (property_key && property_value) {
  1550. if (m_state.strict_mode && is<StringLiteral>(*property_key)) {
  1551. auto& string_literal = static_cast<StringLiteral const&>(*property_key);
  1552. if (is_strict_reserved_word(string_literal.value()))
  1553. syntax_error(String::formatted("'{}' is a reserved keyword", string_literal.value()));
  1554. }
  1555. properties.append(create_ast_node<ObjectProperty>({ m_source_code, rule_start.position(), position() }, *property_key, *property_value, property_type, false));
  1556. } else {
  1557. expected("a property");
  1558. skip_to_next_property();
  1559. continue;
  1560. }
  1561. if (!match(TokenType::Comma))
  1562. break;
  1563. consume(TokenType::Comma);
  1564. }
  1565. consume(TokenType::CurlyClose);
  1566. if (invalid_object_literal_property_range.has_value()) {
  1567. size_t object_expression_offset = rule_start.position().offset;
  1568. VERIFY(!m_state.invalid_property_range_in_object_expression.contains(object_expression_offset));
  1569. m_state.invalid_property_range_in_object_expression.set(object_expression_offset, invalid_object_literal_property_range->start);
  1570. }
  1571. return create_ast_node<ObjectExpression>(
  1572. { m_source_code, rule_start.position(), position() },
  1573. move(properties));
  1574. }
  1575. NonnullRefPtr<ArrayExpression> Parser::parse_array_expression()
  1576. {
  1577. auto rule_start = push_start();
  1578. consume(TokenType::BracketOpen);
  1579. Vector<RefPtr<Expression>> elements;
  1580. while (match_expression() || match(TokenType::TripleDot) || match(TokenType::Comma)) {
  1581. RefPtr<Expression> expression;
  1582. if (match(TokenType::TripleDot)) {
  1583. consume(TokenType::TripleDot);
  1584. expression = create_ast_node<SpreadExpression>({ m_source_code, rule_start.position(), position() }, parse_expression(2));
  1585. } else if (match_expression()) {
  1586. expression = parse_expression(2);
  1587. }
  1588. elements.append(expression);
  1589. if (!match(TokenType::Comma))
  1590. break;
  1591. consume(TokenType::Comma);
  1592. }
  1593. consume(TokenType::BracketClose);
  1594. return create_ast_node<ArrayExpression>({ m_source_code, rule_start.position(), position() }, move(elements));
  1595. }
  1596. NonnullRefPtr<StringLiteral> Parser::parse_string_literal(Token const& token, StringLiteralType string_literal_type, bool* contains_invalid_escape)
  1597. {
  1598. auto rule_start = push_start();
  1599. auto status = Token::StringValueStatus::Ok;
  1600. auto string = token.string_value(status);
  1601. // NOTE: Tagged templates should not fail on invalid strings as their raw contents can still be accessed.
  1602. if (status != Token::StringValueStatus::Ok) {
  1603. String message;
  1604. if (status == Token::StringValueStatus::LegacyOctalEscapeSequence) {
  1605. m_state.string_legacy_octal_escape_sequence_in_scope = true;
  1606. // It is a Syntax Error if the [Tagged] parameter was not set and Template{Head, Middle, Tail} Contains NotEscapeSequence.
  1607. if (string_literal_type != StringLiteralType::Normal)
  1608. message = "Octal escape sequence not allowed in template literal";
  1609. else if (m_state.strict_mode)
  1610. message = "Octal escape sequence in string literal not allowed in strict mode";
  1611. } else if (status == Token::StringValueStatus::MalformedHexEscape || status == Token::StringValueStatus::MalformedUnicodeEscape) {
  1612. auto type = status == Token::StringValueStatus::MalformedUnicodeEscape ? "unicode" : "hexadecimal";
  1613. message = String::formatted("Malformed {} escape sequence", type);
  1614. } else if (status == Token::StringValueStatus::UnicodeEscapeOverflow) {
  1615. message = "Unicode code_point must not be greater than 0x10ffff in escape sequence";
  1616. } else {
  1617. VERIFY_NOT_REACHED();
  1618. }
  1619. if (!message.is_empty()) {
  1620. if (contains_invalid_escape != nullptr) {
  1621. VERIFY(string_literal_type == StringLiteralType::TaggedTemplate);
  1622. *contains_invalid_escape = true;
  1623. } else {
  1624. syntax_error(message, Position { token.line_number(), token.line_column() });
  1625. }
  1626. }
  1627. }
  1628. return create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, string);
  1629. }
  1630. NonnullRefPtr<TemplateLiteral> Parser::parse_template_literal(bool is_tagged)
  1631. {
  1632. auto rule_start = push_start();
  1633. consume(TokenType::TemplateLiteralStart);
  1634. NonnullRefPtrVector<Expression> expressions;
  1635. NonnullRefPtrVector<Expression> raw_strings;
  1636. auto append_empty_string = [this, &rule_start, &expressions, &raw_strings, is_tagged]() {
  1637. auto string_literal = create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, "");
  1638. expressions.append(string_literal);
  1639. if (is_tagged)
  1640. raw_strings.append(string_literal);
  1641. };
  1642. if (!match(TokenType::TemplateLiteralString))
  1643. append_empty_string();
  1644. while (!done() && !match(TokenType::TemplateLiteralEnd) && !match(TokenType::UnterminatedTemplateLiteral)) {
  1645. if (match(TokenType::TemplateLiteralString)) {
  1646. auto token = consume();
  1647. bool contains_invalid_escape = false;
  1648. auto parsed_string_value = parse_string_literal(token,
  1649. is_tagged ? StringLiteralType::TaggedTemplate : StringLiteralType::NonTaggedTemplate,
  1650. is_tagged ? &contains_invalid_escape : nullptr);
  1651. // An invalid string leads to a cooked value of `undefined` but still gives the raw string.
  1652. if (contains_invalid_escape)
  1653. expressions.append(create_ast_node<NullLiteral>({ m_source_code, rule_start.position(), position() }));
  1654. else
  1655. expressions.append(move(parsed_string_value));
  1656. if (is_tagged)
  1657. raw_strings.append(create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, token.raw_template_value()));
  1658. } else if (match(TokenType::TemplateLiteralExprStart)) {
  1659. consume(TokenType::TemplateLiteralExprStart);
  1660. if (match(TokenType::TemplateLiteralExprEnd)) {
  1661. syntax_error("Empty template literal expression block");
  1662. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1663. }
  1664. expressions.append(parse_expression(0));
  1665. if (match(TokenType::UnterminatedTemplateLiteral)) {
  1666. syntax_error("Unterminated template literal");
  1667. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1668. }
  1669. consume(TokenType::TemplateLiteralExprEnd);
  1670. if (!match(TokenType::TemplateLiteralString))
  1671. append_empty_string();
  1672. } else {
  1673. expected("Template literal string or expression");
  1674. break;
  1675. }
  1676. }
  1677. if (match(TokenType::UnterminatedTemplateLiteral)) {
  1678. syntax_error("Unterminated template literal");
  1679. } else {
  1680. consume(TokenType::TemplateLiteralEnd);
  1681. }
  1682. if (is_tagged)
  1683. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions, raw_strings);
  1684. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1685. }
  1686. NonnullRefPtr<Expression> Parser::parse_expression(int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1687. {
  1688. auto rule_start = push_start();
  1689. auto [expression, should_continue_parsing] = parse_primary_expression();
  1690. auto check_for_invalid_object_property = [&](auto& expression) {
  1691. if (is<ObjectExpression>(*expression)) {
  1692. if (auto start_offset = m_state.invalid_property_range_in_object_expression.get(expression->start_offset()); start_offset.has_value())
  1693. syntax_error("Invalid property in object literal", start_offset.value());
  1694. }
  1695. };
  1696. if (is<Identifier>(*expression) && m_state.current_scope_pusher) {
  1697. auto identifier_instance = static_ptr_cast<Identifier>(expression);
  1698. auto function_scope = m_state.current_scope_pusher->last_function_scope();
  1699. auto function_parent_scope = function_scope ? function_scope->parent_scope() : nullptr;
  1700. bool has_not_been_declared_as_variable = true;
  1701. for (auto scope = m_state.current_scope_pusher; scope != function_parent_scope; scope = scope->parent_scope()) {
  1702. if (scope->has_declaration(identifier_instance->string())) {
  1703. has_not_been_declared_as_variable = false;
  1704. break;
  1705. }
  1706. }
  1707. if (has_not_been_declared_as_variable) {
  1708. if (identifier_instance->string() == "arguments"sv)
  1709. m_state.current_scope_pusher->set_contains_access_to_arguments_object();
  1710. }
  1711. }
  1712. while (match(TokenType::TemplateLiteralStart)) {
  1713. auto template_literal = parse_template_literal(true);
  1714. expression = create_ast_node<TaggedTemplateLiteral>({ m_source_code, rule_start.position(), position() }, move(expression), move(template_literal));
  1715. }
  1716. if (should_continue_parsing) {
  1717. while (match_secondary_expression(forbidden)) {
  1718. int new_precedence = g_operator_precedence.get(m_state.current_token.type());
  1719. if (new_precedence < min_precedence)
  1720. break;
  1721. if (new_precedence == min_precedence && associativity == Associativity::Left)
  1722. break;
  1723. check_for_invalid_object_property(expression);
  1724. Associativity new_associativity = operator_associativity(m_state.current_token.type());
  1725. auto result = parse_secondary_expression(move(expression), new_precedence, new_associativity, forbidden);
  1726. expression = result.expression;
  1727. forbidden = forbidden.merge(result.forbidden);
  1728. while (match(TokenType::TemplateLiteralStart) && !is<UpdateExpression>(*expression)) {
  1729. auto template_literal = parse_template_literal(true);
  1730. expression = create_ast_node<TaggedTemplateLiteral>({ m_source_code, rule_start.position(), position() }, move(expression), move(template_literal));
  1731. }
  1732. }
  1733. }
  1734. if (is<SuperExpression>(*expression))
  1735. syntax_error("'super' keyword unexpected here");
  1736. check_for_invalid_object_property(expression);
  1737. if (is<CallExpression>(*expression) && m_state.current_scope_pusher) {
  1738. auto& callee = static_ptr_cast<CallExpression>(expression)->callee();
  1739. if (is<Identifier>(callee)) {
  1740. auto& identifier_instance = static_cast<Identifier const&>(callee);
  1741. if (identifier_instance.string() == "eval"sv) {
  1742. bool has_not_been_declared_as_variable = true;
  1743. for (auto scope = m_state.current_scope_pusher; scope; scope = scope->parent_scope()) {
  1744. if (scope->has_declaration(identifier_instance.string())) {
  1745. has_not_been_declared_as_variable = false;
  1746. break;
  1747. }
  1748. }
  1749. if (has_not_been_declared_as_variable)
  1750. m_state.current_scope_pusher->set_contains_direct_call_to_eval();
  1751. }
  1752. }
  1753. }
  1754. if (match(TokenType::Comma) && min_precedence <= 1) {
  1755. NonnullRefPtrVector<Expression> expressions;
  1756. expressions.append(expression);
  1757. while (match(TokenType::Comma)) {
  1758. consume();
  1759. expressions.append(parse_expression(2));
  1760. }
  1761. expression = create_ast_node<SequenceExpression>({ m_source_code, rule_start.position(), position() }, move(expressions));
  1762. }
  1763. return expression;
  1764. }
  1765. Parser::ExpressionResult Parser::parse_secondary_expression(NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1766. {
  1767. auto rule_start = push_start();
  1768. switch (m_state.current_token.type()) {
  1769. case TokenType::Plus:
  1770. consume();
  1771. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Addition, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1772. case TokenType::PlusEquals:
  1773. return parse_assignment_expression(AssignmentOp::AdditionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1774. case TokenType::Minus:
  1775. consume();
  1776. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Subtraction, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1777. case TokenType::MinusEquals:
  1778. return parse_assignment_expression(AssignmentOp::SubtractionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1779. case TokenType::Asterisk:
  1780. consume();
  1781. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Multiplication, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1782. case TokenType::AsteriskEquals:
  1783. return parse_assignment_expression(AssignmentOp::MultiplicationAssignment, move(lhs), min_precedence, associativity, forbidden);
  1784. case TokenType::Slash:
  1785. consume();
  1786. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Division, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1787. case TokenType::SlashEquals:
  1788. return parse_assignment_expression(AssignmentOp::DivisionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1789. case TokenType::Percent:
  1790. consume();
  1791. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Modulo, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1792. case TokenType::PercentEquals:
  1793. return parse_assignment_expression(AssignmentOp::ModuloAssignment, move(lhs), min_precedence, associativity, forbidden);
  1794. case TokenType::DoubleAsterisk:
  1795. consume();
  1796. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Exponentiation, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1797. case TokenType::DoubleAsteriskEquals:
  1798. return parse_assignment_expression(AssignmentOp::ExponentiationAssignment, move(lhs), min_precedence, associativity, forbidden);
  1799. case TokenType::GreaterThan:
  1800. consume();
  1801. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::GreaterThan, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1802. case TokenType::GreaterThanEquals:
  1803. consume();
  1804. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::GreaterThanEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1805. case TokenType::LessThan:
  1806. consume();
  1807. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LessThan, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1808. case TokenType::LessThanEquals:
  1809. consume();
  1810. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LessThanEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1811. case TokenType::EqualsEqualsEquals:
  1812. consume();
  1813. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::StrictlyEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1814. case TokenType::ExclamationMarkEqualsEquals:
  1815. consume();
  1816. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::StrictlyInequals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1817. case TokenType::EqualsEquals:
  1818. consume();
  1819. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LooselyEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1820. case TokenType::ExclamationMarkEquals:
  1821. consume();
  1822. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LooselyInequals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1823. case TokenType::In:
  1824. consume();
  1825. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::In, move(lhs), parse_expression(min_precedence, associativity));
  1826. case TokenType::Instanceof:
  1827. consume();
  1828. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::InstanceOf, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1829. case TokenType::Ampersand:
  1830. consume();
  1831. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseAnd, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1832. case TokenType::AmpersandEquals:
  1833. return parse_assignment_expression(AssignmentOp::BitwiseAndAssignment, move(lhs), min_precedence, associativity, forbidden);
  1834. case TokenType::Pipe:
  1835. consume();
  1836. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseOr, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1837. case TokenType::PipeEquals:
  1838. return parse_assignment_expression(AssignmentOp::BitwiseOrAssignment, move(lhs), min_precedence, associativity, forbidden);
  1839. case TokenType::Caret:
  1840. consume();
  1841. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseXor, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1842. case TokenType::CaretEquals:
  1843. return parse_assignment_expression(AssignmentOp::BitwiseXorAssignment, move(lhs), min_precedence, associativity, forbidden);
  1844. case TokenType::ShiftLeft:
  1845. consume();
  1846. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LeftShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1847. case TokenType::ShiftLeftEquals:
  1848. return parse_assignment_expression(AssignmentOp::LeftShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1849. case TokenType::ShiftRight:
  1850. consume();
  1851. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::RightShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1852. case TokenType::ShiftRightEquals:
  1853. return parse_assignment_expression(AssignmentOp::RightShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1854. case TokenType::UnsignedShiftRight:
  1855. consume();
  1856. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::UnsignedRightShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1857. case TokenType::UnsignedShiftRightEquals:
  1858. return parse_assignment_expression(AssignmentOp::UnsignedRightShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1859. case TokenType::ParenOpen:
  1860. return parse_call_expression(move(lhs));
  1861. case TokenType::Equals:
  1862. return parse_assignment_expression(AssignmentOp::Assignment, move(lhs), min_precedence, associativity, forbidden);
  1863. case TokenType::Period:
  1864. consume();
  1865. if (match(TokenType::PrivateIdentifier)) {
  1866. if (!is_private_identifier_valid())
  1867. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  1868. else if (is<SuperExpression>(*lhs))
  1869. syntax_error(String::formatted("Cannot access private field or method '{}' on super", m_state.current_token.value()));
  1870. return create_ast_node<MemberExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), create_ast_node<PrivateIdentifier>({ m_source_code, rule_start.position(), position() }, consume().value()));
  1871. } else if (!match_identifier_name()) {
  1872. expected("IdentifierName");
  1873. }
  1874. return create_ast_node<MemberExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), create_ast_node<Identifier>({ m_source_code, rule_start.position(), position() }, consume().flystring_value()));
  1875. case TokenType::BracketOpen: {
  1876. consume(TokenType::BracketOpen);
  1877. auto expression = create_ast_node<MemberExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), parse_expression(0), true);
  1878. consume(TokenType::BracketClose);
  1879. return expression;
  1880. }
  1881. case TokenType::PlusPlus:
  1882. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1883. // other engines throw ReferenceError for foo()++
  1884. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs))
  1885. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  1886. if (m_state.strict_mode && is<Identifier>(*lhs)) {
  1887. auto& identifier = static_cast<Identifier&>(*lhs);
  1888. auto& name = identifier.string();
  1889. check_identifier_name_for_assignment_validity(name);
  1890. }
  1891. consume();
  1892. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Increment, move(lhs));
  1893. case TokenType::MinusMinus:
  1894. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1895. // other engines throw ReferenceError for foo()--
  1896. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs))
  1897. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  1898. if (m_state.strict_mode && is<Identifier>(*lhs)) {
  1899. auto& identifier = static_cast<Identifier&>(*lhs);
  1900. auto& name = identifier.string();
  1901. check_identifier_name_for_assignment_validity(name);
  1902. }
  1903. consume();
  1904. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Decrement, move(lhs));
  1905. case TokenType::DoubleAmpersand: {
  1906. consume();
  1907. auto expression = create_ast_node<LogicalExpression>({ m_source_code, rule_start.position(), position() }, LogicalOp::And, move(lhs), parse_expression(min_precedence, associativity, forbidden.forbid({ TokenType::DoubleQuestionMark })));
  1908. return { expression, { TokenType::DoubleQuestionMark } };
  1909. }
  1910. case TokenType::DoubleAmpersandEquals:
  1911. return parse_assignment_expression(AssignmentOp::AndAssignment, move(lhs), min_precedence, associativity, forbidden);
  1912. case TokenType::DoublePipe: {
  1913. consume();
  1914. auto expression = create_ast_node<LogicalExpression>({ m_source_code, rule_start.position(), position() }, LogicalOp::Or, move(lhs), parse_expression(min_precedence, associativity, forbidden.forbid({ TokenType::DoubleQuestionMark })));
  1915. return { expression, { TokenType::DoubleQuestionMark } };
  1916. }
  1917. case TokenType::DoublePipeEquals:
  1918. return parse_assignment_expression(AssignmentOp::OrAssignment, move(lhs), min_precedence, associativity, forbidden);
  1919. case TokenType::DoubleQuestionMark: {
  1920. consume();
  1921. auto expression = create_ast_node<LogicalExpression>({ m_source_code, rule_start.position(), position() }, LogicalOp::NullishCoalescing, move(lhs), parse_expression(min_precedence, associativity, forbidden.forbid({ TokenType::DoubleAmpersand, TokenType::DoublePipe })));
  1922. return { expression, { TokenType::DoubleAmpersand, TokenType::DoublePipe } };
  1923. }
  1924. case TokenType::DoubleQuestionMarkEquals:
  1925. return parse_assignment_expression(AssignmentOp::NullishAssignment, move(lhs), min_precedence, associativity, forbidden);
  1926. case TokenType::QuestionMark:
  1927. return parse_conditional_expression(move(lhs), forbidden);
  1928. case TokenType::QuestionMarkPeriod:
  1929. // FIXME: This should allow `(new Foo)?.bar', but as our parser strips parenthesis,
  1930. // we can't really tell if `lhs' was parenthesized at this point.
  1931. if (is<NewExpression>(lhs.ptr())) {
  1932. syntax_error("'new' cannot be used with optional chaining", position());
  1933. consume();
  1934. return lhs;
  1935. }
  1936. return parse_optional_chain(move(lhs));
  1937. default:
  1938. expected("secondary expression");
  1939. consume();
  1940. return create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() });
  1941. }
  1942. }
  1943. bool Parser::is_private_identifier_valid() const
  1944. {
  1945. VERIFY(match(TokenType::PrivateIdentifier));
  1946. if (!m_state.referenced_private_names)
  1947. return false;
  1948. // We might not have hit the declaration yet so class will check this in the end
  1949. m_state.referenced_private_names->set(m_state.current_token.value());
  1950. return true;
  1951. }
  1952. RefPtr<BindingPattern> Parser::synthesize_binding_pattern(Expression const& expression)
  1953. {
  1954. VERIFY(is<ArrayExpression>(expression) || is<ObjectExpression>(expression));
  1955. // Clear any syntax error that has occurred in the range that 'expression' spans.
  1956. m_state.errors.remove_all_matching([range = expression.source_range()](auto const& error) {
  1957. return error.position.has_value() && range.contains(*error.position);
  1958. });
  1959. // Make a parser and parse the source for this expression as a binding pattern.
  1960. // NOTE: There's currently a fundamental problem that we pass the *next* (a.k.a. `current_token`)
  1961. // token's position to most nodes' SourceRange when using `rule_start.position(), position()`.
  1962. // This means that `source` will contain the subsequent token's trivia, if any (which is fine).
  1963. auto source_start_offset = expression.source_range().start.offset;
  1964. auto source_end_offset = expression.source_range().end.offset;
  1965. auto source = m_state.lexer.source().substring_view(source_start_offset, source_end_offset - source_start_offset);
  1966. Lexer lexer { source, m_state.lexer.filename(), expression.source_range().start.line, expression.source_range().start.column };
  1967. Parser parser { lexer };
  1968. parser.m_state.strict_mode = m_state.strict_mode;
  1969. parser.m_state.allow_super_property_lookup = m_state.allow_super_property_lookup;
  1970. parser.m_state.allow_super_constructor_call = m_state.allow_super_constructor_call;
  1971. parser.m_state.in_function_context = m_state.in_function_context;
  1972. parser.m_state.in_formal_parameter_context = m_state.in_formal_parameter_context;
  1973. parser.m_state.in_generator_function_context = m_state.in_generator_function_context;
  1974. parser.m_state.await_expression_is_valid = m_state.await_expression_is_valid;
  1975. parser.m_state.in_arrow_function_context = m_state.in_arrow_function_context;
  1976. parser.m_state.in_break_context = m_state.in_break_context;
  1977. parser.m_state.in_continue_context = m_state.in_continue_context;
  1978. parser.m_state.string_legacy_octal_escape_sequence_in_scope = m_state.string_legacy_octal_escape_sequence_in_scope;
  1979. parser.m_state.in_class_field_initializer = m_state.in_class_field_initializer;
  1980. parser.m_state.in_class_static_init_block = m_state.in_class_static_init_block;
  1981. parser.m_state.referenced_private_names = m_state.referenced_private_names;
  1982. auto result = parser.parse_binding_pattern(AllowDuplicates::Yes, AllowMemberExpressions::Yes);
  1983. if (parser.has_errors())
  1984. m_state.errors.extend(parser.errors());
  1985. return result;
  1986. }
  1987. NonnullRefPtr<AssignmentExpression> Parser::parse_assignment_expression(AssignmentOp assignment_op, NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1988. {
  1989. auto rule_start = push_start();
  1990. VERIFY(match(TokenType::Equals)
  1991. || match(TokenType::PlusEquals)
  1992. || match(TokenType::MinusEquals)
  1993. || match(TokenType::AsteriskEquals)
  1994. || match(TokenType::SlashEquals)
  1995. || match(TokenType::PercentEquals)
  1996. || match(TokenType::DoubleAsteriskEquals)
  1997. || match(TokenType::AmpersandEquals)
  1998. || match(TokenType::PipeEquals)
  1999. || match(TokenType::CaretEquals)
  2000. || match(TokenType::ShiftLeftEquals)
  2001. || match(TokenType::ShiftRightEquals)
  2002. || match(TokenType::UnsignedShiftRightEquals)
  2003. || match(TokenType::DoubleAmpersandEquals)
  2004. || match(TokenType::DoublePipeEquals)
  2005. || match(TokenType::DoubleQuestionMarkEquals));
  2006. consume();
  2007. if (assignment_op == AssignmentOp::Assignment) {
  2008. if (is<ArrayExpression>(*lhs) || is<ObjectExpression>(*lhs)) {
  2009. auto binding_pattern = synthesize_binding_pattern(*lhs);
  2010. if (binding_pattern) {
  2011. auto rhs = parse_expression(min_precedence, associativity);
  2012. return create_ast_node<AssignmentExpression>(
  2013. { m_source_code, rule_start.position(), position() },
  2014. assignment_op,
  2015. binding_pattern.release_nonnull(),
  2016. move(rhs));
  2017. }
  2018. }
  2019. }
  2020. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs) && !is<CallExpression>(*lhs)) {
  2021. syntax_error("Invalid left-hand side in assignment");
  2022. } else if (m_state.strict_mode && is<Identifier>(*lhs)) {
  2023. auto const& name = static_cast<Identifier const&>(*lhs).string();
  2024. check_identifier_name_for_assignment_validity(name);
  2025. } else if (m_state.strict_mode && is<CallExpression>(*lhs)) {
  2026. syntax_error("Cannot assign to function call");
  2027. }
  2028. auto rhs = parse_expression(min_precedence, associativity, forbidden);
  2029. return create_ast_node<AssignmentExpression>({ m_source_code, rule_start.position(), position() }, assignment_op, move(lhs), move(rhs));
  2030. }
  2031. NonnullRefPtr<Identifier> Parser::parse_identifier()
  2032. {
  2033. auto identifier_start = position();
  2034. auto token = consume_identifier();
  2035. if (m_state.in_class_field_initializer && token.value() == "arguments"sv)
  2036. syntax_error("'arguments' is not allowed in class field initializer");
  2037. return create_ast_node<Identifier>(
  2038. { m_source_code, identifier_start, position() },
  2039. token.flystring_value());
  2040. }
  2041. Vector<CallExpression::Argument> Parser::parse_arguments()
  2042. {
  2043. Vector<CallExpression::Argument> arguments;
  2044. consume(TokenType::ParenOpen);
  2045. while (match_expression() || match(TokenType::TripleDot)) {
  2046. if (match(TokenType::TripleDot)) {
  2047. consume();
  2048. arguments.append({ parse_expression(2), true });
  2049. } else {
  2050. arguments.append({ parse_expression(2), false });
  2051. }
  2052. if (!match(TokenType::Comma))
  2053. break;
  2054. consume();
  2055. }
  2056. consume(TokenType::ParenClose);
  2057. return arguments;
  2058. }
  2059. NonnullRefPtr<Expression> Parser::parse_call_expression(NonnullRefPtr<Expression> lhs)
  2060. {
  2061. auto rule_start = push_start();
  2062. if (!m_state.allow_super_constructor_call && is<SuperExpression>(*lhs))
  2063. syntax_error("'super' keyword unexpected here");
  2064. auto arguments = parse_arguments();
  2065. if (is<SuperExpression>(*lhs))
  2066. return create_ast_node<SuperCall>({ m_source_code, rule_start.position(), position() }, move(arguments));
  2067. return create_ast_node<CallExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), move(arguments));
  2068. }
  2069. NonnullRefPtr<NewExpression> Parser::parse_new_expression()
  2070. {
  2071. auto rule_start = push_start();
  2072. consume(TokenType::New);
  2073. auto callee = parse_expression(g_operator_precedence.get(TokenType::New), Associativity::Right, { TokenType::ParenOpen, TokenType::QuestionMarkPeriod });
  2074. if (is<ImportCall>(*callee))
  2075. syntax_error("Cannot call new on dynamic import", callee->source_range().start);
  2076. Vector<CallExpression::Argument> arguments;
  2077. if (match(TokenType::ParenOpen)) {
  2078. consume(TokenType::ParenOpen);
  2079. while (match_expression() || match(TokenType::TripleDot)) {
  2080. if (match(TokenType::TripleDot)) {
  2081. consume();
  2082. arguments.append({ parse_expression(2), true });
  2083. } else {
  2084. arguments.append({ parse_expression(2), false });
  2085. }
  2086. if (!match(TokenType::Comma))
  2087. break;
  2088. consume();
  2089. }
  2090. consume(TokenType::ParenClose);
  2091. }
  2092. return create_ast_node<NewExpression>({ m_source_code, rule_start.position(), position() }, move(callee), move(arguments));
  2093. }
  2094. NonnullRefPtr<YieldExpression> Parser::parse_yield_expression()
  2095. {
  2096. auto rule_start = push_start();
  2097. if (m_state.in_formal_parameter_context)
  2098. syntax_error("'Yield' expression is not allowed in formal parameters of generator function");
  2099. consume(TokenType::Yield);
  2100. RefPtr<Expression> argument;
  2101. bool yield_from = false;
  2102. if (!m_state.current_token.trivia_contains_line_terminator()) {
  2103. if (match(TokenType::Asterisk)) {
  2104. consume();
  2105. yield_from = true;
  2106. }
  2107. if (yield_from || match_expression() || match(TokenType::Class))
  2108. argument = parse_expression(2);
  2109. }
  2110. return create_ast_node<YieldExpression>({ m_source_code, rule_start.position(), position() }, move(argument), yield_from);
  2111. }
  2112. NonnullRefPtr<AwaitExpression> Parser::parse_await_expression()
  2113. {
  2114. auto rule_start = push_start();
  2115. if (m_state.in_formal_parameter_context)
  2116. syntax_error("'Await' expression is not allowed in formal parameters of an async function");
  2117. consume(TokenType::Await);
  2118. auto precedence = g_operator_precedence.get(TokenType::Await);
  2119. auto associativity = operator_associativity(TokenType::Await);
  2120. auto argument = parse_expression(precedence, associativity);
  2121. m_state.current_scope_pusher->set_contains_await_expression();
  2122. return create_ast_node<AwaitExpression>({ m_source_code, rule_start.position(), position() }, move(argument));
  2123. }
  2124. NonnullRefPtr<ReturnStatement> Parser::parse_return_statement()
  2125. {
  2126. auto rule_start = push_start();
  2127. if (!m_state.in_function_context && !m_state.in_arrow_function_context)
  2128. syntax_error("'return' not allowed outside of a function");
  2129. consume(TokenType::Return);
  2130. // Automatic semicolon insertion: terminate statement when return is followed by newline
  2131. if (m_state.current_token.trivia_contains_line_terminator())
  2132. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, nullptr);
  2133. if (match_expression()) {
  2134. auto expression = parse_expression(0);
  2135. consume_or_insert_semicolon();
  2136. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, move(expression));
  2137. }
  2138. consume_or_insert_semicolon();
  2139. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, nullptr);
  2140. }
  2141. void Parser::parse_statement_list(ScopeNode& output_node, AllowLabelledFunction allow_labelled_functions)
  2142. {
  2143. while (!done()) {
  2144. if (match_declaration()) {
  2145. auto declaration = parse_declaration();
  2146. VERIFY(m_state.current_scope_pusher);
  2147. m_state.current_scope_pusher->add_declaration(declaration);
  2148. output_node.append(move(declaration));
  2149. } else if (match_statement()) {
  2150. output_node.append(parse_statement(allow_labelled_functions));
  2151. } else {
  2152. break;
  2153. }
  2154. }
  2155. }
  2156. // FunctionBody, https://tc39.es/ecma262/#prod-FunctionBody
  2157. NonnullRefPtr<FunctionBody> Parser::parse_function_body(Vector<FunctionParameter> const& parameters, FunctionKind function_kind, bool& contains_direct_call_to_eval)
  2158. {
  2159. auto rule_start = push_start();
  2160. auto function_body = create_ast_node<FunctionBody>({ m_source_code, rule_start.position(), position() });
  2161. ScopePusher function_scope = ScopePusher::function_scope(*this, function_body, parameters); // FIXME <-
  2162. auto has_use_strict = parse_directive(function_body);
  2163. bool previous_strict_mode = m_state.strict_mode;
  2164. if (has_use_strict) {
  2165. m_state.strict_mode = true;
  2166. function_body->set_strict_mode();
  2167. if (!is_simple_parameter_list(parameters))
  2168. syntax_error("Illegal 'use strict' directive in function with non-simple parameter list");
  2169. } else if (previous_strict_mode) {
  2170. function_body->set_strict_mode();
  2171. }
  2172. parse_statement_list(function_body);
  2173. // If we're parsing the function body standalone, e.g. via CreateDynamicFunction, we must have reached EOF here.
  2174. // Otherwise, we need a closing curly bracket (which is consumed elsewhere). If we get neither, it's an error.
  2175. if (!match(TokenType::Eof) && !match(TokenType::CurlyClose))
  2176. expected(Token::name(TokenType::CurlyClose));
  2177. // If the function contains 'use strict' we need to check the parameters (again).
  2178. if (function_body->in_strict_mode() || function_kind != FunctionKind::Normal) {
  2179. Vector<StringView> parameter_names;
  2180. for (auto& parameter : parameters) {
  2181. parameter.binding.visit(
  2182. [&](FlyString const& parameter_name) {
  2183. check_identifier_name_for_assignment_validity(parameter_name, function_body->in_strict_mode());
  2184. if (function_kind == FunctionKind::Generator && parameter_name == "yield"sv)
  2185. syntax_error("Parameter name 'yield' not allowed in this context");
  2186. if (function_kind == FunctionKind::Async && parameter_name == "await"sv)
  2187. syntax_error("Parameter name 'await' not allowed in this context");
  2188. for (auto& previous_name : parameter_names) {
  2189. if (previous_name == parameter_name) {
  2190. syntax_error(String::formatted("Duplicate parameter '{}' not allowed in strict mode", parameter_name));
  2191. }
  2192. }
  2193. parameter_names.append(parameter_name);
  2194. },
  2195. [&](NonnullRefPtr<BindingPattern> const& binding) {
  2196. binding->for_each_bound_name([&](auto& bound_name) {
  2197. if (function_kind == FunctionKind::Generator && bound_name == "yield"sv)
  2198. syntax_error("Parameter name 'yield' not allowed in this context");
  2199. if (function_kind == FunctionKind::Async && bound_name == "await"sv)
  2200. syntax_error("Parameter name 'await' not allowed in this context");
  2201. for (auto& previous_name : parameter_names) {
  2202. if (previous_name == bound_name) {
  2203. syntax_error(String::formatted("Duplicate parameter '{}' not allowed in strict mode", bound_name));
  2204. break;
  2205. }
  2206. }
  2207. parameter_names.append(bound_name);
  2208. });
  2209. });
  2210. }
  2211. }
  2212. m_state.strict_mode = previous_strict_mode;
  2213. contains_direct_call_to_eval = function_scope.contains_direct_call_to_eval();
  2214. return function_body;
  2215. }
  2216. NonnullRefPtr<BlockStatement> Parser::parse_block_statement()
  2217. {
  2218. auto rule_start = push_start();
  2219. auto block = create_ast_node<BlockStatement>({ m_source_code, rule_start.position(), position() });
  2220. ScopePusher block_scope = ScopePusher::block_scope(*this, block);
  2221. consume(TokenType::CurlyOpen);
  2222. parse_statement_list(block);
  2223. consume(TokenType::CurlyClose);
  2224. return block;
  2225. }
  2226. template<typename FunctionNodeType>
  2227. NonnullRefPtr<FunctionNodeType> Parser::parse_function_node(u16 parse_options, Optional<Position> const& function_start)
  2228. {
  2229. auto rule_start = function_start.has_value()
  2230. ? RulePosition { *this, *function_start }
  2231. : push_start();
  2232. VERIFY(!(parse_options & FunctionNodeParseOptions::IsGetterFunction && parse_options & FunctionNodeParseOptions::IsSetterFunction));
  2233. TemporaryChange super_property_access_rollback(m_state.allow_super_property_lookup, !!(parse_options & FunctionNodeParseOptions::AllowSuperPropertyLookup));
  2234. TemporaryChange super_constructor_call_rollback(m_state.allow_super_constructor_call, !!(parse_options & FunctionNodeParseOptions::AllowSuperConstructorCall));
  2235. TemporaryChange break_context_rollback(m_state.in_break_context, false);
  2236. TemporaryChange continue_context_rollback(m_state.in_continue_context, false);
  2237. TemporaryChange class_field_initializer_rollback(m_state.in_class_field_initializer, false);
  2238. TemporaryChange might_need_arguments_object_rollback(m_state.function_might_need_arguments_object, false);
  2239. constexpr auto is_function_expression = IsSame<FunctionNodeType, FunctionExpression>;
  2240. FunctionKind function_kind;
  2241. if ((parse_options & FunctionNodeParseOptions::IsGeneratorFunction) != 0 && (parse_options & FunctionNodeParseOptions::IsAsyncFunction) != 0)
  2242. function_kind = FunctionKind::AsyncGenerator;
  2243. else if ((parse_options & FunctionNodeParseOptions::IsGeneratorFunction) != 0)
  2244. function_kind = FunctionKind::Generator;
  2245. else if ((parse_options & FunctionNodeParseOptions::IsAsyncFunction) != 0)
  2246. function_kind = FunctionKind::Async;
  2247. else
  2248. function_kind = FunctionKind::Normal;
  2249. FlyString name;
  2250. if (parse_options & FunctionNodeParseOptions::CheckForFunctionAndName) {
  2251. if (function_kind == FunctionKind::Normal && match(TokenType::Async) && !next_token().trivia_contains_line_terminator()) {
  2252. function_kind = FunctionKind::Async;
  2253. consume(TokenType::Async);
  2254. parse_options |= FunctionNodeParseOptions::IsAsyncFunction;
  2255. }
  2256. consume(TokenType::Function);
  2257. if (match(TokenType::Asterisk)) {
  2258. function_kind = function_kind == FunctionKind::Normal ? FunctionKind::Generator : FunctionKind::AsyncGenerator;
  2259. consume(TokenType::Asterisk);
  2260. parse_options |= FunctionNodeParseOptions::IsGeneratorFunction;
  2261. }
  2262. if (parse_options & FunctionNodeParseOptions::HasDefaultExportName)
  2263. name = ExportStatement::local_name_for_default;
  2264. else if (FunctionNodeType::must_have_name() || match_identifier())
  2265. name = consume_identifier().flystring_value();
  2266. else if (is_function_expression && (match(TokenType::Yield) || match(TokenType::Await)))
  2267. name = consume().flystring_value();
  2268. check_identifier_name_for_assignment_validity(name);
  2269. if (function_kind == FunctionKind::AsyncGenerator && (name == "await"sv || name == "yield"sv))
  2270. syntax_error(String::formatted("async generator function is not allowed to be called '{}'", name));
  2271. if (m_state.in_class_static_init_block && name == "await"sv)
  2272. syntax_error("'await' is a reserved word");
  2273. }
  2274. TemporaryChange class_static_initializer_rollback(m_state.in_class_static_init_block, false);
  2275. TemporaryChange generator_change(m_state.in_generator_function_context, function_kind == FunctionKind::Generator || function_kind == FunctionKind::AsyncGenerator);
  2276. TemporaryChange async_change(m_state.await_expression_is_valid, function_kind == FunctionKind::Async || function_kind == FunctionKind::AsyncGenerator);
  2277. consume(TokenType::ParenOpen);
  2278. i32 function_length = -1;
  2279. auto parameters = parse_formal_parameters(function_length, parse_options);
  2280. consume(TokenType::ParenClose);
  2281. if (function_length == -1)
  2282. function_length = parameters.size();
  2283. TemporaryChange function_context_rollback(m_state.in_function_context, true);
  2284. auto old_labels_in_scope = move(m_state.labels_in_scope);
  2285. ScopeGuard guard([&]() {
  2286. m_state.labels_in_scope = move(old_labels_in_scope);
  2287. });
  2288. consume(TokenType::CurlyOpen);
  2289. bool contains_direct_call_to_eval = false;
  2290. auto body = parse_function_body(parameters, function_kind, contains_direct_call_to_eval);
  2291. consume(TokenType::CurlyClose);
  2292. auto has_strict_directive = body->in_strict_mode();
  2293. if (has_strict_directive)
  2294. check_identifier_name_for_assignment_validity(name, true);
  2295. auto function_start_offset = rule_start.position().offset;
  2296. auto function_end_offset = position().offset - m_state.current_token.trivia().length();
  2297. auto source_text = String { m_state.lexer.source().substring_view(function_start_offset, function_end_offset - function_start_offset) };
  2298. return create_ast_node<FunctionNodeType>(
  2299. { m_source_code, rule_start.position(), position() },
  2300. name, move(source_text), move(body), move(parameters), function_length,
  2301. function_kind, has_strict_directive, m_state.function_might_need_arguments_object,
  2302. contains_direct_call_to_eval);
  2303. }
  2304. Vector<FunctionParameter> Parser::parse_formal_parameters(int& function_length, u16 parse_options)
  2305. {
  2306. auto rule_start = push_start();
  2307. bool has_default_parameter = false;
  2308. bool has_rest_parameter = false;
  2309. TemporaryChange formal_parameter_context_change { m_state.in_formal_parameter_context, true };
  2310. Vector<FunctionParameter> parameters;
  2311. auto consume_identifier_or_binding_pattern = [&]() -> Variant<FlyString, NonnullRefPtr<BindingPattern>> {
  2312. if (auto pattern = parse_binding_pattern(AllowDuplicates::No, AllowMemberExpressions::No))
  2313. return pattern.release_nonnull();
  2314. auto token = consume_identifier();
  2315. auto parameter_name = token.flystring_value();
  2316. check_identifier_name_for_assignment_validity(parameter_name);
  2317. for (auto& parameter : parameters) {
  2318. bool has_same_name = parameter.binding.visit(
  2319. [&](FlyString const& name) {
  2320. return name == parameter_name;
  2321. },
  2322. [&](NonnullRefPtr<BindingPattern> const& bindings) {
  2323. bool found_duplicate = false;
  2324. bindings->for_each_bound_name([&](auto& bound_name) {
  2325. if (bound_name == parameter_name)
  2326. found_duplicate = true;
  2327. });
  2328. return found_duplicate;
  2329. });
  2330. if (!has_same_name)
  2331. continue;
  2332. String message;
  2333. if (parse_options & FunctionNodeParseOptions::IsArrowFunction)
  2334. message = String::formatted("Duplicate parameter '{}' not allowed in arrow function", parameter_name);
  2335. else if (m_state.strict_mode)
  2336. message = String::formatted("Duplicate parameter '{}' not allowed in strict mode", parameter_name);
  2337. else if (has_default_parameter || match(TokenType::Equals))
  2338. message = String::formatted("Duplicate parameter '{}' not allowed in function with default parameter", parameter_name);
  2339. else if (has_rest_parameter)
  2340. message = String::formatted("Duplicate parameter '{}' not allowed in function with rest parameter", parameter_name);
  2341. if (!message.is_empty())
  2342. syntax_error(message, Position { token.line_number(), token.line_column() });
  2343. break;
  2344. }
  2345. return FlyString { token.value() };
  2346. };
  2347. while (match(TokenType::CurlyOpen) || match(TokenType::BracketOpen) || match_identifier() || match(TokenType::TripleDot)) {
  2348. if (parse_options & FunctionNodeParseOptions::IsGetterFunction)
  2349. syntax_error("Getter function must have no arguments");
  2350. if (parse_options & FunctionNodeParseOptions::IsSetterFunction && (parameters.size() >= 1 || match(TokenType::TripleDot)))
  2351. syntax_error("Setter function must have one argument");
  2352. auto is_rest = false;
  2353. if (match(TokenType::TripleDot)) {
  2354. consume();
  2355. has_rest_parameter = true;
  2356. function_length = parameters.size();
  2357. is_rest = true;
  2358. }
  2359. auto parameter = consume_identifier_or_binding_pattern();
  2360. RefPtr<Expression> default_value;
  2361. if (match(TokenType::Equals)) {
  2362. consume();
  2363. if (is_rest)
  2364. syntax_error("Rest parameter may not have a default initializer");
  2365. TemporaryChange change(m_state.in_function_context, true);
  2366. has_default_parameter = true;
  2367. function_length = parameters.size();
  2368. default_value = parse_expression(2);
  2369. bool is_generator = parse_options & FunctionNodeParseOptions::IsGeneratorFunction;
  2370. if ((is_generator || m_state.strict_mode) && default_value && default_value->fast_is<Identifier>() && static_cast<Identifier&>(*default_value).string() == "yield"sv)
  2371. syntax_error("Generator function parameter initializer cannot contain a reference to an identifier named \"yield\"");
  2372. }
  2373. parameters.append({ move(parameter), default_value, is_rest });
  2374. if (!match(TokenType::Comma) || is_rest)
  2375. break;
  2376. consume(TokenType::Comma);
  2377. }
  2378. if (parse_options & FunctionNodeParseOptions::IsSetterFunction && parameters.is_empty())
  2379. syntax_error("Setter function must have one argument");
  2380. // If we're parsing the parameters standalone, e.g. via CreateDynamicFunction, we must have reached EOF here.
  2381. // Otherwise, we need a closing parenthesis (which is consumed elsewhere). If we get neither, it's an error.
  2382. if (!match(TokenType::Eof) && !match(TokenType::ParenClose))
  2383. expected(Token::name(TokenType::ParenClose));
  2384. return parameters;
  2385. }
  2386. static AK::Array<FlyString, 36> s_reserved_words = { "break", "case", "catch", "class", "const", "continue", "debugger", "default", "delete", "do", "else", "enum", "export", "extends", "false", "finally", "for", "function", "if", "import", "in", "instanceof", "new", "null", "return", "super", "switch", "this", "throw", "true", "try", "typeof", "var", "void", "while", "with" };
  2387. RefPtr<BindingPattern> Parser::parse_binding_pattern(Parser::AllowDuplicates allow_duplicates, Parser::AllowMemberExpressions allow_member_expressions)
  2388. {
  2389. auto rule_start = push_start();
  2390. TokenType closing_token;
  2391. bool is_object = true;
  2392. if (match(TokenType::BracketOpen)) {
  2393. consume();
  2394. closing_token = TokenType::BracketClose;
  2395. is_object = false;
  2396. } else if (match(TokenType::CurlyOpen)) {
  2397. consume();
  2398. closing_token = TokenType::CurlyClose;
  2399. } else {
  2400. return {};
  2401. }
  2402. Vector<BindingPattern::BindingEntry> entries;
  2403. while (!match(closing_token)) {
  2404. if (!is_object && match(TokenType::Comma)) {
  2405. consume();
  2406. entries.append(BindingPattern::BindingEntry {});
  2407. continue;
  2408. }
  2409. auto is_rest = false;
  2410. if (match(TokenType::TripleDot)) {
  2411. consume();
  2412. is_rest = true;
  2413. }
  2414. decltype(BindingPattern::BindingEntry::name) name = Empty {};
  2415. decltype(BindingPattern::BindingEntry::alias) alias = Empty {};
  2416. RefPtr<Expression> initializer = {};
  2417. if (is_object) {
  2418. bool needs_alias = false;
  2419. if (allow_member_expressions == AllowMemberExpressions::Yes && is_rest) {
  2420. auto expression_position = position();
  2421. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2422. if (is<MemberExpression>(*expression))
  2423. alias = static_ptr_cast<MemberExpression>(expression);
  2424. else if (is<Identifier>(*expression))
  2425. name = static_ptr_cast<Identifier>(expression);
  2426. else
  2427. syntax_error("Invalid destructuring assignment target", expression_position);
  2428. } else if (match_identifier_name() || match(TokenType::StringLiteral) || match(TokenType::NumericLiteral) || match(TokenType::BigIntLiteral)) {
  2429. if (match(TokenType::StringLiteral) || match(TokenType::NumericLiteral))
  2430. needs_alias = true;
  2431. if (match(TokenType::StringLiteral)) {
  2432. auto token = consume(TokenType::StringLiteral);
  2433. auto string_literal = parse_string_literal(token);
  2434. name = create_ast_node<Identifier>(
  2435. { m_source_code, rule_start.position(), position() },
  2436. string_literal->value());
  2437. } else if (match(TokenType::BigIntLiteral)) {
  2438. auto string_value = consume().flystring_value();
  2439. VERIFY(string_value.ends_with("n"sv));
  2440. name = create_ast_node<Identifier>(
  2441. { m_source_code, rule_start.position(), position() },
  2442. FlyString(string_value.view().substring_view(0, string_value.length() - 1)));
  2443. } else {
  2444. name = create_ast_node<Identifier>(
  2445. { m_source_code, rule_start.position(), position() },
  2446. consume().flystring_value());
  2447. }
  2448. } else if (match(TokenType::BracketOpen)) {
  2449. consume();
  2450. auto expression = parse_expression(0);
  2451. name = move(expression);
  2452. consume(TokenType::BracketClose);
  2453. } else {
  2454. expected("identifier or computed property name");
  2455. return {};
  2456. }
  2457. if (!is_rest && match(TokenType::Colon)) {
  2458. consume();
  2459. if (allow_member_expressions == AllowMemberExpressions::Yes) {
  2460. auto expression_position = position();
  2461. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2462. if (is<ArrayExpression>(*expression) || is<ObjectExpression>(*expression)) {
  2463. if (auto synthesized_binding_pattern = synthesize_binding_pattern(*expression))
  2464. alias = synthesized_binding_pattern.release_nonnull();
  2465. else
  2466. syntax_error("Invalid destructuring assignment target", expression_position);
  2467. } else if (is<MemberExpression>(*expression)) {
  2468. alias = static_ptr_cast<MemberExpression>(expression);
  2469. } else if (is<Identifier>(*expression)) {
  2470. alias = static_ptr_cast<Identifier>(expression);
  2471. } else {
  2472. syntax_error("Invalid destructuring assignment target", expression_position);
  2473. }
  2474. } else if (match(TokenType::CurlyOpen) || match(TokenType::BracketOpen)) {
  2475. auto binding_pattern = parse_binding_pattern(allow_duplicates, allow_member_expressions);
  2476. if (!binding_pattern)
  2477. return {};
  2478. alias = binding_pattern.release_nonnull();
  2479. } else if (match_identifier_name()) {
  2480. alias = create_ast_node<Identifier>(
  2481. { m_source_code, rule_start.position(), position() },
  2482. consume().flystring_value());
  2483. } else {
  2484. expected("identifier or binding pattern");
  2485. return {};
  2486. }
  2487. } else if (needs_alias) {
  2488. expected("alias for string or numeric literal name");
  2489. return {};
  2490. }
  2491. } else {
  2492. if (allow_member_expressions == AllowMemberExpressions::Yes) {
  2493. auto expression_position = position();
  2494. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2495. if (is<ArrayExpression>(*expression) || is<ObjectExpression>(*expression)) {
  2496. if (auto synthesized_binding_pattern = synthesize_binding_pattern(*expression))
  2497. alias = synthesized_binding_pattern.release_nonnull();
  2498. else
  2499. syntax_error("Invalid destructuring assignment target", expression_position);
  2500. } else if (is<MemberExpression>(*expression)) {
  2501. alias = static_ptr_cast<MemberExpression>(expression);
  2502. } else if (is<Identifier>(*expression)) {
  2503. alias = static_ptr_cast<Identifier>(expression);
  2504. } else {
  2505. syntax_error("Invalid destructuring assignment target", expression_position);
  2506. }
  2507. } else if (match(TokenType::BracketOpen) || match(TokenType::CurlyOpen)) {
  2508. auto pattern = parse_binding_pattern(allow_duplicates, allow_member_expressions);
  2509. if (!pattern) {
  2510. expected("binding pattern");
  2511. return {};
  2512. }
  2513. alias = pattern.release_nonnull();
  2514. } else if (match_identifier_name()) {
  2515. // BindingElement must always have an Empty name field
  2516. auto identifier_name = consume_identifier().flystring_value();
  2517. alias = create_ast_node<Identifier>(
  2518. { m_source_code, rule_start.position(), position() },
  2519. identifier_name);
  2520. } else {
  2521. expected("identifier or binding pattern");
  2522. return {};
  2523. }
  2524. }
  2525. if (match(TokenType::Equals)) {
  2526. if (is_rest) {
  2527. syntax_error("Unexpected initializer after rest element");
  2528. return {};
  2529. }
  2530. consume();
  2531. initializer = parse_expression(2);
  2532. if (!initializer) {
  2533. expected("initialization expression");
  2534. return {};
  2535. }
  2536. }
  2537. entries.append(BindingPattern::BindingEntry { move(name), move(alias), move(initializer), is_rest });
  2538. if (match(TokenType::Comma)) {
  2539. if (is_rest) {
  2540. syntax_error("Rest element may not be followed by a comma");
  2541. return {};
  2542. }
  2543. consume();
  2544. } else if (is_object && !match(TokenType::CurlyClose)) {
  2545. consume(TokenType::Comma);
  2546. }
  2547. }
  2548. while (!is_object && match(TokenType::Comma))
  2549. consume();
  2550. consume(closing_token);
  2551. auto kind = is_object ? BindingPattern::Kind::Object : BindingPattern::Kind::Array;
  2552. auto pattern = adopt_ref(*new BindingPattern);
  2553. pattern->entries = move(entries);
  2554. pattern->kind = kind;
  2555. Vector<StringView> bound_names;
  2556. pattern->for_each_bound_name([&](auto& name) {
  2557. if (allow_duplicates == AllowDuplicates::No) {
  2558. if (bound_names.contains_slow(name))
  2559. syntax_error("Duplicate parameter names in bindings");
  2560. bound_names.append(name);
  2561. }
  2562. check_identifier_name_for_assignment_validity(name);
  2563. });
  2564. return pattern;
  2565. }
  2566. NonnullRefPtr<VariableDeclaration> Parser::parse_variable_declaration(bool for_loop_variable_declaration)
  2567. {
  2568. auto rule_start = push_start();
  2569. DeclarationKind declaration_kind;
  2570. switch (m_state.current_token.type()) {
  2571. case TokenType::Var:
  2572. declaration_kind = DeclarationKind::Var;
  2573. break;
  2574. case TokenType::Let:
  2575. declaration_kind = DeclarationKind::Let;
  2576. break;
  2577. case TokenType::Const:
  2578. declaration_kind = DeclarationKind::Const;
  2579. break;
  2580. default:
  2581. VERIFY_NOT_REACHED();
  2582. }
  2583. consume();
  2584. NonnullRefPtrVector<VariableDeclarator> declarations;
  2585. for (;;) {
  2586. Variant<NonnullRefPtr<Identifier>, NonnullRefPtr<BindingPattern>, Empty> target {};
  2587. if (match_identifier()) {
  2588. auto identifier_start = push_start();
  2589. auto name = consume_identifier().flystring_value();
  2590. target = create_ast_node<Identifier>(
  2591. { m_source_code, rule_start.position(), position() },
  2592. name);
  2593. check_identifier_name_for_assignment_validity(name);
  2594. if ((declaration_kind == DeclarationKind::Let || declaration_kind == DeclarationKind::Const) && name == "let"sv)
  2595. syntax_error("Lexical binding may not be called 'let'");
  2596. } else if (auto pattern = parse_binding_pattern(declaration_kind != DeclarationKind::Var ? AllowDuplicates::No : AllowDuplicates::Yes, AllowMemberExpressions::No)) {
  2597. target = pattern.release_nonnull();
  2598. if ((declaration_kind == DeclarationKind::Let || declaration_kind == DeclarationKind::Const)) {
  2599. target.get<NonnullRefPtr<BindingPattern>>()->for_each_bound_name([this](auto& name) {
  2600. if (name == "let"sv)
  2601. syntax_error("Lexical binding may not be called 'let'");
  2602. });
  2603. }
  2604. } else if (!m_state.in_generator_function_context && match(TokenType::Yield)) {
  2605. if (m_state.strict_mode)
  2606. syntax_error("Identifier must not be a reserved word in strict mode ('yield')");
  2607. target = create_ast_node<Identifier>(
  2608. { m_source_code, rule_start.position(), position() },
  2609. consume().flystring_value());
  2610. } else if (!m_state.await_expression_is_valid && match(TokenType::Async)) {
  2611. if (m_program_type == Program::Type::Module)
  2612. syntax_error("Identifier must not be a reserved word in modules ('async')");
  2613. target = create_ast_node<Identifier>(
  2614. { m_source_code, rule_start.position(), position() },
  2615. consume().flystring_value());
  2616. }
  2617. if (target.has<Empty>()) {
  2618. expected("identifier or a binding pattern");
  2619. if (match(TokenType::Comma)) {
  2620. consume();
  2621. continue;
  2622. }
  2623. break;
  2624. }
  2625. RefPtr<Expression> init;
  2626. if (match(TokenType::Equals)) {
  2627. consume();
  2628. // In a for loop 'in' can be ambiguous so we do not allow it
  2629. // 14.7.4 The for Statement, https://tc39.es/ecma262/#prod-ForStatement and 14.7.5 The for-in, for-of, and for-await-of Statements, https://tc39.es/ecma262/#prod-ForInOfStatement
  2630. if (for_loop_variable_declaration)
  2631. init = parse_expression(2, Associativity::Right, { TokenType::In });
  2632. else
  2633. init = parse_expression(2);
  2634. } else if (!for_loop_variable_declaration && declaration_kind == DeclarationKind::Const) {
  2635. syntax_error("Missing initializer in 'const' variable declaration");
  2636. } else if (!for_loop_variable_declaration && target.has<NonnullRefPtr<BindingPattern>>()) {
  2637. syntax_error("Missing initializer in destructuring assignment");
  2638. }
  2639. declarations.append(create_ast_node<VariableDeclarator>(
  2640. { m_source_code, rule_start.position(), position() },
  2641. move(target).downcast<NonnullRefPtr<Identifier>, NonnullRefPtr<BindingPattern>>(),
  2642. move(init)));
  2643. if (match(TokenType::Comma)) {
  2644. consume();
  2645. continue;
  2646. }
  2647. break;
  2648. }
  2649. if (!for_loop_variable_declaration)
  2650. consume_or_insert_semicolon();
  2651. auto declaration = create_ast_node<VariableDeclaration>({ m_source_code, rule_start.position(), position() }, declaration_kind, move(declarations));
  2652. return declaration;
  2653. }
  2654. NonnullRefPtr<ThrowStatement> Parser::parse_throw_statement()
  2655. {
  2656. auto rule_start = push_start();
  2657. consume(TokenType::Throw);
  2658. // Automatic semicolon insertion: terminate statement when throw is followed by newline
  2659. if (m_state.current_token.trivia_contains_line_terminator()) {
  2660. syntax_error("No line break is allowed between 'throw' and its expression");
  2661. return create_ast_node<ThrowStatement>({ m_source_code, rule_start.position(), position() }, create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() }));
  2662. }
  2663. auto expression = parse_expression(0);
  2664. consume_or_insert_semicolon();
  2665. return create_ast_node<ThrowStatement>({ m_source_code, rule_start.position(), position() }, move(expression));
  2666. }
  2667. NonnullRefPtr<BreakStatement> Parser::parse_break_statement()
  2668. {
  2669. auto rule_start = push_start();
  2670. consume(TokenType::Break);
  2671. FlyString target_label;
  2672. if (match(TokenType::Semicolon)) {
  2673. consume();
  2674. } else {
  2675. if (!m_state.current_token.trivia_contains_line_terminator() && match_identifier()) {
  2676. target_label = consume().value();
  2677. auto label = m_state.labels_in_scope.find(target_label);
  2678. if (label == m_state.labels_in_scope.end())
  2679. syntax_error(String::formatted("Label '{}' not found", target_label));
  2680. }
  2681. consume_or_insert_semicolon();
  2682. }
  2683. if (target_label.is_null() && !m_state.in_break_context)
  2684. syntax_error("Unlabeled 'break' not allowed outside of a loop or switch statement");
  2685. return create_ast_node<BreakStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2686. }
  2687. NonnullRefPtr<ContinueStatement> Parser::parse_continue_statement()
  2688. {
  2689. auto rule_start = push_start();
  2690. if (!m_state.in_continue_context)
  2691. syntax_error("'continue' not allow outside of a loop");
  2692. consume(TokenType::Continue);
  2693. FlyString target_label;
  2694. if (match(TokenType::Semicolon)) {
  2695. consume();
  2696. return create_ast_node<ContinueStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2697. }
  2698. if (!m_state.current_token.trivia_contains_line_terminator() && match_identifier()) {
  2699. auto label_position = position();
  2700. target_label = consume().value();
  2701. auto label = m_state.labels_in_scope.find(target_label);
  2702. if (label == m_state.labels_in_scope.end())
  2703. syntax_error(String::formatted("Label '{}' not found or invalid", target_label));
  2704. else
  2705. label->value = label_position;
  2706. }
  2707. consume_or_insert_semicolon();
  2708. return create_ast_node<ContinueStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2709. }
  2710. NonnullRefPtr<ConditionalExpression> Parser::parse_conditional_expression(NonnullRefPtr<Expression> test, ForbiddenTokens forbidden)
  2711. {
  2712. auto rule_start = push_start();
  2713. consume(TokenType::QuestionMark);
  2714. auto consequent = parse_expression(2);
  2715. consume(TokenType::Colon);
  2716. auto alternate = parse_expression(2, Associativity::Right, forbidden);
  2717. return create_ast_node<ConditionalExpression>({ m_source_code, rule_start.position(), position() }, move(test), move(consequent), move(alternate));
  2718. }
  2719. NonnullRefPtr<OptionalChain> Parser::parse_optional_chain(NonnullRefPtr<Expression> base)
  2720. {
  2721. auto rule_start = push_start();
  2722. Vector<OptionalChain::Reference> chain;
  2723. do {
  2724. if (match(TokenType::QuestionMarkPeriod)) {
  2725. consume(TokenType::QuestionMarkPeriod);
  2726. switch (m_state.current_token.type()) {
  2727. case TokenType::ParenOpen:
  2728. chain.append(OptionalChain::Call { parse_arguments(), OptionalChain::Mode::Optional });
  2729. break;
  2730. case TokenType::BracketOpen:
  2731. consume();
  2732. chain.append(OptionalChain::ComputedReference { parse_expression(0), OptionalChain::Mode::Optional });
  2733. consume(TokenType::BracketClose);
  2734. break;
  2735. case TokenType::PrivateIdentifier: {
  2736. if (!is_private_identifier_valid())
  2737. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  2738. auto start = position();
  2739. auto private_identifier = consume();
  2740. chain.append(OptionalChain::PrivateMemberReference {
  2741. create_ast_node<PrivateIdentifier>({ m_source_code, start, position() }, private_identifier.value()),
  2742. OptionalChain::Mode::Optional });
  2743. break;
  2744. }
  2745. case TokenType::TemplateLiteralStart:
  2746. // 13.3.1.1 - Static Semantics: Early Errors
  2747. // OptionalChain :
  2748. // ?. TemplateLiteral
  2749. // OptionalChain TemplateLiteral
  2750. // This is a hard error.
  2751. syntax_error("Invalid tagged template literal after ?.", position());
  2752. break;
  2753. default:
  2754. if (match_identifier_name()) {
  2755. auto start = position();
  2756. auto identifier = consume();
  2757. chain.append(OptionalChain::MemberReference {
  2758. create_ast_node<Identifier>({ m_source_code, start, position() }, identifier.flystring_value()),
  2759. OptionalChain::Mode::Optional,
  2760. });
  2761. } else {
  2762. syntax_error("Invalid optional chain reference after ?.", position());
  2763. }
  2764. break;
  2765. }
  2766. } else if (match(TokenType::ParenOpen)) {
  2767. chain.append(OptionalChain::Call { parse_arguments(), OptionalChain::Mode::NotOptional });
  2768. } else if (match(TokenType::Period)) {
  2769. consume();
  2770. if (match(TokenType::PrivateIdentifier)) {
  2771. if (!is_private_identifier_valid())
  2772. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  2773. auto start = position();
  2774. auto private_identifier = consume();
  2775. chain.append(OptionalChain::PrivateMemberReference {
  2776. create_ast_node<PrivateIdentifier>({ m_source_code, start, position() }, private_identifier.value()),
  2777. OptionalChain::Mode::NotOptional,
  2778. });
  2779. } else if (match_identifier_name()) {
  2780. auto start = position();
  2781. auto identifier = consume();
  2782. chain.append(OptionalChain::MemberReference {
  2783. create_ast_node<Identifier>({ m_source_code, start, position() }, identifier.flystring_value()),
  2784. OptionalChain::Mode::NotOptional,
  2785. });
  2786. } else {
  2787. expected("an identifier");
  2788. break;
  2789. }
  2790. } else if (match(TokenType::TemplateLiteralStart)) {
  2791. // 13.3.1.1 - Static Semantics: Early Errors
  2792. // OptionalChain :
  2793. // ?. TemplateLiteral
  2794. // OptionalChain TemplateLiteral
  2795. syntax_error("Invalid tagged template literal after optional chain", position());
  2796. break;
  2797. } else if (match(TokenType::BracketOpen)) {
  2798. consume();
  2799. chain.append(OptionalChain::ComputedReference { parse_expression(2), OptionalChain::Mode::NotOptional });
  2800. consume(TokenType::BracketClose);
  2801. } else {
  2802. break;
  2803. }
  2804. } while (!done());
  2805. return create_ast_node<OptionalChain>(
  2806. { m_source_code, rule_start.position(), position() },
  2807. move(base),
  2808. move(chain));
  2809. }
  2810. NonnullRefPtr<TryStatement> Parser::parse_try_statement()
  2811. {
  2812. auto rule_start = push_start();
  2813. consume(TokenType::Try);
  2814. auto block = parse_block_statement();
  2815. RefPtr<CatchClause> handler;
  2816. if (match(TokenType::Catch))
  2817. handler = parse_catch_clause();
  2818. RefPtr<BlockStatement> finalizer;
  2819. if (match(TokenType::Finally)) {
  2820. consume();
  2821. finalizer = parse_block_statement();
  2822. }
  2823. if (!handler && !finalizer)
  2824. syntax_error("try statement must have a 'catch' or 'finally' clause");
  2825. return create_ast_node<TryStatement>({ m_source_code, rule_start.position(), position() }, move(block), move(handler), move(finalizer));
  2826. }
  2827. NonnullRefPtr<DoWhileStatement> Parser::parse_do_while_statement()
  2828. {
  2829. auto rule_start = push_start();
  2830. consume(TokenType::Do);
  2831. auto body = [&]() -> NonnullRefPtr<Statement> {
  2832. TemporaryChange break_change(m_state.in_break_context, true);
  2833. TemporaryChange continue_change(m_state.in_continue_context, true);
  2834. return parse_statement();
  2835. }();
  2836. consume(TokenType::While);
  2837. consume(TokenType::ParenOpen);
  2838. auto test = parse_expression(0);
  2839. consume(TokenType::ParenClose);
  2840. // Since ES 2015 a missing semicolon is inserted here, despite the regular ASI rules not applying
  2841. if (match(TokenType::Semicolon))
  2842. consume();
  2843. return create_ast_node<DoWhileStatement>({ m_source_code, rule_start.position(), position() }, move(test), move(body));
  2844. }
  2845. NonnullRefPtr<WhileStatement> Parser::parse_while_statement()
  2846. {
  2847. auto rule_start = push_start();
  2848. consume(TokenType::While);
  2849. consume(TokenType::ParenOpen);
  2850. auto test = parse_expression(0);
  2851. consume(TokenType::ParenClose);
  2852. TemporaryChange break_change(m_state.in_break_context, true);
  2853. TemporaryChange continue_change(m_state.in_continue_context, true);
  2854. auto body = parse_statement();
  2855. return create_ast_node<WhileStatement>({ m_source_code, rule_start.position(), position() }, move(test), move(body));
  2856. }
  2857. NonnullRefPtr<SwitchStatement> Parser::parse_switch_statement()
  2858. {
  2859. auto rule_start = push_start();
  2860. consume(TokenType::Switch);
  2861. consume(TokenType::ParenOpen);
  2862. auto determinant = parse_expression(0);
  2863. consume(TokenType::ParenClose);
  2864. consume(TokenType::CurlyOpen);
  2865. NonnullRefPtrVector<SwitchCase> cases;
  2866. auto switch_statement = create_ast_node<SwitchStatement>({ m_source_code, rule_start.position(), position() }, move(determinant));
  2867. ScopePusher switch_scope = ScopePusher::block_scope(*this, switch_statement);
  2868. auto has_default = false;
  2869. while (match(TokenType::Case) || match(TokenType::Default)) {
  2870. if (match(TokenType::Default)) {
  2871. if (has_default)
  2872. syntax_error("Multiple 'default' clauses in switch statement");
  2873. has_default = true;
  2874. }
  2875. switch_statement->add_case(parse_switch_case());
  2876. }
  2877. consume(TokenType::CurlyClose);
  2878. return switch_statement;
  2879. }
  2880. NonnullRefPtr<WithStatement> Parser::parse_with_statement()
  2881. {
  2882. auto rule_start = push_start();
  2883. consume(TokenType::With);
  2884. consume(TokenType::ParenOpen);
  2885. auto object = parse_expression(0);
  2886. consume(TokenType::ParenClose);
  2887. auto body = parse_statement();
  2888. return create_ast_node<WithStatement>({ m_source_code, rule_start.position(), position() }, move(object), move(body));
  2889. }
  2890. NonnullRefPtr<SwitchCase> Parser::parse_switch_case()
  2891. {
  2892. auto rule_start = push_start();
  2893. RefPtr<Expression> test;
  2894. if (consume().type() == TokenType::Case) {
  2895. test = parse_expression(0);
  2896. }
  2897. consume(TokenType::Colon);
  2898. NonnullRefPtrVector<Statement> consequent;
  2899. TemporaryChange break_change(m_state.in_break_context, true);
  2900. auto switch_case = create_ast_node<SwitchCase>({ m_source_code, rule_start.position(), position() }, move(test));
  2901. parse_statement_list(switch_case);
  2902. return switch_case;
  2903. }
  2904. NonnullRefPtr<CatchClause> Parser::parse_catch_clause()
  2905. {
  2906. auto rule_start = push_start();
  2907. consume(TokenType::Catch);
  2908. FlyString parameter;
  2909. RefPtr<BindingPattern> pattern_parameter;
  2910. auto should_expect_parameter = false;
  2911. if (match(TokenType::ParenOpen)) {
  2912. should_expect_parameter = true;
  2913. consume();
  2914. if (match_identifier_name()
  2915. && (!match(TokenType::Yield) || !m_state.in_generator_function_context)
  2916. && (!match(TokenType::Async) || !m_state.await_expression_is_valid)
  2917. && (!match(TokenType::Await) || !m_state.in_class_static_init_block))
  2918. parameter = consume().value();
  2919. else
  2920. pattern_parameter = parse_binding_pattern(AllowDuplicates::No, AllowMemberExpressions::No);
  2921. consume(TokenType::ParenClose);
  2922. }
  2923. if (should_expect_parameter && parameter.is_empty() && !pattern_parameter)
  2924. expected("an identifier or a binding pattern");
  2925. HashTable<FlyString> bound_names;
  2926. if (pattern_parameter) {
  2927. pattern_parameter->for_each_bound_name(
  2928. [&](auto& name) {
  2929. check_identifier_name_for_assignment_validity(name);
  2930. bound_names.set(name);
  2931. });
  2932. }
  2933. if (!parameter.is_empty()) {
  2934. check_identifier_name_for_assignment_validity(parameter);
  2935. bound_names.set(parameter);
  2936. }
  2937. ScopePusher catch_scope = ScopePusher::catch_scope(*this, pattern_parameter, parameter);
  2938. auto body = parse_block_statement();
  2939. body->for_each_lexically_declared_name([&](auto const& name) {
  2940. if (bound_names.contains(name))
  2941. syntax_error(String::formatted("Identifier '{}' already declared as catch parameter", name));
  2942. });
  2943. if (pattern_parameter) {
  2944. return create_ast_node<CatchClause>(
  2945. { m_source_code, rule_start.position(), position() },
  2946. pattern_parameter.release_nonnull(),
  2947. move(body));
  2948. }
  2949. return create_ast_node<CatchClause>(
  2950. { m_source_code, rule_start.position(), position() },
  2951. move(parameter),
  2952. move(body));
  2953. }
  2954. NonnullRefPtr<IfStatement> Parser::parse_if_statement()
  2955. {
  2956. auto rule_start = push_start();
  2957. auto parse_function_declaration_as_block_statement = [&] {
  2958. // https://tc39.es/ecma262/#sec-functiondeclarations-in-ifstatement-statement-clauses
  2959. // This production only applies when parsing non-strict code. Source text matched
  2960. // by this production is processed as if each matching occurrence of
  2961. // FunctionDeclaration[?Yield, ?Await, ~Default] was the sole StatementListItem
  2962. // of a BlockStatement occupying that position in the source text.
  2963. // The semantics of such a synthetic BlockStatement includes the web legacy
  2964. // compatibility semantics specified in B.3.2.
  2965. VERIFY(match(TokenType::Function));
  2966. auto block = create_ast_node<BlockStatement>({ m_source_code, rule_start.position(), position() });
  2967. ScopePusher block_scope = ScopePusher::block_scope(*this, *block);
  2968. auto declaration = parse_declaration();
  2969. VERIFY(m_state.current_scope_pusher);
  2970. block_scope.add_declaration(declaration);
  2971. VERIFY(is<FunctionDeclaration>(*declaration));
  2972. auto& function_declaration = static_cast<FunctionDeclaration const&>(*declaration);
  2973. if (function_declaration.kind() == FunctionKind::Generator)
  2974. syntax_error("Generator functions can only be declared in top-level or within a block");
  2975. if (function_declaration.kind() == FunctionKind::Async)
  2976. syntax_error("Async functions can only be declared in top-level or within a block");
  2977. block->append(move(declaration));
  2978. return block;
  2979. };
  2980. consume(TokenType::If);
  2981. consume(TokenType::ParenOpen);
  2982. auto predicate = parse_expression(0);
  2983. consume(TokenType::ParenClose);
  2984. RefPtr<Statement> consequent;
  2985. if (!m_state.strict_mode && match(TokenType::Function))
  2986. consequent = parse_function_declaration_as_block_statement();
  2987. else
  2988. consequent = parse_statement();
  2989. RefPtr<Statement> alternate;
  2990. if (match(TokenType::Else)) {
  2991. consume();
  2992. if (!m_state.strict_mode && match(TokenType::Function))
  2993. alternate = parse_function_declaration_as_block_statement();
  2994. else
  2995. alternate = parse_statement();
  2996. }
  2997. return create_ast_node<IfStatement>({ m_source_code, rule_start.position(), position() }, move(predicate), move(*consequent), move(alternate));
  2998. }
  2999. NonnullRefPtr<Statement> Parser::parse_for_statement()
  3000. {
  3001. auto rule_start = push_start();
  3002. auto is_await_loop = IsForAwaitLoop::No;
  3003. auto match_of = [&](Token const& token) {
  3004. return token.type() == TokenType::Identifier && token.original_value() == "of"sv;
  3005. };
  3006. auto match_for_in_of = [&]() {
  3007. bool is_of = match_of(m_state.current_token);
  3008. if (is_await_loop == IsForAwaitLoop::Yes) {
  3009. if (!is_of)
  3010. syntax_error("for await loop is only valid with 'of'");
  3011. else if (!m_state.await_expression_is_valid)
  3012. syntax_error("for await loop is only valid in async function or generator");
  3013. return true;
  3014. }
  3015. return match(TokenType::In) || is_of;
  3016. };
  3017. consume(TokenType::For);
  3018. if (match(TokenType::Await)) {
  3019. consume();
  3020. if (!m_state.await_expression_is_valid)
  3021. syntax_error("for-await-of is only allowed in async function context");
  3022. is_await_loop = IsForAwaitLoop::Yes;
  3023. }
  3024. consume(TokenType::ParenOpen);
  3025. Optional<ScopePusher> scope_pusher;
  3026. RefPtr<ASTNode> init;
  3027. if (!match(TokenType::Semicolon)) {
  3028. if (match_variable_declaration()) {
  3029. auto declaration = parse_variable_declaration(true);
  3030. if (declaration->declaration_kind() == DeclarationKind::Var) {
  3031. m_state.current_scope_pusher->add_declaration(declaration);
  3032. } else {
  3033. // This does not follow the normal declaration structure so we need additional checks.
  3034. HashTable<FlyString> bound_names;
  3035. declaration->for_each_bound_name([&](auto const& name) {
  3036. if (bound_names.set(name) != AK::HashSetResult::InsertedNewEntry)
  3037. syntax_error(String::formatted("Identifier '{}' already declared in for loop initializer", name), declaration->source_range().start);
  3038. });
  3039. }
  3040. init = move(declaration);
  3041. if (match_for_in_of())
  3042. return parse_for_in_of_statement(*init, is_await_loop);
  3043. if (static_cast<VariableDeclaration&>(*init).declaration_kind() == DeclarationKind::Const) {
  3044. for (auto& variable : static_cast<VariableDeclaration&>(*init).declarations()) {
  3045. if (!variable.init())
  3046. syntax_error("Missing initializer in 'const' variable declaration");
  3047. }
  3048. }
  3049. } else if (match_expression()) {
  3050. auto lookahead_token = next_token();
  3051. bool starts_with_async_of = match(TokenType::Async) && match_of(lookahead_token);
  3052. init = parse_expression(0, Associativity::Right, { TokenType::In });
  3053. if (match_for_in_of()) {
  3054. if (is_await_loop != IsForAwaitLoop::Yes
  3055. && starts_with_async_of && match_of(m_state.current_token))
  3056. syntax_error("for-of loop may not start with async of");
  3057. return parse_for_in_of_statement(*init, is_await_loop);
  3058. }
  3059. } else {
  3060. syntax_error("Unexpected token in for loop");
  3061. }
  3062. }
  3063. consume(TokenType::Semicolon);
  3064. RefPtr<Expression> test;
  3065. if (!match(TokenType::Semicolon))
  3066. test = parse_expression(0);
  3067. consume(TokenType::Semicolon);
  3068. RefPtr<Expression> update;
  3069. if (!match(TokenType::ParenClose))
  3070. update = parse_expression(0);
  3071. consume(TokenType::ParenClose);
  3072. TemporaryChange break_change(m_state.in_break_context, true);
  3073. TemporaryChange continue_change(m_state.in_continue_context, true);
  3074. ScopePusher for_loop_scope = ScopePusher::for_loop_scope(*this, init);
  3075. auto body = parse_statement();
  3076. return create_ast_node<ForStatement>({ m_source_code, rule_start.position(), position() }, move(init), move(test), move(update), move(body));
  3077. }
  3078. NonnullRefPtr<Statement> Parser::parse_for_in_of_statement(NonnullRefPtr<ASTNode> lhs, IsForAwaitLoop is_for_await_loop)
  3079. {
  3080. Variant<NonnullRefPtr<ASTNode>, NonnullRefPtr<BindingPattern>> for_declaration = lhs;
  3081. auto rule_start = push_start();
  3082. auto has_annexB_for_in_init_extension = false;
  3083. if (is<VariableDeclaration>(*lhs)) {
  3084. auto& declaration = static_cast<VariableDeclaration&>(*lhs);
  3085. if (declaration.declarations().size() > 1) {
  3086. syntax_error("Multiple declarations not allowed in for..in/of");
  3087. } else if (declaration.declarations().size() < 1) {
  3088. syntax_error("Need exactly one variable declaration in for..in/of");
  3089. } else {
  3090. // AnnexB extension B.3.5 Initializers in ForIn Statement Heads, https://tc39.es/ecma262/#sec-initializers-in-forin-statement-heads
  3091. auto& variable = declaration.declarations().first();
  3092. if (variable.init()) {
  3093. if (m_state.strict_mode || declaration.declaration_kind() != DeclarationKind::Var || !variable.target().has<NonnullRefPtr<Identifier>>())
  3094. syntax_error("Variable initializer not allowed in for..in/of");
  3095. else
  3096. has_annexB_for_in_init_extension = true;
  3097. }
  3098. }
  3099. } else if (!lhs->is_identifier() && !is<MemberExpression>(*lhs) && !is<CallExpression>(*lhs)) {
  3100. bool valid = false;
  3101. if (is<ObjectExpression>(*lhs) || is<ArrayExpression>(*lhs)) {
  3102. auto synthesized_binding_pattern = synthesize_binding_pattern(static_cast<Expression const&>(*lhs));
  3103. if (synthesized_binding_pattern) {
  3104. for_declaration = synthesized_binding_pattern.release_nonnull();
  3105. valid = true;
  3106. }
  3107. }
  3108. if (!valid)
  3109. syntax_error(String::formatted("Invalid left-hand side in for-loop ('{}')", lhs->class_name()));
  3110. }
  3111. auto in_or_of = consume();
  3112. auto is_in = in_or_of.type() == TokenType::In;
  3113. if (!is_in) {
  3114. if (is<MemberExpression>(*lhs)) {
  3115. auto& member = static_cast<MemberExpression const&>(*lhs);
  3116. if (member.object().is_identifier() && static_cast<Identifier const&>(member.object()).string() == "let"sv)
  3117. syntax_error("For of statement may not start with let.");
  3118. }
  3119. if (has_annexB_for_in_init_extension)
  3120. syntax_error("Variable initializer not allowed in for..of", rule_start.position());
  3121. }
  3122. auto rhs = parse_expression(is_in ? 0 : 2);
  3123. consume(TokenType::ParenClose);
  3124. TemporaryChange break_change(m_state.in_break_context, true);
  3125. TemporaryChange continue_change(m_state.in_continue_context, true);
  3126. ScopePusher for_loop_scope = ScopePusher::for_loop_scope(*this, lhs);
  3127. auto body = parse_statement();
  3128. if (is_in)
  3129. return create_ast_node<ForInStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3130. if (is_for_await_loop == IsForAwaitLoop::Yes)
  3131. return create_ast_node<ForAwaitOfStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3132. return create_ast_node<ForOfStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3133. }
  3134. NonnullRefPtr<DebuggerStatement> Parser::parse_debugger_statement()
  3135. {
  3136. auto rule_start = push_start();
  3137. consume(TokenType::Debugger);
  3138. consume_or_insert_semicolon();
  3139. return create_ast_node<DebuggerStatement>({ m_source_code, rule_start.position(), position() });
  3140. }
  3141. bool Parser::match(TokenType type) const
  3142. {
  3143. return m_state.current_token.type() == type;
  3144. }
  3145. bool Parser::match_expression() const
  3146. {
  3147. auto type = m_state.current_token.type();
  3148. if (type == TokenType::Import) {
  3149. auto lookahead_token = next_token();
  3150. return lookahead_token.type() == TokenType::Period || lookahead_token.type() == TokenType::ParenOpen;
  3151. }
  3152. return type == TokenType::BoolLiteral
  3153. || type == TokenType::NumericLiteral
  3154. || type == TokenType::BigIntLiteral
  3155. || type == TokenType::StringLiteral
  3156. || type == TokenType::TemplateLiteralStart
  3157. || type == TokenType::NullLiteral
  3158. || match_identifier()
  3159. || type == TokenType::PrivateIdentifier
  3160. || type == TokenType::Await
  3161. || type == TokenType::New
  3162. || type == TokenType::Class
  3163. || type == TokenType::CurlyOpen
  3164. || type == TokenType::BracketOpen
  3165. || type == TokenType::ParenOpen
  3166. || type == TokenType::Function
  3167. || type == TokenType::Async
  3168. || type == TokenType::This
  3169. || type == TokenType::Super
  3170. || type == TokenType::RegexLiteral
  3171. || type == TokenType::Slash // Wrongly recognized regex by lexer
  3172. || type == TokenType::SlashEquals // Wrongly recognized regex by lexer (/=a/ is a valid regex)
  3173. || type == TokenType::Yield
  3174. || match_unary_prefixed_expression();
  3175. }
  3176. bool Parser::match_unary_prefixed_expression() const
  3177. {
  3178. auto type = m_state.current_token.type();
  3179. return type == TokenType::PlusPlus
  3180. || type == TokenType::MinusMinus
  3181. || type == TokenType::ExclamationMark
  3182. || type == TokenType::Tilde
  3183. || type == TokenType::Plus
  3184. || type == TokenType::Minus
  3185. || type == TokenType::Typeof
  3186. || type == TokenType::Void
  3187. || type == TokenType::Delete;
  3188. }
  3189. bool Parser::match_secondary_expression(ForbiddenTokens forbidden) const
  3190. {
  3191. auto type = m_state.current_token.type();
  3192. if (!forbidden.allows(type))
  3193. return false;
  3194. return type == TokenType::Plus
  3195. || type == TokenType::PlusEquals
  3196. || type == TokenType::Minus
  3197. || type == TokenType::MinusEquals
  3198. || type == TokenType::Asterisk
  3199. || type == TokenType::AsteriskEquals
  3200. || type == TokenType::Slash
  3201. || type == TokenType::SlashEquals
  3202. || type == TokenType::Percent
  3203. || type == TokenType::PercentEquals
  3204. || type == TokenType::DoubleAsterisk
  3205. || type == TokenType::DoubleAsteriskEquals
  3206. || type == TokenType::Equals
  3207. || type == TokenType::EqualsEqualsEquals
  3208. || type == TokenType::ExclamationMarkEqualsEquals
  3209. || type == TokenType::EqualsEquals
  3210. || type == TokenType::ExclamationMarkEquals
  3211. || type == TokenType::GreaterThan
  3212. || type == TokenType::GreaterThanEquals
  3213. || type == TokenType::LessThan
  3214. || type == TokenType::LessThanEquals
  3215. || type == TokenType::ParenOpen
  3216. || type == TokenType::Period
  3217. || type == TokenType::BracketOpen
  3218. || (type == TokenType::PlusPlus && !m_state.current_token.trivia_contains_line_terminator())
  3219. || (type == TokenType::MinusMinus && !m_state.current_token.trivia_contains_line_terminator())
  3220. || type == TokenType::In
  3221. || type == TokenType::Instanceof
  3222. || type == TokenType::QuestionMark
  3223. || type == TokenType::Ampersand
  3224. || type == TokenType::AmpersandEquals
  3225. || type == TokenType::Pipe
  3226. || type == TokenType::PipeEquals
  3227. || type == TokenType::Caret
  3228. || type == TokenType::CaretEquals
  3229. || type == TokenType::ShiftLeft
  3230. || type == TokenType::ShiftLeftEquals
  3231. || type == TokenType::ShiftRight
  3232. || type == TokenType::ShiftRightEquals
  3233. || type == TokenType::UnsignedShiftRight
  3234. || type == TokenType::UnsignedShiftRightEquals
  3235. || type == TokenType::DoubleAmpersand
  3236. || type == TokenType::DoubleAmpersandEquals
  3237. || type == TokenType::DoublePipe
  3238. || type == TokenType::DoublePipeEquals
  3239. || type == TokenType::DoubleQuestionMark
  3240. || type == TokenType::DoubleQuestionMarkEquals
  3241. || type == TokenType::QuestionMarkPeriod;
  3242. }
  3243. bool Parser::match_statement() const
  3244. {
  3245. auto type = m_state.current_token.type();
  3246. return match_expression()
  3247. || type == TokenType::Return
  3248. || type == TokenType::Yield
  3249. || type == TokenType::Do
  3250. || type == TokenType::If
  3251. || type == TokenType::Throw
  3252. || type == TokenType::Try
  3253. || type == TokenType::While
  3254. || type == TokenType::With
  3255. || type == TokenType::For
  3256. || type == TokenType::CurlyOpen
  3257. || type == TokenType::Switch
  3258. || type == TokenType::Break
  3259. || type == TokenType::Continue
  3260. || type == TokenType::Var
  3261. || type == TokenType::Debugger
  3262. || type == TokenType::Semicolon;
  3263. }
  3264. bool Parser::match_export_or_import() const
  3265. {
  3266. auto type = m_state.current_token.type();
  3267. return type == TokenType::Export
  3268. || type == TokenType::Import;
  3269. }
  3270. bool Parser::match_declaration() const
  3271. {
  3272. auto type = m_state.current_token.type();
  3273. if (type == TokenType::Let && !m_state.strict_mode) {
  3274. return try_match_let_declaration();
  3275. }
  3276. if (type == TokenType::Async) {
  3277. auto lookahead_token = next_token();
  3278. return lookahead_token.type() == TokenType::Function && !lookahead_token.trivia_contains_line_terminator();
  3279. }
  3280. return type == TokenType::Function
  3281. || type == TokenType::Class
  3282. || type == TokenType::Const
  3283. || type == TokenType::Let;
  3284. }
  3285. Token Parser::next_token(size_t steps) const
  3286. {
  3287. Lexer lookahead_lexer = m_state.lexer;
  3288. Token lookahead_token;
  3289. while (steps > 0) {
  3290. lookahead_token = lookahead_lexer.next();
  3291. steps--;
  3292. }
  3293. return lookahead_token;
  3294. }
  3295. bool Parser::try_match_let_declaration() const
  3296. {
  3297. VERIFY(m_state.current_token.type() == TokenType::Let);
  3298. auto token_after = next_token();
  3299. if (token_after.is_identifier_name() && token_after.value() != "in"sv)
  3300. return true;
  3301. if (token_after.type() == TokenType::CurlyOpen || token_after.type() == TokenType::BracketOpen)
  3302. return true;
  3303. return false;
  3304. }
  3305. bool Parser::match_variable_declaration() const
  3306. {
  3307. auto type = m_state.current_token.type();
  3308. if (type == TokenType::Let && !m_state.strict_mode) {
  3309. return try_match_let_declaration();
  3310. }
  3311. return type == TokenType::Var
  3312. || type == TokenType::Let
  3313. || type == TokenType::Const;
  3314. }
  3315. bool Parser::match_identifier() const
  3316. {
  3317. if (m_state.current_token.type() == TokenType::EscapedKeyword) {
  3318. if (m_state.current_token.value() == "let"sv)
  3319. return !m_state.strict_mode;
  3320. if (m_state.current_token.value() == "yield"sv)
  3321. return !m_state.strict_mode && !m_state.in_generator_function_context;
  3322. if (m_state.current_token.value() == "await"sv)
  3323. return m_program_type != Program::Type::Module && !m_state.await_expression_is_valid && !m_state.in_class_static_init_block;
  3324. return true;
  3325. }
  3326. return m_state.current_token.type() == TokenType::Identifier
  3327. || m_state.current_token.type() == TokenType::Async
  3328. || (m_state.current_token.type() == TokenType::Let && !m_state.strict_mode)
  3329. || (m_state.current_token.type() == TokenType::Await && m_program_type != Program::Type::Module && !m_state.await_expression_is_valid && !m_state.in_class_static_init_block)
  3330. || (m_state.current_token.type() == TokenType::Yield && !m_state.in_generator_function_context && !m_state.strict_mode); // See note in Parser::parse_identifier().
  3331. }
  3332. bool Parser::match_identifier_name() const
  3333. {
  3334. return m_state.current_token.is_identifier_name();
  3335. }
  3336. bool Parser::match_property_key() const
  3337. {
  3338. auto type = m_state.current_token.type();
  3339. return match_identifier_name()
  3340. || type == TokenType::BracketOpen
  3341. || type == TokenType::StringLiteral
  3342. || type == TokenType::NumericLiteral
  3343. || type == TokenType::BigIntLiteral;
  3344. }
  3345. bool Parser::done() const
  3346. {
  3347. return match(TokenType::Eof);
  3348. }
  3349. Token Parser::consume()
  3350. {
  3351. auto old_token = m_state.current_token;
  3352. m_state.current_token = m_state.lexer.next();
  3353. // NOTE: This is the bare minimum needed to decide whether we might need an arguments object
  3354. // in a function expression or declaration. ("might" because the AST implements some further
  3355. // conditions from the spec that rule out the need for allocating one)
  3356. if (old_token.type() == TokenType::Identifier && old_token.value().is_one_of("arguments"sv, "eval"sv))
  3357. m_state.function_might_need_arguments_object = true;
  3358. return old_token;
  3359. }
  3360. void Parser::consume_or_insert_semicolon()
  3361. {
  3362. // Semicolon was found and will be consumed
  3363. if (match(TokenType::Semicolon)) {
  3364. consume();
  3365. return;
  3366. }
  3367. // Insert semicolon if...
  3368. // ...token is preceded by one or more newlines
  3369. if (m_state.current_token.trivia_contains_line_terminator())
  3370. return;
  3371. // ...token is a closing curly brace
  3372. if (match(TokenType::CurlyClose))
  3373. return;
  3374. // ...token is eof
  3375. if (match(TokenType::Eof))
  3376. return;
  3377. // No rule for semicolon insertion applies -> syntax error
  3378. expected("Semicolon");
  3379. }
  3380. Token Parser::consume_identifier()
  3381. {
  3382. if (match(TokenType::Identifier))
  3383. return consume(TokenType::Identifier);
  3384. if (match(TokenType::EscapedKeyword))
  3385. return consume(TokenType::EscapedKeyword);
  3386. // Note that 'let' is not a reserved keyword, but our lexer considers it such
  3387. // As it's pretty nice to have that (for syntax highlighting and such), we'll
  3388. // special-case it here instead.
  3389. if (match(TokenType::Let)) {
  3390. if (m_state.strict_mode)
  3391. syntax_error("'let' is not allowed as an identifier in strict mode");
  3392. return consume();
  3393. }
  3394. if (match(TokenType::Yield)) {
  3395. if (m_state.strict_mode || m_state.in_generator_function_context)
  3396. syntax_error("Identifier must not be a reserved word in strict mode ('yield')");
  3397. return consume();
  3398. }
  3399. if (match(TokenType::Await)) {
  3400. if (m_program_type == Program::Type::Module || m_state.await_expression_is_valid || m_state.in_class_static_init_block)
  3401. syntax_error("Identifier must not be a reserved word in modules ('await')");
  3402. return consume();
  3403. }
  3404. if (match(TokenType::Async))
  3405. return consume();
  3406. expected("Identifier");
  3407. return consume();
  3408. }
  3409. // https://tc39.es/ecma262/#prod-IdentifierReference
  3410. Token Parser::consume_identifier_reference()
  3411. {
  3412. if (match(TokenType::Identifier))
  3413. return consume(TokenType::Identifier);
  3414. if (match(TokenType::EscapedKeyword)) {
  3415. auto name = m_state.current_token.value();
  3416. if (m_state.strict_mode && (name == "let"sv || name == "yield"sv))
  3417. syntax_error(String::formatted("'{}' is not allowed as an identifier in strict mode", name));
  3418. if (m_program_type == Program::Type::Module && name == "await"sv)
  3419. syntax_error("'await' is not allowed as an identifier in module");
  3420. return consume();
  3421. }
  3422. // See note in Parser::parse_identifier().
  3423. if (match(TokenType::Let)) {
  3424. if (m_state.strict_mode)
  3425. syntax_error("'let' is not allowed as an identifier in strict mode");
  3426. return consume();
  3427. }
  3428. if (match(TokenType::Yield)) {
  3429. if (m_state.strict_mode)
  3430. syntax_error("Identifier reference may not be 'yield' in strict mode");
  3431. return consume();
  3432. }
  3433. if (match(TokenType::Await)) {
  3434. if (m_program_type == Program::Type::Module)
  3435. syntax_error("'await' is not allowed as an identifier in module");
  3436. return consume();
  3437. }
  3438. if (match(TokenType::Async))
  3439. return consume();
  3440. expected(Token::name(TokenType::Identifier));
  3441. return consume();
  3442. }
  3443. Token Parser::consume(TokenType expected_type)
  3444. {
  3445. if (!match(expected_type)) {
  3446. expected(Token::name(expected_type));
  3447. }
  3448. auto token = consume();
  3449. if (expected_type == TokenType::Identifier) {
  3450. if (m_state.strict_mode && is_strict_reserved_word(token.value()))
  3451. syntax_error(String::formatted("Identifier must not be a reserved word in strict mode ('{}')", token.value()));
  3452. }
  3453. return token;
  3454. }
  3455. Token Parser::consume_and_validate_numeric_literal()
  3456. {
  3457. auto is_unprefixed_octal_number = [](StringView value) {
  3458. return value.length() > 1 && value[0] == '0' && is_ascii_digit(value[1]);
  3459. };
  3460. auto literal_start = position();
  3461. auto token = consume(TokenType::NumericLiteral);
  3462. if (m_state.strict_mode && is_unprefixed_octal_number(token.value()))
  3463. syntax_error("Unprefixed octal number not allowed in strict mode", literal_start);
  3464. if (match_identifier_name() && m_state.current_token.trivia().is_empty())
  3465. syntax_error("Numeric literal must not be immediately followed by identifier");
  3466. return token;
  3467. }
  3468. void Parser::expected(char const* what)
  3469. {
  3470. auto message = m_state.current_token.message();
  3471. if (message.is_empty())
  3472. message = String::formatted("Unexpected token {}. Expected {}", m_state.current_token.name(), what);
  3473. syntax_error(message);
  3474. }
  3475. Position Parser::position() const
  3476. {
  3477. return {
  3478. m_state.current_token.line_number(),
  3479. m_state.current_token.line_column(),
  3480. m_state.current_token.offset(),
  3481. };
  3482. }
  3483. bool Parser::try_parse_arrow_function_expression_failed_at_position(Position const& position) const
  3484. {
  3485. auto it = m_token_memoizations.find(position);
  3486. if (it == m_token_memoizations.end())
  3487. return false;
  3488. return (*it).value.try_parse_arrow_function_expression_failed;
  3489. }
  3490. void Parser::set_try_parse_arrow_function_expression_failed_at_position(Position const& position, bool failed)
  3491. {
  3492. m_token_memoizations.set(position, { failed });
  3493. }
  3494. void Parser::syntax_error(String const& message, Optional<Position> position)
  3495. {
  3496. if (!position.has_value())
  3497. position = this->position();
  3498. m_state.errors.append({ message, position });
  3499. }
  3500. void Parser::save_state()
  3501. {
  3502. m_saved_state.append(m_state);
  3503. }
  3504. void Parser::load_state()
  3505. {
  3506. VERIFY(!m_saved_state.is_empty());
  3507. m_state = m_saved_state.take_last();
  3508. }
  3509. void Parser::discard_saved_state()
  3510. {
  3511. m_saved_state.take_last();
  3512. }
  3513. void Parser::check_identifier_name_for_assignment_validity(FlyString const& name, bool force_strict)
  3514. {
  3515. // FIXME: this is now called from multiple places maybe the error message should be dynamic?
  3516. if (any_of(s_reserved_words, [&](auto& value) { return name == value; })) {
  3517. syntax_error("Binding pattern target may not be a reserved word");
  3518. } else if (m_state.strict_mode || force_strict) {
  3519. if (name.is_one_of("arguments"sv, "eval"sv))
  3520. syntax_error("Binding pattern target may not be called 'arguments' or 'eval' in strict mode");
  3521. else if (is_strict_reserved_word(name))
  3522. syntax_error(String::formatted("Binding pattern target may not be called '{}' in strict mode", name));
  3523. }
  3524. }
  3525. bool Parser::match_assert_clause() const
  3526. {
  3527. return !m_state.current_token.trivia_contains_line_terminator() && m_state.current_token.original_value() == "assert"sv;
  3528. }
  3529. FlyString Parser::consume_string_value()
  3530. {
  3531. VERIFY(match(TokenType::StringLiteral));
  3532. auto string_token = consume();
  3533. FlyString value = parse_string_literal(string_token)->value();
  3534. // This also checks IsStringWellFormedUnicode which makes sure there is no unpaired surrogate
  3535. // Surrogates are at least 3 bytes
  3536. if (value.length() < 3)
  3537. return value;
  3538. Utf8View view { value.view().substring_view(value.length() - 3) };
  3539. VERIFY(view.length() <= 3);
  3540. auto codepoint = *view.begin();
  3541. if (Utf16View::is_high_surrogate(codepoint)) {
  3542. syntax_error("StringValue ending with unpaired high surrogate");
  3543. VERIFY(view.length() == 1);
  3544. }
  3545. return value;
  3546. }
  3547. // AssertClause, https://tc39.es/proposal-import-assertions/#prod-AssertClause
  3548. ModuleRequest Parser::parse_module_request()
  3549. {
  3550. // Does not include the 'from' since that is not always required.
  3551. if (!match(TokenType::StringLiteral)) {
  3552. expected("ModuleSpecifier (string)");
  3553. return ModuleRequest { "!!invalid!!" };
  3554. }
  3555. ModuleRequest request { consume_string_value() };
  3556. if (!match_assert_clause())
  3557. return request;
  3558. VERIFY(m_state.current_token.original_value() == "assert"sv);
  3559. consume(TokenType::Identifier);
  3560. consume(TokenType::CurlyOpen);
  3561. while (!done() && !match(TokenType::CurlyClose)) {
  3562. String key;
  3563. if (match(TokenType::StringLiteral)) {
  3564. key = parse_string_literal(m_state.current_token)->value().to_string();
  3565. consume();
  3566. } else if (match_identifier_name()) {
  3567. key = consume().value();
  3568. } else {
  3569. expected("IdentifierName or StringValue as AssertionKey");
  3570. consume();
  3571. }
  3572. consume(TokenType::Colon);
  3573. if (match(TokenType::StringLiteral)) {
  3574. for (auto& entries : request.assertions) {
  3575. if (entries.key == key)
  3576. syntax_error(String::formatted("Duplicate assertion clauses with name: {}", key));
  3577. }
  3578. request.add_assertion(move(key), parse_string_literal(m_state.current_token)->value().to_string());
  3579. }
  3580. consume(TokenType::StringLiteral);
  3581. if (match(TokenType::Comma))
  3582. consume(TokenType::Comma);
  3583. else
  3584. break;
  3585. }
  3586. consume(TokenType::CurlyClose);
  3587. return request;
  3588. }
  3589. static FlyString default_string_value = "default";
  3590. NonnullRefPtr<ImportStatement> Parser::parse_import_statement(Program& program)
  3591. {
  3592. // We use the extended syntax which adds:
  3593. // ImportDeclaration:
  3594. // import ImportClause FromClause [no LineTerminator here] AssertClause;
  3595. // import ModuleSpecifier [no LineTerminator here] AssertClause;
  3596. // From: https://tc39.es/proposal-import-assertions/#prod-ImportDeclaration
  3597. auto rule_start = push_start();
  3598. if (program.type() != Program::Type::Module)
  3599. syntax_error("Cannot use import statement outside a module");
  3600. consume(TokenType::Import);
  3601. if (match(TokenType::StringLiteral)) {
  3602. // import ModuleSpecifier ;
  3603. auto module_request = parse_module_request();
  3604. return create_ast_node<ImportStatement>({ m_source_code, rule_start.position(), position() }, move(module_request));
  3605. }
  3606. auto match_imported_binding = [&] {
  3607. return match_identifier() || match(TokenType::Yield) || match(TokenType::Await);
  3608. };
  3609. auto match_as = [&] {
  3610. return match(TokenType::Identifier) && m_state.current_token.original_value() == "as"sv;
  3611. };
  3612. bool continue_parsing = true;
  3613. struct ImportWithLocation {
  3614. ImportEntry entry;
  3615. Position position;
  3616. };
  3617. Vector<ImportWithLocation> entries_with_location;
  3618. // import ImportClause FromClause ;
  3619. // ImportClause :
  3620. // ImportedDefaultBinding
  3621. // NameSpaceImport
  3622. // NamedImports
  3623. // ImportedDefaultBinding , NameSpaceImport
  3624. // ImportedDefaultBinding , NamedImports
  3625. if (match_imported_binding()) {
  3626. // ImportedDefaultBinding : ImportedBinding
  3627. auto id_position = position();
  3628. auto bound_name = consume().value();
  3629. entries_with_location.append({ { default_string_value, bound_name }, id_position });
  3630. if (match(TokenType::Comma)) {
  3631. consume(TokenType::Comma);
  3632. } else {
  3633. continue_parsing = false;
  3634. }
  3635. }
  3636. if (!continue_parsing) {
  3637. // skip the rest
  3638. } else if (match(TokenType::Asterisk)) {
  3639. // NameSpaceImport : * as ImportedBinding
  3640. consume(TokenType::Asterisk);
  3641. if (!match_as())
  3642. syntax_error(String::formatted("Unexpected token: {}", m_state.current_token.name()));
  3643. consume(TokenType::Identifier);
  3644. if (match_imported_binding()) {
  3645. auto namespace_position = position();
  3646. auto namespace_name = consume().value();
  3647. entries_with_location.append({ ImportEntry({}, namespace_name, true), namespace_position });
  3648. } else {
  3649. syntax_error(String::formatted("Unexpected token: {}", m_state.current_token.name()));
  3650. }
  3651. } else if (match(TokenType::CurlyOpen)) {
  3652. // NamedImports :
  3653. // { ImportSpecifier ,_opt } (repeated any amount of times)
  3654. consume(TokenType::CurlyOpen);
  3655. while (!done() && !match(TokenType::CurlyClose)) {
  3656. if (match_identifier_name()) {
  3657. // ImportSpecifier : ImportedBinding
  3658. auto require_as = !match_imported_binding();
  3659. auto name_position = position();
  3660. auto name = consume().flystring_value();
  3661. if (match_as()) {
  3662. consume(TokenType::Identifier);
  3663. auto alias_position = position();
  3664. auto alias = consume_identifier().flystring_value();
  3665. check_identifier_name_for_assignment_validity(alias);
  3666. entries_with_location.append({ { name, alias }, alias_position });
  3667. } else if (require_as) {
  3668. syntax_error(String::formatted("Unexpected reserved word '{}'", name));
  3669. } else {
  3670. check_identifier_name_for_assignment_validity(name);
  3671. entries_with_location.append({ { name, name }, name_position });
  3672. }
  3673. } else if (match(TokenType::StringLiteral)) {
  3674. // ImportSpecifier : ModuleExportName as ImportedBinding
  3675. auto name = consume_string_value();
  3676. if (!match_as())
  3677. expected("as");
  3678. consume(TokenType::Identifier);
  3679. auto alias_position = position();
  3680. auto alias = consume_identifier().flystring_value();
  3681. check_identifier_name_for_assignment_validity(alias);
  3682. entries_with_location.append({ { move(name), alias }, alias_position });
  3683. } else {
  3684. expected("identifier");
  3685. break;
  3686. }
  3687. if (!match(TokenType::Comma))
  3688. break;
  3689. consume(TokenType::Comma);
  3690. }
  3691. consume(TokenType::CurlyClose);
  3692. } else {
  3693. expected("import clauses");
  3694. }
  3695. auto from_statement = consume(TokenType::Identifier).original_value();
  3696. if (from_statement != "from"sv)
  3697. syntax_error(String::formatted("Expected 'from' got {}", from_statement));
  3698. auto module_request = parse_module_request();
  3699. Vector<ImportEntry> entries;
  3700. entries.ensure_capacity(entries_with_location.size());
  3701. for (auto& entry : entries_with_location) {
  3702. for (auto& import_statement : program.imports()) {
  3703. if (import_statement.has_bound_name(entry.entry.local_name))
  3704. syntax_error(String::formatted("Identifier '{}' already declared", entry.entry.local_name), entry.position);
  3705. }
  3706. for (auto& new_entry : entries) {
  3707. if (new_entry.local_name == entry.entry.local_name)
  3708. syntax_error(String::formatted("Identifier '{}' already declared", entry.entry.local_name), entry.position);
  3709. }
  3710. entries.append(move(entry.entry));
  3711. }
  3712. return create_ast_node<ImportStatement>({ m_source_code, rule_start.position(), position() }, move(module_request), move(entries));
  3713. }
  3714. NonnullRefPtr<ExportStatement> Parser::parse_export_statement(Program& program)
  3715. {
  3716. // We use the extended syntax which adds:
  3717. // ExportDeclaration:
  3718. // export ExportFromClause FromClause [no LineTerminator here] AssertClause ;
  3719. // From: https://tc39.es/proposal-import-assertions/#prod-ExportDeclaration
  3720. auto rule_start = push_start();
  3721. if (program.type() != Program::Type::Module)
  3722. syntax_error("Cannot use export statement outside a module");
  3723. auto match_as = [&] {
  3724. return match(TokenType::Identifier) && m_state.current_token.original_value() == "as"sv;
  3725. };
  3726. auto match_from = [&] {
  3727. return match(TokenType::Identifier) && m_state.current_token.original_value() == "from"sv;
  3728. };
  3729. auto match_default = [&] {
  3730. return match(TokenType::Default) && m_state.current_token.original_value() == "default"sv;
  3731. };
  3732. consume(TokenType::Export);
  3733. struct EntryAndLocation {
  3734. ExportEntry entry;
  3735. Position position;
  3736. };
  3737. Vector<EntryAndLocation> entries_with_location;
  3738. RefPtr<ASTNode> expression = {};
  3739. bool is_default = false;
  3740. ModuleRequest from_specifier;
  3741. if (match_default()) {
  3742. is_default = true;
  3743. auto default_position = position();
  3744. consume(TokenType::Default);
  3745. FlyString local_name;
  3746. auto lookahead_token = next_token();
  3747. enum class MatchesFunctionDeclaration {
  3748. Yes,
  3749. No,
  3750. WithoutName,
  3751. };
  3752. // Note: For some reason the spec here has declaration which can have no name
  3753. // and the rest of the parser is just not setup for that. With these
  3754. // hacks below we get through most things but we should probably figure
  3755. // out a better solution. I have attempted to explain why/what these "hacks" do below.
  3756. // The summary is treat named declarations just as declarations and hack around unnamed
  3757. // declarations with expression see also SourceTextModule::initialize_environment.
  3758. // As far as I'm aware the only problem (which is a tricky one) is:
  3759. // `export default function() {}()`
  3760. // Since we parse this as an expression you are immediately allowed to call it
  3761. // which is incorrect and this should give a SyntaxError.
  3762. auto has_name = [&](Token const& token) {
  3763. if (token.type() != TokenType::ParenOpen)
  3764. return MatchesFunctionDeclaration::Yes;
  3765. return MatchesFunctionDeclaration::WithoutName;
  3766. };
  3767. auto match_function_declaration = [&] {
  3768. // Hack part 1.
  3769. // Match a function declaration with a name, since we have async and generator
  3770. // and asyncgenerator variants this is quite complicated.
  3771. auto current_type = m_state.current_token.type();
  3772. Lexer lookahead_lexer = m_state.lexer;
  3773. lookahead_lexer.next();
  3774. if (current_type == TokenType::Function) {
  3775. if (lookahead_token.type() == TokenType::Asterisk)
  3776. return has_name(lookahead_lexer.next()); // function * [name]
  3777. else
  3778. return has_name(lookahead_token); // function [name]
  3779. }
  3780. if (current_type == TokenType::Async) {
  3781. if (lookahead_token.type() != TokenType::Function)
  3782. return MatchesFunctionDeclaration::No;
  3783. if (lookahead_token.trivia_contains_line_terminator())
  3784. return MatchesFunctionDeclaration::No;
  3785. auto lookahead_two_token = lookahead_lexer.next();
  3786. if (lookahead_two_token.type() == TokenType::Asterisk)
  3787. return has_name(lookahead_lexer.next()); // async function * [name]
  3788. else
  3789. return has_name(lookahead_two_token); // async function [name]
  3790. }
  3791. return MatchesFunctionDeclaration::No;
  3792. };
  3793. if (auto matches_function = match_function_declaration(); matches_function != MatchesFunctionDeclaration::No) {
  3794. auto function_declaration = parse_function_node<FunctionDeclaration>(
  3795. (matches_function == MatchesFunctionDeclaration::WithoutName ? FunctionNodeParseOptions::HasDefaultExportName : 0)
  3796. | FunctionNodeParseOptions::CheckForFunctionAndName);
  3797. m_state.current_scope_pusher->add_declaration(function_declaration);
  3798. if (matches_function == MatchesFunctionDeclaration::WithoutName)
  3799. local_name = ExportStatement::local_name_for_default;
  3800. else
  3801. local_name = function_declaration->name();
  3802. expression = move(function_declaration);
  3803. } else if (match(TokenType::Class) && lookahead_token.type() != TokenType::CurlyOpen && lookahead_token.type() != TokenType::Extends) {
  3804. // Hack part 2.
  3805. // Attempt to detect classes with names only as those are declarations,
  3806. // this actually seems to cover all cases already.
  3807. auto class_expression = parse_class_declaration();
  3808. m_state.current_scope_pusher->add_declaration(class_expression);
  3809. local_name = class_expression->name();
  3810. expression = move(class_expression);
  3811. } else if (match_expression()) {
  3812. // Hack part 3.
  3813. // Even though the unnamed declarations look like expression we should
  3814. // not treat them as such and thus not consume a semicolon after them.
  3815. bool special_case_declaration_without_name = match(TokenType::Class) || match(TokenType::Function) || (match(TokenType::Async) && lookahead_token.type() == TokenType::Function && !lookahead_token.trivia_contains_line_terminator());
  3816. expression = parse_expression(2);
  3817. if (!special_case_declaration_without_name)
  3818. consume_or_insert_semicolon();
  3819. if (is<ClassExpression>(*expression)) {
  3820. auto const& class_expression = static_cast<ClassExpression&>(*expression);
  3821. if (class_expression.has_name())
  3822. local_name = class_expression.name();
  3823. }
  3824. } else {
  3825. expected("Declaration or assignment expression");
  3826. local_name = "!!invalid!!";
  3827. }
  3828. if (local_name.is_null()) {
  3829. local_name = ExportStatement::local_name_for_default;
  3830. }
  3831. entries_with_location.append({ ExportEntry::named_export(default_string_value, move(local_name)), default_position });
  3832. } else {
  3833. enum class FromSpecifier {
  3834. NotAllowed,
  3835. Optional,
  3836. Required
  3837. } check_for_from { FromSpecifier::NotAllowed };
  3838. auto parse_module_export_name = [&](bool lhs) -> FlyString {
  3839. // https://tc39.es/ecma262/#prod-ModuleExportName
  3840. // ModuleExportName :
  3841. // IdentifierName
  3842. // StringLiteral
  3843. if (match_identifier_name()) {
  3844. return consume().value();
  3845. }
  3846. if (match(TokenType::StringLiteral)) {
  3847. // It is a Syntax Error if ReferencedBindings of NamedExports contains any StringLiterals.
  3848. // Only for export { "a" as "b" }; // <-- no from
  3849. if (lhs)
  3850. check_for_from = FromSpecifier::Required;
  3851. return consume_string_value();
  3852. }
  3853. expected("ExportSpecifier (string or identifier)");
  3854. return {};
  3855. };
  3856. if (match(TokenType::Asterisk)) {
  3857. auto asterisk_position = position();
  3858. consume(TokenType::Asterisk);
  3859. if (match_as()) {
  3860. // * as ModuleExportName
  3861. consume(TokenType::Identifier);
  3862. auto namespace_position = position();
  3863. auto exported_name = parse_module_export_name(false);
  3864. entries_with_location.append({ ExportEntry::all_module_request(exported_name), namespace_position });
  3865. } else {
  3866. entries_with_location.append({ ExportEntry::all_but_default_entry(), asterisk_position });
  3867. }
  3868. check_for_from = FromSpecifier::Required;
  3869. } else if (match_declaration()) {
  3870. auto decl_position = position();
  3871. auto declaration = parse_declaration();
  3872. m_state.current_scope_pusher->add_declaration(declaration);
  3873. if (is<FunctionDeclaration>(*declaration)) {
  3874. auto& func = static_cast<FunctionDeclaration&>(*declaration);
  3875. entries_with_location.append({ ExportEntry::named_export(func.name(), func.name()), func.source_range().start });
  3876. } else if (is<ClassDeclaration>(*declaration)) {
  3877. auto& class_declaration = static_cast<ClassDeclaration&>(*declaration);
  3878. entries_with_location.append({ ExportEntry::named_export(class_declaration.name(), class_declaration.name()), class_declaration.source_range().start });
  3879. } else {
  3880. VERIFY(is<VariableDeclaration>(*declaration));
  3881. auto& variables = static_cast<VariableDeclaration&>(*declaration);
  3882. VERIFY(variables.is_lexical_declaration());
  3883. for (auto& decl : variables.declarations()) {
  3884. decl.target().visit(
  3885. [&](NonnullRefPtr<Identifier> const& identifier) {
  3886. entries_with_location.append({ ExportEntry::named_export(identifier->string(), identifier->string()), identifier->source_range().start });
  3887. },
  3888. [&](NonnullRefPtr<BindingPattern> const& binding) {
  3889. binding->for_each_bound_name([&](auto& name) {
  3890. entries_with_location.append({ ExportEntry::named_export(name, name), decl_position });
  3891. });
  3892. });
  3893. }
  3894. }
  3895. expression = declaration;
  3896. } else if (match(TokenType::Var)) {
  3897. auto variable_position = position();
  3898. auto variable_declaration = parse_variable_declaration();
  3899. m_state.current_scope_pusher->add_declaration(variable_declaration);
  3900. for (auto& decl : variable_declaration->declarations()) {
  3901. decl.target().visit(
  3902. [&](NonnullRefPtr<Identifier> const& identifier) {
  3903. entries_with_location.append({ ExportEntry::named_export(identifier->string(), identifier->string()), identifier->source_range().start });
  3904. },
  3905. [&](NonnullRefPtr<BindingPattern> const& binding) {
  3906. binding->for_each_bound_name([&](auto& name) {
  3907. entries_with_location.append({ ExportEntry::named_export(name, name), variable_position });
  3908. });
  3909. });
  3910. }
  3911. expression = variable_declaration;
  3912. } else if (match(TokenType::CurlyOpen)) {
  3913. consume(TokenType::CurlyOpen);
  3914. check_for_from = FromSpecifier::Optional;
  3915. // FIXME: Even when empty should add module to requiredModules!
  3916. while (!done() && !match(TokenType::CurlyClose)) {
  3917. auto identifier_position = position();
  3918. auto identifier = parse_module_export_name(true);
  3919. if (match_as()) {
  3920. consume(TokenType::Identifier);
  3921. auto export_name = parse_module_export_name(false);
  3922. entries_with_location.append({ ExportEntry::named_export(move(export_name), move(identifier)), identifier_position });
  3923. } else {
  3924. entries_with_location.append({ ExportEntry::named_export(identifier, identifier), identifier_position });
  3925. }
  3926. if (!match(TokenType::Comma))
  3927. break;
  3928. consume(TokenType::Comma);
  3929. }
  3930. if (entries_with_location.is_empty()) {
  3931. // export {} from "module"; Since this will never be a
  3932. // duplicate we can give a slightly wrong location.
  3933. entries_with_location.append({ ExportEntry::empty_named_export(), position() });
  3934. }
  3935. consume(TokenType::CurlyClose);
  3936. } else {
  3937. syntax_error("Unexpected token 'export'", rule_start.position());
  3938. }
  3939. if (check_for_from != FromSpecifier::NotAllowed && match_from()) {
  3940. consume(TokenType::Identifier);
  3941. from_specifier = parse_module_request();
  3942. } else if (check_for_from == FromSpecifier::Required) {
  3943. expected("from");
  3944. }
  3945. if (check_for_from != FromSpecifier::NotAllowed)
  3946. consume_or_insert_semicolon();
  3947. }
  3948. Vector<ExportEntry> entries;
  3949. entries.ensure_capacity(entries_with_location.size());
  3950. for (auto& entry : entries_with_location) {
  3951. for (auto& export_statement : program.exports()) {
  3952. if (export_statement.has_export(entry.entry.export_name))
  3953. syntax_error(String::formatted("Duplicate export with name: '{}'", entry.entry.export_name), entry.position);
  3954. }
  3955. for (auto& new_entry : entries) {
  3956. if (new_entry.kind != ExportEntry::Kind::EmptyNamedExport && new_entry.export_name == entry.entry.export_name)
  3957. syntax_error(String::formatted("Duplicate export with name: '{}'", entry.entry.export_name), entry.position);
  3958. }
  3959. entries.append(move(entry.entry));
  3960. }
  3961. return create_ast_node<ExportStatement>({ m_source_code, rule_start.position(), position() }, move(expression), move(entries), is_default, move(from_specifier));
  3962. }
  3963. Parser::ForbiddenTokens::ForbiddenTokens(std::initializer_list<TokenType> const& forbidden)
  3964. {
  3965. forbid_tokens(forbidden);
  3966. }
  3967. void Parser::ForbiddenTokens::forbid_tokens(std::initializer_list<TokenType> const& forbidden)
  3968. {
  3969. for (auto token : forbidden) {
  3970. switch (token) {
  3971. case TokenType::In:
  3972. m_forbid_in_token = true;
  3973. break;
  3974. case TokenType::DoubleAmpersand:
  3975. case TokenType::DoublePipe:
  3976. m_forbid_logical_tokens = true;
  3977. break;
  3978. case TokenType::DoubleQuestionMark:
  3979. m_forbid_coalesce_token = true;
  3980. break;
  3981. case TokenType::QuestionMarkPeriod:
  3982. m_forbid_question_mark_period = true;
  3983. break;
  3984. case TokenType::ParenOpen:
  3985. m_forbid_paren_open = true;
  3986. break;
  3987. case TokenType::Equals:
  3988. m_forbid_equals = true;
  3989. break;
  3990. default:
  3991. VERIFY_NOT_REACHED();
  3992. }
  3993. }
  3994. }
  3995. bool Parser::ForbiddenTokens::allows(TokenType token) const
  3996. {
  3997. switch (token) {
  3998. case TokenType::In:
  3999. return !m_forbid_in_token;
  4000. case TokenType::DoubleAmpersand:
  4001. case TokenType::DoublePipe:
  4002. return !m_forbid_logical_tokens;
  4003. case TokenType::DoubleQuestionMark:
  4004. return !m_forbid_coalesce_token;
  4005. case TokenType::QuestionMarkPeriod:
  4006. return !m_forbid_question_mark_period;
  4007. case TokenType::ParenOpen:
  4008. return !m_forbid_paren_open;
  4009. case TokenType::Equals:
  4010. return !m_forbid_equals;
  4011. default:
  4012. return true;
  4013. }
  4014. }
  4015. Parser::ForbiddenTokens Parser::ForbiddenTokens::merge(ForbiddenTokens other) const
  4016. {
  4017. ForbiddenTokens result = *this;
  4018. result.m_forbid_in_token |= other.m_forbid_in_token;
  4019. result.m_forbid_logical_tokens |= other.m_forbid_logical_tokens;
  4020. result.m_forbid_coalesce_token |= other.m_forbid_coalesce_token;
  4021. result.m_forbid_paren_open |= other.m_forbid_paren_open;
  4022. result.m_forbid_question_mark_period |= other.m_forbid_question_mark_period;
  4023. result.m_forbid_equals |= other.m_forbid_equals;
  4024. return result;
  4025. }
  4026. Parser::ForbiddenTokens Parser::ForbiddenTokens::forbid(std::initializer_list<TokenType> const& forbidden) const
  4027. {
  4028. ForbiddenTokens result = *this;
  4029. result.forbid_tokens(forbidden);
  4030. return result;
  4031. }
  4032. template NonnullRefPtr<FunctionExpression> Parser::parse_function_node(u16, Optional<Position> const&);
  4033. template NonnullRefPtr<FunctionDeclaration> Parser::parse_function_node(u16, Optional<Position> const&);
  4034. }