Parser.cpp 201 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672
  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<FunctionDeclaration::Parameter> 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<FunctionDeclaration::Parameter> 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<FunctionDeclaration::Parameter>> 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. // It cannot be a labelled function since we hit a string literal.
  393. auto statement = parse_statement(AllowLabelledFunction::No);
  394. body.append(statement);
  395. VERIFY(is<ExpressionStatement>(*statement));
  396. auto& expression = static_cast<ExpressionStatement const&>(*statement).expression();
  397. if (!is<StringLiteral>(expression))
  398. break;
  399. auto& string_literal = static_cast<StringLiteral const&>(expression);
  400. if (string_literal.is_use_strict_directive()) {
  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->source_range().end = position();
  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 == ExportStatement::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<FunctionNode::Parameter> const& parameters)
  605. {
  606. return all_of(parameters, [](FunctionNode::Parameter 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<FunctionNode::Parameter> 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 { FunctionNode::Parameter { 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<FunctionNode::Parameter> {}, 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. return create_ast_node<ObjectExpression>(
  1567. { m_source_code, rule_start.position(), position() },
  1568. move(properties),
  1569. move(invalid_object_literal_property_range));
  1570. }
  1571. NonnullRefPtr<ArrayExpression> Parser::parse_array_expression()
  1572. {
  1573. auto rule_start = push_start();
  1574. consume(TokenType::BracketOpen);
  1575. Vector<RefPtr<Expression>> elements;
  1576. while (match_expression() || match(TokenType::TripleDot) || match(TokenType::Comma)) {
  1577. RefPtr<Expression> expression;
  1578. if (match(TokenType::TripleDot)) {
  1579. consume(TokenType::TripleDot);
  1580. expression = create_ast_node<SpreadExpression>({ m_source_code, rule_start.position(), position() }, parse_expression(2));
  1581. } else if (match_expression()) {
  1582. expression = parse_expression(2);
  1583. }
  1584. elements.append(expression);
  1585. if (!match(TokenType::Comma))
  1586. break;
  1587. consume(TokenType::Comma);
  1588. }
  1589. consume(TokenType::BracketClose);
  1590. return create_ast_node<ArrayExpression>({ m_source_code, rule_start.position(), position() }, move(elements));
  1591. }
  1592. NonnullRefPtr<StringLiteral> Parser::parse_string_literal(Token const& token, StringLiteralType string_literal_type, bool* contains_invalid_escape)
  1593. {
  1594. auto rule_start = push_start();
  1595. auto status = Token::StringValueStatus::Ok;
  1596. auto string = token.string_value(status);
  1597. // NOTE: Tagged templates should not fail on invalid strings as their raw contents can still be accessed.
  1598. if (status != Token::StringValueStatus::Ok) {
  1599. String message;
  1600. if (status == Token::StringValueStatus::LegacyOctalEscapeSequence) {
  1601. m_state.string_legacy_octal_escape_sequence_in_scope = true;
  1602. // It is a Syntax Error if the [Tagged] parameter was not set and Template{Head, Middle, Tail} Contains NotEscapeSequence.
  1603. if (string_literal_type != StringLiteralType::Normal)
  1604. message = "Octal escape sequence not allowed in template literal";
  1605. else if (m_state.strict_mode)
  1606. message = "Octal escape sequence in string literal not allowed in strict mode";
  1607. } else if (status == Token::StringValueStatus::MalformedHexEscape || status == Token::StringValueStatus::MalformedUnicodeEscape) {
  1608. auto type = status == Token::StringValueStatus::MalformedUnicodeEscape ? "unicode" : "hexadecimal";
  1609. message = String::formatted("Malformed {} escape sequence", type);
  1610. } else if (status == Token::StringValueStatus::UnicodeEscapeOverflow) {
  1611. message = "Unicode code_point must not be greater than 0x10ffff in escape sequence";
  1612. } else {
  1613. VERIFY_NOT_REACHED();
  1614. }
  1615. if (!message.is_empty()) {
  1616. if (contains_invalid_escape != nullptr) {
  1617. VERIFY(string_literal_type == StringLiteralType::TaggedTemplate);
  1618. *contains_invalid_escape = true;
  1619. } else {
  1620. syntax_error(message, Position { token.line_number(), token.line_column() });
  1621. }
  1622. }
  1623. }
  1624. auto is_use_strict_directive = string_literal_type == StringLiteralType::Normal && (token.value() == "'use strict'" || token.value() == "\"use strict\"");
  1625. return create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, string, is_use_strict_directive);
  1626. }
  1627. NonnullRefPtr<TemplateLiteral> Parser::parse_template_literal(bool is_tagged)
  1628. {
  1629. auto rule_start = push_start();
  1630. consume(TokenType::TemplateLiteralStart);
  1631. NonnullRefPtrVector<Expression> expressions;
  1632. NonnullRefPtrVector<Expression> raw_strings;
  1633. auto append_empty_string = [this, &rule_start, &expressions, &raw_strings, is_tagged]() {
  1634. auto string_literal = create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, "");
  1635. expressions.append(string_literal);
  1636. if (is_tagged)
  1637. raw_strings.append(string_literal);
  1638. };
  1639. if (!match(TokenType::TemplateLiteralString))
  1640. append_empty_string();
  1641. while (!done() && !match(TokenType::TemplateLiteralEnd) && !match(TokenType::UnterminatedTemplateLiteral)) {
  1642. if (match(TokenType::TemplateLiteralString)) {
  1643. auto token = consume();
  1644. bool contains_invalid_escape = false;
  1645. auto parsed_string_value = parse_string_literal(token,
  1646. is_tagged ? StringLiteralType::TaggedTemplate : StringLiteralType::NonTaggedTemplate,
  1647. is_tagged ? &contains_invalid_escape : nullptr);
  1648. // An invalid string leads to a cooked value of `undefined` but still gives the raw string.
  1649. if (contains_invalid_escape)
  1650. expressions.append(create_ast_node<NullLiteral>({ m_source_code, rule_start.position(), position() }));
  1651. else
  1652. expressions.append(move(parsed_string_value));
  1653. if (is_tagged)
  1654. raw_strings.append(create_ast_node<StringLiteral>({ m_source_code, rule_start.position(), position() }, token.raw_template_value()));
  1655. } else if (match(TokenType::TemplateLiteralExprStart)) {
  1656. consume(TokenType::TemplateLiteralExprStart);
  1657. if (match(TokenType::TemplateLiteralExprEnd)) {
  1658. syntax_error("Empty template literal expression block");
  1659. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1660. }
  1661. expressions.append(parse_expression(0));
  1662. if (match(TokenType::UnterminatedTemplateLiteral)) {
  1663. syntax_error("Unterminated template literal");
  1664. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1665. }
  1666. consume(TokenType::TemplateLiteralExprEnd);
  1667. if (!match(TokenType::TemplateLiteralString))
  1668. append_empty_string();
  1669. } else {
  1670. expected("Template literal string or expression");
  1671. break;
  1672. }
  1673. }
  1674. if (match(TokenType::UnterminatedTemplateLiteral)) {
  1675. syntax_error("Unterminated template literal");
  1676. } else {
  1677. consume(TokenType::TemplateLiteralEnd);
  1678. }
  1679. if (is_tagged)
  1680. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions, raw_strings);
  1681. return create_ast_node<TemplateLiteral>({ m_source_code, rule_start.position(), position() }, expressions);
  1682. }
  1683. NonnullRefPtr<Expression> Parser::parse_expression(int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1684. {
  1685. auto rule_start = push_start();
  1686. auto [expression, should_continue_parsing] = parse_primary_expression();
  1687. auto check_for_invalid_object_property = [&](auto& expression) {
  1688. if (is<ObjectExpression>(*expression)) {
  1689. if (auto range = static_cast<ObjectExpression&>(*expression).invalid_property_range(); range.has_value())
  1690. syntax_error("Invalid property in object literal", range->start);
  1691. }
  1692. };
  1693. if (is<Identifier>(*expression) && m_state.current_scope_pusher) {
  1694. auto identifier_instance = static_ptr_cast<Identifier>(expression);
  1695. auto function_scope = m_state.current_scope_pusher->last_function_scope();
  1696. auto function_parent_scope = function_scope ? function_scope->parent_scope() : nullptr;
  1697. bool has_not_been_declared_as_variable = true;
  1698. for (auto scope = m_state.current_scope_pusher; scope != function_parent_scope; scope = scope->parent_scope()) {
  1699. if (scope->has_declaration(identifier_instance->string())) {
  1700. has_not_been_declared_as_variable = false;
  1701. break;
  1702. }
  1703. }
  1704. if (has_not_been_declared_as_variable) {
  1705. if (identifier_instance->string() == "arguments"sv)
  1706. m_state.current_scope_pusher->set_contains_access_to_arguments_object();
  1707. }
  1708. }
  1709. while (match(TokenType::TemplateLiteralStart)) {
  1710. auto template_literal = parse_template_literal(true);
  1711. expression = create_ast_node<TaggedTemplateLiteral>({ m_source_code, rule_start.position(), position() }, move(expression), move(template_literal));
  1712. }
  1713. if (should_continue_parsing) {
  1714. while (match_secondary_expression(forbidden)) {
  1715. int new_precedence = g_operator_precedence.get(m_state.current_token.type());
  1716. if (new_precedence < min_precedence)
  1717. break;
  1718. if (new_precedence == min_precedence && associativity == Associativity::Left)
  1719. break;
  1720. check_for_invalid_object_property(expression);
  1721. Associativity new_associativity = operator_associativity(m_state.current_token.type());
  1722. auto result = parse_secondary_expression(move(expression), new_precedence, new_associativity, forbidden);
  1723. expression = result.expression;
  1724. forbidden = forbidden.merge(result.forbidden);
  1725. while (match(TokenType::TemplateLiteralStart) && !is<UpdateExpression>(*expression)) {
  1726. auto template_literal = parse_template_literal(true);
  1727. expression = create_ast_node<TaggedTemplateLiteral>({ m_source_code, rule_start.position(), position() }, move(expression), move(template_literal));
  1728. }
  1729. }
  1730. }
  1731. if (is<SuperExpression>(*expression))
  1732. syntax_error("'super' keyword unexpected here");
  1733. check_for_invalid_object_property(expression);
  1734. if (is<CallExpression>(*expression) && m_state.current_scope_pusher) {
  1735. auto& callee = static_ptr_cast<CallExpression>(expression)->callee();
  1736. if (is<Identifier>(callee)) {
  1737. auto& identifier_instance = static_cast<Identifier const&>(callee);
  1738. if (identifier_instance.string() == "eval"sv) {
  1739. bool has_not_been_declared_as_variable = true;
  1740. for (auto scope = m_state.current_scope_pusher; scope; scope = scope->parent_scope()) {
  1741. if (scope->has_declaration(identifier_instance.string())) {
  1742. has_not_been_declared_as_variable = false;
  1743. break;
  1744. }
  1745. }
  1746. if (has_not_been_declared_as_variable)
  1747. m_state.current_scope_pusher->set_contains_direct_call_to_eval();
  1748. }
  1749. }
  1750. }
  1751. if (match(TokenType::Comma) && min_precedence <= 1) {
  1752. NonnullRefPtrVector<Expression> expressions;
  1753. expressions.append(expression);
  1754. while (match(TokenType::Comma)) {
  1755. consume();
  1756. expressions.append(parse_expression(2));
  1757. }
  1758. expression = create_ast_node<SequenceExpression>({ m_source_code, rule_start.position(), position() }, move(expressions));
  1759. }
  1760. return expression;
  1761. }
  1762. Parser::ExpressionResult Parser::parse_secondary_expression(NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1763. {
  1764. auto rule_start = push_start();
  1765. switch (m_state.current_token.type()) {
  1766. case TokenType::Plus:
  1767. consume();
  1768. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Addition, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1769. case TokenType::PlusEquals:
  1770. return parse_assignment_expression(AssignmentOp::AdditionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1771. case TokenType::Minus:
  1772. consume();
  1773. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Subtraction, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1774. case TokenType::MinusEquals:
  1775. return parse_assignment_expression(AssignmentOp::SubtractionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1776. case TokenType::Asterisk:
  1777. consume();
  1778. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Multiplication, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1779. case TokenType::AsteriskEquals:
  1780. return parse_assignment_expression(AssignmentOp::MultiplicationAssignment, move(lhs), min_precedence, associativity, forbidden);
  1781. case TokenType::Slash:
  1782. consume();
  1783. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Division, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1784. case TokenType::SlashEquals:
  1785. return parse_assignment_expression(AssignmentOp::DivisionAssignment, move(lhs), min_precedence, associativity, forbidden);
  1786. case TokenType::Percent:
  1787. consume();
  1788. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Modulo, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1789. case TokenType::PercentEquals:
  1790. return parse_assignment_expression(AssignmentOp::ModuloAssignment, move(lhs), min_precedence, associativity, forbidden);
  1791. case TokenType::DoubleAsterisk:
  1792. consume();
  1793. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::Exponentiation, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1794. case TokenType::DoubleAsteriskEquals:
  1795. return parse_assignment_expression(AssignmentOp::ExponentiationAssignment, move(lhs), min_precedence, associativity, forbidden);
  1796. case TokenType::GreaterThan:
  1797. consume();
  1798. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::GreaterThan, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1799. case TokenType::GreaterThanEquals:
  1800. consume();
  1801. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::GreaterThanEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1802. case TokenType::LessThan:
  1803. consume();
  1804. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LessThan, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1805. case TokenType::LessThanEquals:
  1806. consume();
  1807. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LessThanEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1808. case TokenType::EqualsEqualsEquals:
  1809. consume();
  1810. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::StrictlyEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1811. case TokenType::ExclamationMarkEqualsEquals:
  1812. consume();
  1813. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::StrictlyInequals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1814. case TokenType::EqualsEquals:
  1815. consume();
  1816. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LooselyEquals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1817. case TokenType::ExclamationMarkEquals:
  1818. consume();
  1819. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LooselyInequals, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1820. case TokenType::In:
  1821. consume();
  1822. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::In, move(lhs), parse_expression(min_precedence, associativity));
  1823. case TokenType::Instanceof:
  1824. consume();
  1825. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::InstanceOf, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1826. case TokenType::Ampersand:
  1827. consume();
  1828. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseAnd, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1829. case TokenType::AmpersandEquals:
  1830. return parse_assignment_expression(AssignmentOp::BitwiseAndAssignment, move(lhs), min_precedence, associativity, forbidden);
  1831. case TokenType::Pipe:
  1832. consume();
  1833. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseOr, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1834. case TokenType::PipeEquals:
  1835. return parse_assignment_expression(AssignmentOp::BitwiseOrAssignment, move(lhs), min_precedence, associativity, forbidden);
  1836. case TokenType::Caret:
  1837. consume();
  1838. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::BitwiseXor, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1839. case TokenType::CaretEquals:
  1840. return parse_assignment_expression(AssignmentOp::BitwiseXorAssignment, move(lhs), min_precedence, associativity, forbidden);
  1841. case TokenType::ShiftLeft:
  1842. consume();
  1843. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::LeftShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1844. case TokenType::ShiftLeftEquals:
  1845. return parse_assignment_expression(AssignmentOp::LeftShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1846. case TokenType::ShiftRight:
  1847. consume();
  1848. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::RightShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1849. case TokenType::ShiftRightEquals:
  1850. return parse_assignment_expression(AssignmentOp::RightShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1851. case TokenType::UnsignedShiftRight:
  1852. consume();
  1853. return create_ast_node<BinaryExpression>({ m_source_code, rule_start.position(), position() }, BinaryOp::UnsignedRightShift, move(lhs), parse_expression(min_precedence, associativity, forbidden));
  1854. case TokenType::UnsignedShiftRightEquals:
  1855. return parse_assignment_expression(AssignmentOp::UnsignedRightShiftAssignment, move(lhs), min_precedence, associativity, forbidden);
  1856. case TokenType::ParenOpen:
  1857. return parse_call_expression(move(lhs));
  1858. case TokenType::Equals:
  1859. return parse_assignment_expression(AssignmentOp::Assignment, move(lhs), min_precedence, associativity, forbidden);
  1860. case TokenType::Period:
  1861. consume();
  1862. if (match(TokenType::PrivateIdentifier)) {
  1863. if (!is_private_identifier_valid())
  1864. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  1865. else if (is<SuperExpression>(*lhs))
  1866. syntax_error(String::formatted("Cannot access private field or method '{}' on super", m_state.current_token.value()));
  1867. 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()));
  1868. } else if (!match_identifier_name()) {
  1869. expected("IdentifierName");
  1870. }
  1871. 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()));
  1872. case TokenType::BracketOpen: {
  1873. consume(TokenType::BracketOpen);
  1874. auto expression = create_ast_node<MemberExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), parse_expression(0), true);
  1875. consume(TokenType::BracketClose);
  1876. return expression;
  1877. }
  1878. case TokenType::PlusPlus:
  1879. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1880. // other engines throw ReferenceError for foo()++
  1881. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs))
  1882. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  1883. if (m_state.strict_mode && is<Identifier>(*lhs)) {
  1884. auto& identifier = static_cast<Identifier&>(*lhs);
  1885. auto& name = identifier.string();
  1886. check_identifier_name_for_assignment_validity(name);
  1887. }
  1888. consume();
  1889. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Increment, move(lhs));
  1890. case TokenType::MinusMinus:
  1891. // FIXME: Apparently for functions this should also not be enforced on a parser level,
  1892. // other engines throw ReferenceError for foo()--
  1893. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs))
  1894. syntax_error(String::formatted("Left-hand side of postfix increment operator must be identifier or member expression, got {}", lhs->class_name()));
  1895. if (m_state.strict_mode && is<Identifier>(*lhs)) {
  1896. auto& identifier = static_cast<Identifier&>(*lhs);
  1897. auto& name = identifier.string();
  1898. check_identifier_name_for_assignment_validity(name);
  1899. }
  1900. consume();
  1901. return create_ast_node<UpdateExpression>({ m_source_code, rule_start.position(), position() }, UpdateOp::Decrement, move(lhs));
  1902. case TokenType::DoubleAmpersand: {
  1903. consume();
  1904. 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 })));
  1905. return { expression, { TokenType::DoubleQuestionMark } };
  1906. }
  1907. case TokenType::DoubleAmpersandEquals:
  1908. return parse_assignment_expression(AssignmentOp::AndAssignment, move(lhs), min_precedence, associativity, forbidden);
  1909. case TokenType::DoublePipe: {
  1910. consume();
  1911. 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 })));
  1912. return { expression, { TokenType::DoubleQuestionMark } };
  1913. }
  1914. case TokenType::DoublePipeEquals:
  1915. return parse_assignment_expression(AssignmentOp::OrAssignment, move(lhs), min_precedence, associativity, forbidden);
  1916. case TokenType::DoubleQuestionMark: {
  1917. consume();
  1918. 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 })));
  1919. return { expression, { TokenType::DoubleAmpersand, TokenType::DoublePipe } };
  1920. }
  1921. case TokenType::DoubleQuestionMarkEquals:
  1922. return parse_assignment_expression(AssignmentOp::NullishAssignment, move(lhs), min_precedence, associativity, forbidden);
  1923. case TokenType::QuestionMark:
  1924. return parse_conditional_expression(move(lhs), forbidden);
  1925. case TokenType::QuestionMarkPeriod:
  1926. // FIXME: This should allow `(new Foo)?.bar', but as our parser strips parenthesis,
  1927. // we can't really tell if `lhs' was parenthesized at this point.
  1928. if (is<NewExpression>(lhs.ptr())) {
  1929. syntax_error("'new' cannot be used with optional chaining", position());
  1930. consume();
  1931. return lhs;
  1932. }
  1933. return parse_optional_chain(move(lhs));
  1934. default:
  1935. expected("secondary expression");
  1936. consume();
  1937. return create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() });
  1938. }
  1939. }
  1940. bool Parser::is_private_identifier_valid() const
  1941. {
  1942. VERIFY(match(TokenType::PrivateIdentifier));
  1943. if (!m_state.referenced_private_names)
  1944. return false;
  1945. // We might not have hit the declaration yet so class will check this in the end
  1946. m_state.referenced_private_names->set(m_state.current_token.value());
  1947. return true;
  1948. }
  1949. RefPtr<BindingPattern> Parser::synthesize_binding_pattern(Expression const& expression)
  1950. {
  1951. VERIFY(is<ArrayExpression>(expression) || is<ObjectExpression>(expression));
  1952. // Clear any syntax error that has occurred in the range that 'expression' spans.
  1953. m_state.errors.remove_all_matching([range = expression.source_range()](auto const& error) {
  1954. return error.position.has_value() && range.contains(*error.position);
  1955. });
  1956. // Make a parser and parse the source for this expression as a binding pattern.
  1957. // NOTE: There's currently a fundamental problem that we pass the *next* (a.k.a. `current_token`)
  1958. // token's position to most nodes' SourceRange when using `rule_start.position(), position()`.
  1959. // This means that `source` will contain the subsequent token's trivia, if any (which is fine).
  1960. auto source_start_offset = expression.source_range().start.offset;
  1961. auto source_end_offset = expression.source_range().end.offset;
  1962. auto source = m_state.lexer.source().substring_view(source_start_offset, source_end_offset - source_start_offset);
  1963. Lexer lexer { source, m_state.lexer.filename(), expression.source_range().start.line, expression.source_range().start.column };
  1964. Parser parser { lexer };
  1965. parser.m_state.strict_mode = m_state.strict_mode;
  1966. parser.m_state.allow_super_property_lookup = m_state.allow_super_property_lookup;
  1967. parser.m_state.allow_super_constructor_call = m_state.allow_super_constructor_call;
  1968. parser.m_state.in_function_context = m_state.in_function_context;
  1969. parser.m_state.in_formal_parameter_context = m_state.in_formal_parameter_context;
  1970. parser.m_state.in_generator_function_context = m_state.in_generator_function_context;
  1971. parser.m_state.await_expression_is_valid = m_state.await_expression_is_valid;
  1972. parser.m_state.in_arrow_function_context = m_state.in_arrow_function_context;
  1973. parser.m_state.in_break_context = m_state.in_break_context;
  1974. parser.m_state.in_continue_context = m_state.in_continue_context;
  1975. parser.m_state.string_legacy_octal_escape_sequence_in_scope = m_state.string_legacy_octal_escape_sequence_in_scope;
  1976. parser.m_state.in_class_field_initializer = m_state.in_class_field_initializer;
  1977. parser.m_state.in_class_static_init_block = m_state.in_class_static_init_block;
  1978. parser.m_state.referenced_private_names = m_state.referenced_private_names;
  1979. auto result = parser.parse_binding_pattern(AllowDuplicates::Yes, AllowMemberExpressions::Yes);
  1980. if (parser.has_errors())
  1981. m_state.errors.extend(parser.errors());
  1982. return result;
  1983. }
  1984. NonnullRefPtr<AssignmentExpression> Parser::parse_assignment_expression(AssignmentOp assignment_op, NonnullRefPtr<Expression> lhs, int min_precedence, Associativity associativity, ForbiddenTokens forbidden)
  1985. {
  1986. auto rule_start = push_start();
  1987. VERIFY(match(TokenType::Equals)
  1988. || match(TokenType::PlusEquals)
  1989. || match(TokenType::MinusEquals)
  1990. || match(TokenType::AsteriskEquals)
  1991. || match(TokenType::SlashEquals)
  1992. || match(TokenType::PercentEquals)
  1993. || match(TokenType::DoubleAsteriskEquals)
  1994. || match(TokenType::AmpersandEquals)
  1995. || match(TokenType::PipeEquals)
  1996. || match(TokenType::CaretEquals)
  1997. || match(TokenType::ShiftLeftEquals)
  1998. || match(TokenType::ShiftRightEquals)
  1999. || match(TokenType::UnsignedShiftRightEquals)
  2000. || match(TokenType::DoubleAmpersandEquals)
  2001. || match(TokenType::DoublePipeEquals)
  2002. || match(TokenType::DoubleQuestionMarkEquals));
  2003. consume();
  2004. if (assignment_op == AssignmentOp::Assignment) {
  2005. if (is<ArrayExpression>(*lhs) || is<ObjectExpression>(*lhs)) {
  2006. auto binding_pattern = synthesize_binding_pattern(*lhs);
  2007. if (binding_pattern) {
  2008. auto rhs = parse_expression(min_precedence, associativity);
  2009. return create_ast_node<AssignmentExpression>(
  2010. { m_source_code, rule_start.position(), position() },
  2011. assignment_op,
  2012. binding_pattern.release_nonnull(),
  2013. move(rhs));
  2014. }
  2015. }
  2016. }
  2017. if (!is<Identifier>(*lhs) && !is<MemberExpression>(*lhs) && !is<CallExpression>(*lhs)) {
  2018. syntax_error("Invalid left-hand side in assignment");
  2019. } else if (m_state.strict_mode && is<Identifier>(*lhs)) {
  2020. auto const& name = static_cast<Identifier const&>(*lhs).string();
  2021. check_identifier_name_for_assignment_validity(name);
  2022. } else if (m_state.strict_mode && is<CallExpression>(*lhs)) {
  2023. syntax_error("Cannot assign to function call");
  2024. }
  2025. auto rhs = parse_expression(min_precedence, associativity, forbidden);
  2026. return create_ast_node<AssignmentExpression>({ m_source_code, rule_start.position(), position() }, assignment_op, move(lhs), move(rhs));
  2027. }
  2028. NonnullRefPtr<Identifier> Parser::parse_identifier()
  2029. {
  2030. auto identifier_start = position();
  2031. auto token = consume_identifier();
  2032. if (m_state.in_class_field_initializer && token.value() == "arguments"sv)
  2033. syntax_error("'arguments' is not allowed in class field initializer");
  2034. return create_ast_node<Identifier>(
  2035. { m_source_code, identifier_start, position() },
  2036. token.flystring_value());
  2037. }
  2038. Vector<CallExpression::Argument> Parser::parse_arguments()
  2039. {
  2040. Vector<CallExpression::Argument> arguments;
  2041. consume(TokenType::ParenOpen);
  2042. while (match_expression() || match(TokenType::TripleDot)) {
  2043. if (match(TokenType::TripleDot)) {
  2044. consume();
  2045. arguments.append({ parse_expression(2), true });
  2046. } else {
  2047. arguments.append({ parse_expression(2), false });
  2048. }
  2049. if (!match(TokenType::Comma))
  2050. break;
  2051. consume();
  2052. }
  2053. consume(TokenType::ParenClose);
  2054. return arguments;
  2055. }
  2056. NonnullRefPtr<Expression> Parser::parse_call_expression(NonnullRefPtr<Expression> lhs)
  2057. {
  2058. auto rule_start = push_start();
  2059. if (!m_state.allow_super_constructor_call && is<SuperExpression>(*lhs))
  2060. syntax_error("'super' keyword unexpected here");
  2061. auto arguments = parse_arguments();
  2062. if (is<SuperExpression>(*lhs))
  2063. return create_ast_node<SuperCall>({ m_source_code, rule_start.position(), position() }, move(arguments));
  2064. return create_ast_node<CallExpression>({ m_source_code, rule_start.position(), position() }, move(lhs), move(arguments));
  2065. }
  2066. NonnullRefPtr<NewExpression> Parser::parse_new_expression()
  2067. {
  2068. auto rule_start = push_start();
  2069. consume(TokenType::New);
  2070. auto callee = parse_expression(g_operator_precedence.get(TokenType::New), Associativity::Right, { TokenType::ParenOpen, TokenType::QuestionMarkPeriod });
  2071. if (is<ImportCall>(*callee))
  2072. syntax_error("Cannot call new on dynamic import", callee->source_range().start);
  2073. Vector<CallExpression::Argument> arguments;
  2074. if (match(TokenType::ParenOpen)) {
  2075. consume(TokenType::ParenOpen);
  2076. while (match_expression() || match(TokenType::TripleDot)) {
  2077. if (match(TokenType::TripleDot)) {
  2078. consume();
  2079. arguments.append({ parse_expression(2), true });
  2080. } else {
  2081. arguments.append({ parse_expression(2), false });
  2082. }
  2083. if (!match(TokenType::Comma))
  2084. break;
  2085. consume();
  2086. }
  2087. consume(TokenType::ParenClose);
  2088. }
  2089. return create_ast_node<NewExpression>({ m_source_code, rule_start.position(), position() }, move(callee), move(arguments));
  2090. }
  2091. NonnullRefPtr<YieldExpression> Parser::parse_yield_expression()
  2092. {
  2093. auto rule_start = push_start();
  2094. if (m_state.in_formal_parameter_context)
  2095. syntax_error("'Yield' expression is not allowed in formal parameters of generator function");
  2096. consume(TokenType::Yield);
  2097. RefPtr<Expression> argument;
  2098. bool yield_from = false;
  2099. if (!m_state.current_token.trivia_contains_line_terminator()) {
  2100. if (match(TokenType::Asterisk)) {
  2101. consume();
  2102. yield_from = true;
  2103. }
  2104. if (yield_from || match_expression() || match(TokenType::Class))
  2105. argument = parse_expression(2);
  2106. }
  2107. return create_ast_node<YieldExpression>({ m_source_code, rule_start.position(), position() }, move(argument), yield_from);
  2108. }
  2109. NonnullRefPtr<AwaitExpression> Parser::parse_await_expression()
  2110. {
  2111. auto rule_start = push_start();
  2112. if (m_state.in_formal_parameter_context)
  2113. syntax_error("'Await' expression is not allowed in formal parameters of an async function");
  2114. consume(TokenType::Await);
  2115. auto precedence = g_operator_precedence.get(TokenType::Await);
  2116. auto associativity = operator_associativity(TokenType::Await);
  2117. auto argument = parse_expression(precedence, associativity);
  2118. m_state.current_scope_pusher->set_contains_await_expression();
  2119. return create_ast_node<AwaitExpression>({ m_source_code, rule_start.position(), position() }, move(argument));
  2120. }
  2121. NonnullRefPtr<ReturnStatement> Parser::parse_return_statement()
  2122. {
  2123. auto rule_start = push_start();
  2124. if (!m_state.in_function_context && !m_state.in_arrow_function_context)
  2125. syntax_error("'return' not allowed outside of a function");
  2126. consume(TokenType::Return);
  2127. // Automatic semicolon insertion: terminate statement when return is followed by newline
  2128. if (m_state.current_token.trivia_contains_line_terminator())
  2129. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, nullptr);
  2130. if (match_expression()) {
  2131. auto expression = parse_expression(0);
  2132. consume_or_insert_semicolon();
  2133. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, move(expression));
  2134. }
  2135. consume_or_insert_semicolon();
  2136. return create_ast_node<ReturnStatement>({ m_source_code, rule_start.position(), position() }, nullptr);
  2137. }
  2138. void Parser::parse_statement_list(ScopeNode& output_node, AllowLabelledFunction allow_labelled_functions)
  2139. {
  2140. while (!done()) {
  2141. if (match_declaration()) {
  2142. auto declaration = parse_declaration();
  2143. VERIFY(m_state.current_scope_pusher);
  2144. m_state.current_scope_pusher->add_declaration(declaration);
  2145. output_node.append(move(declaration));
  2146. } else if (match_statement()) {
  2147. output_node.append(parse_statement(allow_labelled_functions));
  2148. } else {
  2149. break;
  2150. }
  2151. }
  2152. }
  2153. // FunctionBody, https://tc39.es/ecma262/#prod-FunctionBody
  2154. NonnullRefPtr<FunctionBody> Parser::parse_function_body(Vector<FunctionDeclaration::Parameter> const& parameters, FunctionKind function_kind, bool& contains_direct_call_to_eval)
  2155. {
  2156. auto rule_start = push_start();
  2157. auto function_body = create_ast_node<FunctionBody>({ m_source_code, rule_start.position(), position() });
  2158. ScopePusher function_scope = ScopePusher::function_scope(*this, function_body, parameters); // FIXME <-
  2159. auto has_use_strict = parse_directive(function_body);
  2160. bool previous_strict_mode = m_state.strict_mode;
  2161. if (has_use_strict) {
  2162. m_state.strict_mode = true;
  2163. function_body->set_strict_mode();
  2164. if (!is_simple_parameter_list(parameters))
  2165. syntax_error("Illegal 'use strict' directive in function with non-simple parameter list");
  2166. } else if (previous_strict_mode) {
  2167. function_body->set_strict_mode();
  2168. }
  2169. parse_statement_list(function_body);
  2170. // If we're parsing the function body standalone, e.g. via CreateDynamicFunction, we must have reached EOF here.
  2171. // Otherwise, we need a closing curly bracket (which is consumed elsewhere). If we get neither, it's an error.
  2172. if (!match(TokenType::Eof) && !match(TokenType::CurlyClose))
  2173. expected(Token::name(TokenType::CurlyClose));
  2174. // If the function contains 'use strict' we need to check the parameters (again).
  2175. if (function_body->in_strict_mode() || function_kind != FunctionKind::Normal) {
  2176. Vector<StringView> parameter_names;
  2177. for (auto& parameter : parameters) {
  2178. parameter.binding.visit(
  2179. [&](FlyString const& parameter_name) {
  2180. check_identifier_name_for_assignment_validity(parameter_name, function_body->in_strict_mode());
  2181. if (function_kind == FunctionKind::Generator && parameter_name == "yield"sv)
  2182. syntax_error("Parameter name 'yield' not allowed in this context");
  2183. if (function_kind == FunctionKind::Async && parameter_name == "await"sv)
  2184. syntax_error("Parameter name 'await' not allowed in this context");
  2185. for (auto& previous_name : parameter_names) {
  2186. if (previous_name == parameter_name) {
  2187. syntax_error(String::formatted("Duplicate parameter '{}' not allowed in strict mode", parameter_name));
  2188. }
  2189. }
  2190. parameter_names.append(parameter_name);
  2191. },
  2192. [&](NonnullRefPtr<BindingPattern> const& binding) {
  2193. binding->for_each_bound_name([&](auto& bound_name) {
  2194. if (function_kind == FunctionKind::Generator && bound_name == "yield"sv)
  2195. syntax_error("Parameter name 'yield' not allowed in this context");
  2196. if (function_kind == FunctionKind::Async && bound_name == "await"sv)
  2197. syntax_error("Parameter name 'await' not allowed in this context");
  2198. for (auto& previous_name : parameter_names) {
  2199. if (previous_name == bound_name) {
  2200. syntax_error(String::formatted("Duplicate parameter '{}' not allowed in strict mode", bound_name));
  2201. break;
  2202. }
  2203. }
  2204. parameter_names.append(bound_name);
  2205. });
  2206. });
  2207. }
  2208. }
  2209. m_state.strict_mode = previous_strict_mode;
  2210. contains_direct_call_to_eval = function_scope.contains_direct_call_to_eval();
  2211. return function_body;
  2212. }
  2213. NonnullRefPtr<BlockStatement> Parser::parse_block_statement()
  2214. {
  2215. auto rule_start = push_start();
  2216. auto block = create_ast_node<BlockStatement>({ m_source_code, rule_start.position(), position() });
  2217. ScopePusher block_scope = ScopePusher::block_scope(*this, block);
  2218. consume(TokenType::CurlyOpen);
  2219. parse_statement_list(block);
  2220. consume(TokenType::CurlyClose);
  2221. return block;
  2222. }
  2223. template<typename FunctionNodeType>
  2224. NonnullRefPtr<FunctionNodeType> Parser::parse_function_node(u16 parse_options, Optional<Position> const& function_start)
  2225. {
  2226. auto rule_start = function_start.has_value()
  2227. ? RulePosition { *this, *function_start }
  2228. : push_start();
  2229. VERIFY(!(parse_options & FunctionNodeParseOptions::IsGetterFunction && parse_options & FunctionNodeParseOptions::IsSetterFunction));
  2230. TemporaryChange super_property_access_rollback(m_state.allow_super_property_lookup, !!(parse_options & FunctionNodeParseOptions::AllowSuperPropertyLookup));
  2231. TemporaryChange super_constructor_call_rollback(m_state.allow_super_constructor_call, !!(parse_options & FunctionNodeParseOptions::AllowSuperConstructorCall));
  2232. TemporaryChange break_context_rollback(m_state.in_break_context, false);
  2233. TemporaryChange continue_context_rollback(m_state.in_continue_context, false);
  2234. TemporaryChange class_field_initializer_rollback(m_state.in_class_field_initializer, false);
  2235. TemporaryChange might_need_arguments_object_rollback(m_state.function_might_need_arguments_object, false);
  2236. constexpr auto is_function_expression = IsSame<FunctionNodeType, FunctionExpression>;
  2237. FunctionKind function_kind;
  2238. if ((parse_options & FunctionNodeParseOptions::IsGeneratorFunction) != 0 && (parse_options & FunctionNodeParseOptions::IsAsyncFunction) != 0)
  2239. function_kind = FunctionKind::AsyncGenerator;
  2240. else if ((parse_options & FunctionNodeParseOptions::IsGeneratorFunction) != 0)
  2241. function_kind = FunctionKind::Generator;
  2242. else if ((parse_options & FunctionNodeParseOptions::IsAsyncFunction) != 0)
  2243. function_kind = FunctionKind::Async;
  2244. else
  2245. function_kind = FunctionKind::Normal;
  2246. FlyString name;
  2247. if (parse_options & FunctionNodeParseOptions::CheckForFunctionAndName) {
  2248. if (function_kind == FunctionKind::Normal && match(TokenType::Async) && !next_token().trivia_contains_line_terminator()) {
  2249. function_kind = FunctionKind::Async;
  2250. consume(TokenType::Async);
  2251. parse_options |= FunctionNodeParseOptions::IsAsyncFunction;
  2252. }
  2253. consume(TokenType::Function);
  2254. if (match(TokenType::Asterisk)) {
  2255. function_kind = function_kind == FunctionKind::Normal ? FunctionKind::Generator : FunctionKind::AsyncGenerator;
  2256. consume(TokenType::Asterisk);
  2257. parse_options |= FunctionNodeParseOptions::IsGeneratorFunction;
  2258. }
  2259. if (parse_options & FunctionNodeParseOptions::HasDefaultExportName)
  2260. name = ExportStatement::local_name_for_default;
  2261. else if (FunctionNodeType::must_have_name() || match_identifier())
  2262. name = consume_identifier().flystring_value();
  2263. else if (is_function_expression && (match(TokenType::Yield) || match(TokenType::Await)))
  2264. name = consume().flystring_value();
  2265. check_identifier_name_for_assignment_validity(name);
  2266. if (function_kind == FunctionKind::AsyncGenerator && (name == "await"sv || name == "yield"sv))
  2267. syntax_error(String::formatted("async generator function is not allowed to be called '{}'", name));
  2268. if (m_state.in_class_static_init_block && name == "await"sv)
  2269. syntax_error("'await' is a reserved word");
  2270. }
  2271. TemporaryChange class_static_initializer_rollback(m_state.in_class_static_init_block, false);
  2272. TemporaryChange generator_change(m_state.in_generator_function_context, function_kind == FunctionKind::Generator || function_kind == FunctionKind::AsyncGenerator);
  2273. TemporaryChange async_change(m_state.await_expression_is_valid, function_kind == FunctionKind::Async || function_kind == FunctionKind::AsyncGenerator);
  2274. consume(TokenType::ParenOpen);
  2275. i32 function_length = -1;
  2276. auto parameters = parse_formal_parameters(function_length, parse_options);
  2277. consume(TokenType::ParenClose);
  2278. if (function_length == -1)
  2279. function_length = parameters.size();
  2280. TemporaryChange function_context_rollback(m_state.in_function_context, true);
  2281. auto old_labels_in_scope = move(m_state.labels_in_scope);
  2282. ScopeGuard guard([&]() {
  2283. m_state.labels_in_scope = move(old_labels_in_scope);
  2284. });
  2285. consume(TokenType::CurlyOpen);
  2286. bool contains_direct_call_to_eval = false;
  2287. auto body = parse_function_body(parameters, function_kind, contains_direct_call_to_eval);
  2288. consume(TokenType::CurlyClose);
  2289. auto has_strict_directive = body->in_strict_mode();
  2290. if (has_strict_directive)
  2291. check_identifier_name_for_assignment_validity(name, true);
  2292. auto function_start_offset = rule_start.position().offset;
  2293. auto function_end_offset = position().offset - m_state.current_token.trivia().length();
  2294. auto source_text = String { m_state.lexer.source().substring_view(function_start_offset, function_end_offset - function_start_offset) };
  2295. return create_ast_node<FunctionNodeType>(
  2296. { m_source_code, rule_start.position(), position() },
  2297. name, move(source_text), move(body), move(parameters), function_length,
  2298. function_kind, has_strict_directive, m_state.function_might_need_arguments_object,
  2299. contains_direct_call_to_eval);
  2300. }
  2301. Vector<FunctionNode::Parameter> Parser::parse_formal_parameters(int& function_length, u16 parse_options)
  2302. {
  2303. auto rule_start = push_start();
  2304. bool has_default_parameter = false;
  2305. bool has_rest_parameter = false;
  2306. TemporaryChange formal_parameter_context_change { m_state.in_formal_parameter_context, true };
  2307. Vector<FunctionNode::Parameter> parameters;
  2308. auto consume_identifier_or_binding_pattern = [&]() -> Variant<FlyString, NonnullRefPtr<BindingPattern>> {
  2309. if (auto pattern = parse_binding_pattern(AllowDuplicates::No, AllowMemberExpressions::No))
  2310. return pattern.release_nonnull();
  2311. auto token = consume_identifier();
  2312. auto parameter_name = token.flystring_value();
  2313. check_identifier_name_for_assignment_validity(parameter_name);
  2314. for (auto& parameter : parameters) {
  2315. bool has_same_name = parameter.binding.visit(
  2316. [&](FlyString const& name) {
  2317. return name == parameter_name;
  2318. },
  2319. [&](NonnullRefPtr<BindingPattern> const& bindings) {
  2320. bool found_duplicate = false;
  2321. bindings->for_each_bound_name([&](auto& bound_name) {
  2322. if (bound_name == parameter_name)
  2323. found_duplicate = true;
  2324. });
  2325. return found_duplicate;
  2326. });
  2327. if (!has_same_name)
  2328. continue;
  2329. String message;
  2330. if (parse_options & FunctionNodeParseOptions::IsArrowFunction)
  2331. message = String::formatted("Duplicate parameter '{}' not allowed in arrow function", parameter_name);
  2332. else if (m_state.strict_mode)
  2333. message = String::formatted("Duplicate parameter '{}' not allowed in strict mode", parameter_name);
  2334. else if (has_default_parameter || match(TokenType::Equals))
  2335. message = String::formatted("Duplicate parameter '{}' not allowed in function with default parameter", parameter_name);
  2336. else if (has_rest_parameter)
  2337. message = String::formatted("Duplicate parameter '{}' not allowed in function with rest parameter", parameter_name);
  2338. if (!message.is_empty())
  2339. syntax_error(message, Position { token.line_number(), token.line_column() });
  2340. break;
  2341. }
  2342. return FlyString { token.value() };
  2343. };
  2344. while (match(TokenType::CurlyOpen) || match(TokenType::BracketOpen) || match_identifier() || match(TokenType::TripleDot)) {
  2345. if (parse_options & FunctionNodeParseOptions::IsGetterFunction)
  2346. syntax_error("Getter function must have no arguments");
  2347. if (parse_options & FunctionNodeParseOptions::IsSetterFunction && (parameters.size() >= 1 || match(TokenType::TripleDot)))
  2348. syntax_error("Setter function must have one argument");
  2349. auto is_rest = false;
  2350. if (match(TokenType::TripleDot)) {
  2351. consume();
  2352. has_rest_parameter = true;
  2353. function_length = parameters.size();
  2354. is_rest = true;
  2355. }
  2356. auto parameter = consume_identifier_or_binding_pattern();
  2357. RefPtr<Expression> default_value;
  2358. if (match(TokenType::Equals)) {
  2359. consume();
  2360. if (is_rest)
  2361. syntax_error("Rest parameter may not have a default initializer");
  2362. TemporaryChange change(m_state.in_function_context, true);
  2363. has_default_parameter = true;
  2364. function_length = parameters.size();
  2365. default_value = parse_expression(2);
  2366. bool is_generator = parse_options & FunctionNodeParseOptions::IsGeneratorFunction;
  2367. if ((is_generator || m_state.strict_mode) && default_value && default_value->fast_is<Identifier>() && static_cast<Identifier&>(*default_value).string() == "yield"sv)
  2368. syntax_error("Generator function parameter initializer cannot contain a reference to an identifier named \"yield\"");
  2369. }
  2370. parameters.append({ move(parameter), default_value, is_rest });
  2371. if (!match(TokenType::Comma) || is_rest)
  2372. break;
  2373. consume(TokenType::Comma);
  2374. }
  2375. if (parse_options & FunctionNodeParseOptions::IsSetterFunction && parameters.is_empty())
  2376. syntax_error("Setter function must have one argument");
  2377. // If we're parsing the parameters standalone, e.g. via CreateDynamicFunction, we must have reached EOF here.
  2378. // Otherwise, we need a closing parenthesis (which is consumed elsewhere). If we get neither, it's an error.
  2379. if (!match(TokenType::Eof) && !match(TokenType::ParenClose))
  2380. expected(Token::name(TokenType::ParenClose));
  2381. return parameters;
  2382. }
  2383. 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" };
  2384. RefPtr<BindingPattern> Parser::parse_binding_pattern(Parser::AllowDuplicates allow_duplicates, Parser::AllowMemberExpressions allow_member_expressions)
  2385. {
  2386. auto rule_start = push_start();
  2387. TokenType closing_token;
  2388. bool is_object = true;
  2389. if (match(TokenType::BracketOpen)) {
  2390. consume();
  2391. closing_token = TokenType::BracketClose;
  2392. is_object = false;
  2393. } else if (match(TokenType::CurlyOpen)) {
  2394. consume();
  2395. closing_token = TokenType::CurlyClose;
  2396. } else {
  2397. return {};
  2398. }
  2399. Vector<BindingPattern::BindingEntry> entries;
  2400. while (!match(closing_token)) {
  2401. if (!is_object && match(TokenType::Comma)) {
  2402. consume();
  2403. entries.append(BindingPattern::BindingEntry {});
  2404. continue;
  2405. }
  2406. auto is_rest = false;
  2407. if (match(TokenType::TripleDot)) {
  2408. consume();
  2409. is_rest = true;
  2410. }
  2411. decltype(BindingPattern::BindingEntry::name) name = Empty {};
  2412. decltype(BindingPattern::BindingEntry::alias) alias = Empty {};
  2413. RefPtr<Expression> initializer = {};
  2414. if (is_object) {
  2415. bool needs_alias = false;
  2416. if (allow_member_expressions == AllowMemberExpressions::Yes && is_rest) {
  2417. auto expression_position = position();
  2418. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2419. if (is<MemberExpression>(*expression))
  2420. alias = static_ptr_cast<MemberExpression>(expression);
  2421. else if (is<Identifier>(*expression))
  2422. name = static_ptr_cast<Identifier>(expression);
  2423. else
  2424. syntax_error("Invalid destructuring assignment target", expression_position);
  2425. } else if (match_identifier_name() || match(TokenType::StringLiteral) || match(TokenType::NumericLiteral) || match(TokenType::BigIntLiteral)) {
  2426. if (match(TokenType::StringLiteral) || match(TokenType::NumericLiteral))
  2427. needs_alias = true;
  2428. if (match(TokenType::StringLiteral)) {
  2429. auto token = consume(TokenType::StringLiteral);
  2430. auto string_literal = parse_string_literal(token);
  2431. name = create_ast_node<Identifier>(
  2432. { m_source_code, rule_start.position(), position() },
  2433. string_literal->value());
  2434. } else if (match(TokenType::BigIntLiteral)) {
  2435. auto string_value = consume().flystring_value();
  2436. VERIFY(string_value.ends_with("n"sv));
  2437. name = create_ast_node<Identifier>(
  2438. { m_source_code, rule_start.position(), position() },
  2439. FlyString(string_value.view().substring_view(0, string_value.length() - 1)));
  2440. } else {
  2441. name = create_ast_node<Identifier>(
  2442. { m_source_code, rule_start.position(), position() },
  2443. consume().flystring_value());
  2444. }
  2445. } else if (match(TokenType::BracketOpen)) {
  2446. consume();
  2447. auto expression = parse_expression(0);
  2448. name = move(expression);
  2449. consume(TokenType::BracketClose);
  2450. } else {
  2451. expected("identifier or computed property name");
  2452. return {};
  2453. }
  2454. if (!is_rest && match(TokenType::Colon)) {
  2455. consume();
  2456. if (allow_member_expressions == AllowMemberExpressions::Yes) {
  2457. auto expression_position = position();
  2458. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2459. if (is<ArrayExpression>(*expression) || is<ObjectExpression>(*expression)) {
  2460. if (auto synthesized_binding_pattern = synthesize_binding_pattern(*expression))
  2461. alias = synthesized_binding_pattern.release_nonnull();
  2462. else
  2463. syntax_error("Invalid destructuring assignment target", expression_position);
  2464. } else if (is<MemberExpression>(*expression)) {
  2465. alias = static_ptr_cast<MemberExpression>(expression);
  2466. } else if (is<Identifier>(*expression)) {
  2467. alias = static_ptr_cast<Identifier>(expression);
  2468. } else {
  2469. syntax_error("Invalid destructuring assignment target", expression_position);
  2470. }
  2471. } else if (match(TokenType::CurlyOpen) || match(TokenType::BracketOpen)) {
  2472. auto binding_pattern = parse_binding_pattern(allow_duplicates, allow_member_expressions);
  2473. if (!binding_pattern)
  2474. return {};
  2475. alias = binding_pattern.release_nonnull();
  2476. } else if (match_identifier_name()) {
  2477. alias = create_ast_node<Identifier>(
  2478. { m_source_code, rule_start.position(), position() },
  2479. consume().flystring_value());
  2480. } else {
  2481. expected("identifier or binding pattern");
  2482. return {};
  2483. }
  2484. } else if (needs_alias) {
  2485. expected("alias for string or numeric literal name");
  2486. return {};
  2487. }
  2488. } else {
  2489. if (allow_member_expressions == AllowMemberExpressions::Yes) {
  2490. auto expression_position = position();
  2491. auto expression = parse_expression(2, Associativity::Right, { TokenType::Equals });
  2492. if (is<ArrayExpression>(*expression) || is<ObjectExpression>(*expression)) {
  2493. if (auto synthesized_binding_pattern = synthesize_binding_pattern(*expression))
  2494. alias = synthesized_binding_pattern.release_nonnull();
  2495. else
  2496. syntax_error("Invalid destructuring assignment target", expression_position);
  2497. } else if (is<MemberExpression>(*expression)) {
  2498. alias = static_ptr_cast<MemberExpression>(expression);
  2499. } else if (is<Identifier>(*expression)) {
  2500. alias = static_ptr_cast<Identifier>(expression);
  2501. } else {
  2502. syntax_error("Invalid destructuring assignment target", expression_position);
  2503. }
  2504. } else if (match(TokenType::BracketOpen) || match(TokenType::CurlyOpen)) {
  2505. auto pattern = parse_binding_pattern(allow_duplicates, allow_member_expressions);
  2506. if (!pattern) {
  2507. expected("binding pattern");
  2508. return {};
  2509. }
  2510. alias = pattern.release_nonnull();
  2511. } else if (match_identifier_name()) {
  2512. // BindingElement must always have an Empty name field
  2513. auto identifier_name = consume_identifier().flystring_value();
  2514. alias = create_ast_node<Identifier>(
  2515. { m_source_code, rule_start.position(), position() },
  2516. identifier_name);
  2517. } else {
  2518. expected("identifier or binding pattern");
  2519. return {};
  2520. }
  2521. }
  2522. if (match(TokenType::Equals)) {
  2523. if (is_rest) {
  2524. syntax_error("Unexpected initializer after rest element");
  2525. return {};
  2526. }
  2527. consume();
  2528. initializer = parse_expression(2);
  2529. if (!initializer) {
  2530. expected("initialization expression");
  2531. return {};
  2532. }
  2533. }
  2534. entries.append(BindingPattern::BindingEntry { move(name), move(alias), move(initializer), is_rest });
  2535. if (match(TokenType::Comma)) {
  2536. if (is_rest) {
  2537. syntax_error("Rest element may not be followed by a comma");
  2538. return {};
  2539. }
  2540. consume();
  2541. } else if (is_object && !match(TokenType::CurlyClose)) {
  2542. consume(TokenType::Comma);
  2543. }
  2544. }
  2545. while (!is_object && match(TokenType::Comma))
  2546. consume();
  2547. consume(closing_token);
  2548. auto kind = is_object ? BindingPattern::Kind::Object : BindingPattern::Kind::Array;
  2549. auto pattern = adopt_ref(*new BindingPattern);
  2550. pattern->entries = move(entries);
  2551. pattern->kind = kind;
  2552. Vector<StringView> bound_names;
  2553. pattern->for_each_bound_name([&](auto& name) {
  2554. if (allow_duplicates == AllowDuplicates::No) {
  2555. if (bound_names.contains_slow(name))
  2556. syntax_error("Duplicate parameter names in bindings");
  2557. bound_names.append(name);
  2558. }
  2559. check_identifier_name_for_assignment_validity(name);
  2560. });
  2561. return pattern;
  2562. }
  2563. NonnullRefPtr<VariableDeclaration> Parser::parse_variable_declaration(bool for_loop_variable_declaration)
  2564. {
  2565. auto rule_start = push_start();
  2566. DeclarationKind declaration_kind;
  2567. switch (m_state.current_token.type()) {
  2568. case TokenType::Var:
  2569. declaration_kind = DeclarationKind::Var;
  2570. break;
  2571. case TokenType::Let:
  2572. declaration_kind = DeclarationKind::Let;
  2573. break;
  2574. case TokenType::Const:
  2575. declaration_kind = DeclarationKind::Const;
  2576. break;
  2577. default:
  2578. VERIFY_NOT_REACHED();
  2579. }
  2580. consume();
  2581. NonnullRefPtrVector<VariableDeclarator> declarations;
  2582. for (;;) {
  2583. Variant<NonnullRefPtr<Identifier>, NonnullRefPtr<BindingPattern>, Empty> target {};
  2584. if (match_identifier()) {
  2585. auto identifier_start = push_start();
  2586. auto name = consume_identifier().flystring_value();
  2587. target = create_ast_node<Identifier>(
  2588. { m_source_code, rule_start.position(), position() },
  2589. name);
  2590. check_identifier_name_for_assignment_validity(name);
  2591. if ((declaration_kind == DeclarationKind::Let || declaration_kind == DeclarationKind::Const) && name == "let"sv)
  2592. syntax_error("Lexical binding may not be called 'let'");
  2593. } else if (auto pattern = parse_binding_pattern(declaration_kind != DeclarationKind::Var ? AllowDuplicates::No : AllowDuplicates::Yes, AllowMemberExpressions::No)) {
  2594. target = pattern.release_nonnull();
  2595. if ((declaration_kind == DeclarationKind::Let || declaration_kind == DeclarationKind::Const)) {
  2596. target.get<NonnullRefPtr<BindingPattern>>()->for_each_bound_name([this](auto& name) {
  2597. if (name == "let"sv)
  2598. syntax_error("Lexical binding may not be called 'let'");
  2599. });
  2600. }
  2601. } else if (!m_state.in_generator_function_context && match(TokenType::Yield)) {
  2602. if (m_state.strict_mode)
  2603. syntax_error("Identifier must not be a reserved word in strict mode ('yield')");
  2604. target = create_ast_node<Identifier>(
  2605. { m_source_code, rule_start.position(), position() },
  2606. consume().flystring_value());
  2607. } else if (!m_state.await_expression_is_valid && match(TokenType::Async)) {
  2608. if (m_program_type == Program::Type::Module)
  2609. syntax_error("Identifier must not be a reserved word in modules ('async')");
  2610. target = create_ast_node<Identifier>(
  2611. { m_source_code, rule_start.position(), position() },
  2612. consume().flystring_value());
  2613. }
  2614. if (target.has<Empty>()) {
  2615. expected("identifier or a binding pattern");
  2616. if (match(TokenType::Comma)) {
  2617. consume();
  2618. continue;
  2619. }
  2620. break;
  2621. }
  2622. RefPtr<Expression> init;
  2623. if (match(TokenType::Equals)) {
  2624. consume();
  2625. // In a for loop 'in' can be ambiguous so we do not allow it
  2626. // 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
  2627. if (for_loop_variable_declaration)
  2628. init = parse_expression(2, Associativity::Right, { TokenType::In });
  2629. else
  2630. init = parse_expression(2);
  2631. } else if (!for_loop_variable_declaration && declaration_kind == DeclarationKind::Const) {
  2632. syntax_error("Missing initializer in 'const' variable declaration");
  2633. } else if (!for_loop_variable_declaration && target.has<NonnullRefPtr<BindingPattern>>()) {
  2634. syntax_error("Missing initializer in destructuring assignment");
  2635. }
  2636. declarations.append(create_ast_node<VariableDeclarator>(
  2637. { m_source_code, rule_start.position(), position() },
  2638. move(target).downcast<NonnullRefPtr<Identifier>, NonnullRefPtr<BindingPattern>>(),
  2639. move(init)));
  2640. if (match(TokenType::Comma)) {
  2641. consume();
  2642. continue;
  2643. }
  2644. break;
  2645. }
  2646. if (!for_loop_variable_declaration)
  2647. consume_or_insert_semicolon();
  2648. auto declaration = create_ast_node<VariableDeclaration>({ m_source_code, rule_start.position(), position() }, declaration_kind, move(declarations));
  2649. return declaration;
  2650. }
  2651. NonnullRefPtr<ThrowStatement> Parser::parse_throw_statement()
  2652. {
  2653. auto rule_start = push_start();
  2654. consume(TokenType::Throw);
  2655. // Automatic semicolon insertion: terminate statement when throw is followed by newline
  2656. if (m_state.current_token.trivia_contains_line_terminator()) {
  2657. syntax_error("No line break is allowed between 'throw' and its expression");
  2658. return create_ast_node<ThrowStatement>({ m_source_code, rule_start.position(), position() }, create_ast_node<ErrorExpression>({ m_source_code, rule_start.position(), position() }));
  2659. }
  2660. auto expression = parse_expression(0);
  2661. consume_or_insert_semicolon();
  2662. return create_ast_node<ThrowStatement>({ m_source_code, rule_start.position(), position() }, move(expression));
  2663. }
  2664. NonnullRefPtr<BreakStatement> Parser::parse_break_statement()
  2665. {
  2666. auto rule_start = push_start();
  2667. consume(TokenType::Break);
  2668. FlyString target_label;
  2669. if (match(TokenType::Semicolon)) {
  2670. consume();
  2671. } else {
  2672. if (!m_state.current_token.trivia_contains_line_terminator() && match_identifier()) {
  2673. target_label = consume().value();
  2674. auto label = m_state.labels_in_scope.find(target_label);
  2675. if (label == m_state.labels_in_scope.end())
  2676. syntax_error(String::formatted("Label '{}' not found", target_label));
  2677. }
  2678. consume_or_insert_semicolon();
  2679. }
  2680. if (target_label.is_null() && !m_state.in_break_context)
  2681. syntax_error("Unlabeled 'break' not allowed outside of a loop or switch statement");
  2682. return create_ast_node<BreakStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2683. }
  2684. NonnullRefPtr<ContinueStatement> Parser::parse_continue_statement()
  2685. {
  2686. auto rule_start = push_start();
  2687. if (!m_state.in_continue_context)
  2688. syntax_error("'continue' not allow outside of a loop");
  2689. consume(TokenType::Continue);
  2690. FlyString target_label;
  2691. if (match(TokenType::Semicolon)) {
  2692. consume();
  2693. return create_ast_node<ContinueStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2694. }
  2695. if (!m_state.current_token.trivia_contains_line_terminator() && match_identifier()) {
  2696. auto label_position = position();
  2697. target_label = consume().value();
  2698. auto label = m_state.labels_in_scope.find(target_label);
  2699. if (label == m_state.labels_in_scope.end())
  2700. syntax_error(String::formatted("Label '{}' not found or invalid", target_label));
  2701. else
  2702. label->value = label_position;
  2703. }
  2704. consume_or_insert_semicolon();
  2705. return create_ast_node<ContinueStatement>({ m_source_code, rule_start.position(), position() }, target_label);
  2706. }
  2707. NonnullRefPtr<ConditionalExpression> Parser::parse_conditional_expression(NonnullRefPtr<Expression> test, ForbiddenTokens forbidden)
  2708. {
  2709. auto rule_start = push_start();
  2710. consume(TokenType::QuestionMark);
  2711. auto consequent = parse_expression(2);
  2712. consume(TokenType::Colon);
  2713. auto alternate = parse_expression(2, Associativity::Right, forbidden);
  2714. return create_ast_node<ConditionalExpression>({ m_source_code, rule_start.position(), position() }, move(test), move(consequent), move(alternate));
  2715. }
  2716. NonnullRefPtr<OptionalChain> Parser::parse_optional_chain(NonnullRefPtr<Expression> base)
  2717. {
  2718. auto rule_start = push_start();
  2719. Vector<OptionalChain::Reference> chain;
  2720. do {
  2721. if (match(TokenType::QuestionMarkPeriod)) {
  2722. consume(TokenType::QuestionMarkPeriod);
  2723. switch (m_state.current_token.type()) {
  2724. case TokenType::ParenOpen:
  2725. chain.append(OptionalChain::Call { parse_arguments(), OptionalChain::Mode::Optional });
  2726. break;
  2727. case TokenType::BracketOpen:
  2728. consume();
  2729. chain.append(OptionalChain::ComputedReference { parse_expression(0), OptionalChain::Mode::Optional });
  2730. consume(TokenType::BracketClose);
  2731. break;
  2732. case TokenType::PrivateIdentifier: {
  2733. if (!is_private_identifier_valid())
  2734. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  2735. auto start = position();
  2736. auto private_identifier = consume();
  2737. chain.append(OptionalChain::PrivateMemberReference {
  2738. create_ast_node<PrivateIdentifier>({ m_source_code, start, position() }, private_identifier.value()),
  2739. OptionalChain::Mode::Optional });
  2740. break;
  2741. }
  2742. case TokenType::TemplateLiteralStart:
  2743. // 13.3.1.1 - Static Semantics: Early Errors
  2744. // OptionalChain :
  2745. // ?. TemplateLiteral
  2746. // OptionalChain TemplateLiteral
  2747. // This is a hard error.
  2748. syntax_error("Invalid tagged template literal after ?.", position());
  2749. break;
  2750. default:
  2751. if (match_identifier_name()) {
  2752. auto start = position();
  2753. auto identifier = consume();
  2754. chain.append(OptionalChain::MemberReference {
  2755. create_ast_node<Identifier>({ m_source_code, start, position() }, identifier.flystring_value()),
  2756. OptionalChain::Mode::Optional,
  2757. });
  2758. } else {
  2759. syntax_error("Invalid optional chain reference after ?.", position());
  2760. }
  2761. break;
  2762. }
  2763. } else if (match(TokenType::ParenOpen)) {
  2764. chain.append(OptionalChain::Call { parse_arguments(), OptionalChain::Mode::NotOptional });
  2765. } else if (match(TokenType::Period)) {
  2766. consume();
  2767. if (match(TokenType::PrivateIdentifier)) {
  2768. if (!is_private_identifier_valid())
  2769. syntax_error(String::formatted("Reference to undeclared private field or method '{}'", m_state.current_token.value()));
  2770. auto start = position();
  2771. auto private_identifier = consume();
  2772. chain.append(OptionalChain::PrivateMemberReference {
  2773. create_ast_node<PrivateIdentifier>({ m_source_code, start, position() }, private_identifier.value()),
  2774. OptionalChain::Mode::NotOptional,
  2775. });
  2776. } else if (match_identifier_name()) {
  2777. auto start = position();
  2778. auto identifier = consume();
  2779. chain.append(OptionalChain::MemberReference {
  2780. create_ast_node<Identifier>({ m_source_code, start, position() }, identifier.flystring_value()),
  2781. OptionalChain::Mode::NotOptional,
  2782. });
  2783. } else {
  2784. expected("an identifier");
  2785. break;
  2786. }
  2787. } else if (match(TokenType::TemplateLiteralStart)) {
  2788. // 13.3.1.1 - Static Semantics: Early Errors
  2789. // OptionalChain :
  2790. // ?. TemplateLiteral
  2791. // OptionalChain TemplateLiteral
  2792. syntax_error("Invalid tagged template literal after optional chain", position());
  2793. break;
  2794. } else if (match(TokenType::BracketOpen)) {
  2795. consume();
  2796. chain.append(OptionalChain::ComputedReference { parse_expression(2), OptionalChain::Mode::NotOptional });
  2797. consume(TokenType::BracketClose);
  2798. } else {
  2799. break;
  2800. }
  2801. } while (!done());
  2802. return create_ast_node<OptionalChain>(
  2803. { m_source_code, rule_start.position(), position() },
  2804. move(base),
  2805. move(chain));
  2806. }
  2807. NonnullRefPtr<TryStatement> Parser::parse_try_statement()
  2808. {
  2809. auto rule_start = push_start();
  2810. consume(TokenType::Try);
  2811. auto block = parse_block_statement();
  2812. RefPtr<CatchClause> handler;
  2813. if (match(TokenType::Catch))
  2814. handler = parse_catch_clause();
  2815. RefPtr<BlockStatement> finalizer;
  2816. if (match(TokenType::Finally)) {
  2817. consume();
  2818. finalizer = parse_block_statement();
  2819. }
  2820. if (!handler && !finalizer)
  2821. syntax_error("try statement must have a 'catch' or 'finally' clause");
  2822. return create_ast_node<TryStatement>({ m_source_code, rule_start.position(), position() }, move(block), move(handler), move(finalizer));
  2823. }
  2824. NonnullRefPtr<DoWhileStatement> Parser::parse_do_while_statement()
  2825. {
  2826. auto rule_start = push_start();
  2827. consume(TokenType::Do);
  2828. auto body = [&]() -> NonnullRefPtr<Statement> {
  2829. TemporaryChange break_change(m_state.in_break_context, true);
  2830. TemporaryChange continue_change(m_state.in_continue_context, true);
  2831. return parse_statement();
  2832. }();
  2833. consume(TokenType::While);
  2834. consume(TokenType::ParenOpen);
  2835. auto test = parse_expression(0);
  2836. consume(TokenType::ParenClose);
  2837. // Since ES 2015 a missing semicolon is inserted here, despite the regular ASI rules not applying
  2838. if (match(TokenType::Semicolon))
  2839. consume();
  2840. return create_ast_node<DoWhileStatement>({ m_source_code, rule_start.position(), position() }, move(test), move(body));
  2841. }
  2842. NonnullRefPtr<WhileStatement> Parser::parse_while_statement()
  2843. {
  2844. auto rule_start = push_start();
  2845. consume(TokenType::While);
  2846. consume(TokenType::ParenOpen);
  2847. auto test = parse_expression(0);
  2848. consume(TokenType::ParenClose);
  2849. TemporaryChange break_change(m_state.in_break_context, true);
  2850. TemporaryChange continue_change(m_state.in_continue_context, true);
  2851. auto body = parse_statement();
  2852. return create_ast_node<WhileStatement>({ m_source_code, rule_start.position(), position() }, move(test), move(body));
  2853. }
  2854. NonnullRefPtr<SwitchStatement> Parser::parse_switch_statement()
  2855. {
  2856. auto rule_start = push_start();
  2857. consume(TokenType::Switch);
  2858. consume(TokenType::ParenOpen);
  2859. auto determinant = parse_expression(0);
  2860. consume(TokenType::ParenClose);
  2861. consume(TokenType::CurlyOpen);
  2862. NonnullRefPtrVector<SwitchCase> cases;
  2863. auto switch_statement = create_ast_node<SwitchStatement>({ m_source_code, rule_start.position(), position() }, move(determinant));
  2864. ScopePusher switch_scope = ScopePusher::block_scope(*this, switch_statement);
  2865. auto has_default = false;
  2866. while (match(TokenType::Case) || match(TokenType::Default)) {
  2867. if (match(TokenType::Default)) {
  2868. if (has_default)
  2869. syntax_error("Multiple 'default' clauses in switch statement");
  2870. has_default = true;
  2871. }
  2872. switch_statement->add_case(parse_switch_case());
  2873. }
  2874. consume(TokenType::CurlyClose);
  2875. return switch_statement;
  2876. }
  2877. NonnullRefPtr<WithStatement> Parser::parse_with_statement()
  2878. {
  2879. auto rule_start = push_start();
  2880. consume(TokenType::With);
  2881. consume(TokenType::ParenOpen);
  2882. auto object = parse_expression(0);
  2883. consume(TokenType::ParenClose);
  2884. auto body = parse_statement();
  2885. return create_ast_node<WithStatement>({ m_source_code, rule_start.position(), position() }, move(object), move(body));
  2886. }
  2887. NonnullRefPtr<SwitchCase> Parser::parse_switch_case()
  2888. {
  2889. auto rule_start = push_start();
  2890. RefPtr<Expression> test;
  2891. if (consume().type() == TokenType::Case) {
  2892. test = parse_expression(0);
  2893. }
  2894. consume(TokenType::Colon);
  2895. NonnullRefPtrVector<Statement> consequent;
  2896. TemporaryChange break_change(m_state.in_break_context, true);
  2897. auto switch_case = create_ast_node<SwitchCase>({ m_source_code, rule_start.position(), position() }, move(test));
  2898. parse_statement_list(switch_case);
  2899. return switch_case;
  2900. }
  2901. NonnullRefPtr<CatchClause> Parser::parse_catch_clause()
  2902. {
  2903. auto rule_start = push_start();
  2904. consume(TokenType::Catch);
  2905. FlyString parameter;
  2906. RefPtr<BindingPattern> pattern_parameter;
  2907. auto should_expect_parameter = false;
  2908. if (match(TokenType::ParenOpen)) {
  2909. should_expect_parameter = true;
  2910. consume();
  2911. if (match_identifier_name()
  2912. && (!match(TokenType::Yield) || !m_state.in_generator_function_context)
  2913. && (!match(TokenType::Async) || !m_state.await_expression_is_valid)
  2914. && (!match(TokenType::Await) || !m_state.in_class_static_init_block))
  2915. parameter = consume().value();
  2916. else
  2917. pattern_parameter = parse_binding_pattern(AllowDuplicates::No, AllowMemberExpressions::No);
  2918. consume(TokenType::ParenClose);
  2919. }
  2920. if (should_expect_parameter && parameter.is_empty() && !pattern_parameter)
  2921. expected("an identifier or a binding pattern");
  2922. HashTable<FlyString> bound_names;
  2923. if (pattern_parameter) {
  2924. pattern_parameter->for_each_bound_name(
  2925. [&](auto& name) {
  2926. check_identifier_name_for_assignment_validity(name);
  2927. bound_names.set(name);
  2928. });
  2929. }
  2930. if (!parameter.is_empty()) {
  2931. check_identifier_name_for_assignment_validity(parameter);
  2932. bound_names.set(parameter);
  2933. }
  2934. ScopePusher catch_scope = ScopePusher::catch_scope(*this, pattern_parameter, parameter);
  2935. auto body = parse_block_statement();
  2936. body->for_each_lexically_declared_name([&](auto const& name) {
  2937. if (bound_names.contains(name))
  2938. syntax_error(String::formatted("Identifier '{}' already declared as catch parameter", name));
  2939. });
  2940. if (pattern_parameter) {
  2941. return create_ast_node<CatchClause>(
  2942. { m_source_code, rule_start.position(), position() },
  2943. pattern_parameter.release_nonnull(),
  2944. move(body));
  2945. }
  2946. return create_ast_node<CatchClause>(
  2947. { m_source_code, rule_start.position(), position() },
  2948. move(parameter),
  2949. move(body));
  2950. }
  2951. NonnullRefPtr<IfStatement> Parser::parse_if_statement()
  2952. {
  2953. auto rule_start = push_start();
  2954. auto parse_function_declaration_as_block_statement = [&] {
  2955. // https://tc39.es/ecma262/#sec-functiondeclarations-in-ifstatement-statement-clauses
  2956. // This production only applies when parsing non-strict code. Source text matched
  2957. // by this production is processed as if each matching occurrence of
  2958. // FunctionDeclaration[?Yield, ?Await, ~Default] was the sole StatementListItem
  2959. // of a BlockStatement occupying that position in the source text.
  2960. // The semantics of such a synthetic BlockStatement includes the web legacy
  2961. // compatibility semantics specified in B.3.2.
  2962. VERIFY(match(TokenType::Function));
  2963. auto block = create_ast_node<BlockStatement>({ m_source_code, rule_start.position(), position() });
  2964. ScopePusher block_scope = ScopePusher::block_scope(*this, *block);
  2965. auto declaration = parse_declaration();
  2966. VERIFY(m_state.current_scope_pusher);
  2967. block_scope.add_declaration(declaration);
  2968. VERIFY(is<FunctionDeclaration>(*declaration));
  2969. auto& function_declaration = static_cast<FunctionDeclaration const&>(*declaration);
  2970. if (function_declaration.kind() == FunctionKind::Generator)
  2971. syntax_error("Generator functions can only be declared in top-level or within a block");
  2972. if (function_declaration.kind() == FunctionKind::Async)
  2973. syntax_error("Async functions can only be declared in top-level or within a block");
  2974. block->append(move(declaration));
  2975. return block;
  2976. };
  2977. consume(TokenType::If);
  2978. consume(TokenType::ParenOpen);
  2979. auto predicate = parse_expression(0);
  2980. consume(TokenType::ParenClose);
  2981. RefPtr<Statement> consequent;
  2982. if (!m_state.strict_mode && match(TokenType::Function))
  2983. consequent = parse_function_declaration_as_block_statement();
  2984. else
  2985. consequent = parse_statement();
  2986. RefPtr<Statement> alternate;
  2987. if (match(TokenType::Else)) {
  2988. consume();
  2989. if (!m_state.strict_mode && match(TokenType::Function))
  2990. alternate = parse_function_declaration_as_block_statement();
  2991. else
  2992. alternate = parse_statement();
  2993. }
  2994. return create_ast_node<IfStatement>({ m_source_code, rule_start.position(), position() }, move(predicate), move(*consequent), move(alternate));
  2995. }
  2996. NonnullRefPtr<Statement> Parser::parse_for_statement()
  2997. {
  2998. auto rule_start = push_start();
  2999. auto is_await_loop = IsForAwaitLoop::No;
  3000. auto match_of = [&](Token const& token) {
  3001. return token.type() == TokenType::Identifier && token.original_value() == "of"sv;
  3002. };
  3003. auto match_for_in_of = [&]() {
  3004. bool is_of = match_of(m_state.current_token);
  3005. if (is_await_loop == IsForAwaitLoop::Yes) {
  3006. if (!is_of)
  3007. syntax_error("for await loop is only valid with 'of'");
  3008. else if (!m_state.await_expression_is_valid)
  3009. syntax_error("for await loop is only valid in async function or generator");
  3010. return true;
  3011. }
  3012. return match(TokenType::In) || is_of;
  3013. };
  3014. consume(TokenType::For);
  3015. if (match(TokenType::Await)) {
  3016. consume();
  3017. if (!m_state.await_expression_is_valid)
  3018. syntax_error("for-await-of is only allowed in async function context");
  3019. is_await_loop = IsForAwaitLoop::Yes;
  3020. }
  3021. consume(TokenType::ParenOpen);
  3022. Optional<ScopePusher> scope_pusher;
  3023. RefPtr<ASTNode> init;
  3024. if (!match(TokenType::Semicolon)) {
  3025. if (match_variable_declaration()) {
  3026. auto declaration = parse_variable_declaration(true);
  3027. if (declaration->declaration_kind() == DeclarationKind::Var) {
  3028. m_state.current_scope_pusher->add_declaration(declaration);
  3029. } else {
  3030. // This does not follow the normal declaration structure so we need additional checks.
  3031. HashTable<FlyString> bound_names;
  3032. declaration->for_each_bound_name([&](auto const& name) {
  3033. if (bound_names.set(name) != AK::HashSetResult::InsertedNewEntry)
  3034. syntax_error(String::formatted("Identifier '{}' already declared in for loop initializer", name), declaration->source_range().start);
  3035. });
  3036. }
  3037. init = move(declaration);
  3038. if (match_for_in_of())
  3039. return parse_for_in_of_statement(*init, is_await_loop);
  3040. if (static_cast<VariableDeclaration&>(*init).declaration_kind() == DeclarationKind::Const) {
  3041. for (auto& variable : static_cast<VariableDeclaration&>(*init).declarations()) {
  3042. if (!variable.init())
  3043. syntax_error("Missing initializer in 'const' variable declaration");
  3044. }
  3045. }
  3046. } else if (match_expression()) {
  3047. auto lookahead_token = next_token();
  3048. bool starts_with_async_of = match(TokenType::Async) && match_of(lookahead_token);
  3049. init = parse_expression(0, Associativity::Right, { TokenType::In });
  3050. if (match_for_in_of()) {
  3051. if (is_await_loop != IsForAwaitLoop::Yes
  3052. && starts_with_async_of && match_of(m_state.current_token))
  3053. syntax_error("for-of loop may not start with async of");
  3054. return parse_for_in_of_statement(*init, is_await_loop);
  3055. }
  3056. } else {
  3057. syntax_error("Unexpected token in for loop");
  3058. }
  3059. }
  3060. consume(TokenType::Semicolon);
  3061. RefPtr<Expression> test;
  3062. if (!match(TokenType::Semicolon))
  3063. test = parse_expression(0);
  3064. consume(TokenType::Semicolon);
  3065. RefPtr<Expression> update;
  3066. if (!match(TokenType::ParenClose))
  3067. update = parse_expression(0);
  3068. consume(TokenType::ParenClose);
  3069. TemporaryChange break_change(m_state.in_break_context, true);
  3070. TemporaryChange continue_change(m_state.in_continue_context, true);
  3071. ScopePusher for_loop_scope = ScopePusher::for_loop_scope(*this, init);
  3072. auto body = parse_statement();
  3073. return create_ast_node<ForStatement>({ m_source_code, rule_start.position(), position() }, move(init), move(test), move(update), move(body));
  3074. }
  3075. NonnullRefPtr<Statement> Parser::parse_for_in_of_statement(NonnullRefPtr<ASTNode> lhs, IsForAwaitLoop is_for_await_loop)
  3076. {
  3077. Variant<NonnullRefPtr<ASTNode>, NonnullRefPtr<BindingPattern>> for_declaration = lhs;
  3078. auto rule_start = push_start();
  3079. auto has_annexB_for_in_init_extension = false;
  3080. if (is<VariableDeclaration>(*lhs)) {
  3081. auto& declaration = static_cast<VariableDeclaration&>(*lhs);
  3082. if (declaration.declarations().size() > 1) {
  3083. syntax_error("Multiple declarations not allowed in for..in/of");
  3084. } else if (declaration.declarations().size() < 1) {
  3085. syntax_error("Need exactly one variable declaration in for..in/of");
  3086. } else {
  3087. // AnnexB extension B.3.5 Initializers in ForIn Statement Heads, https://tc39.es/ecma262/#sec-initializers-in-forin-statement-heads
  3088. auto& variable = declaration.declarations().first();
  3089. if (variable.init()) {
  3090. if (m_state.strict_mode || declaration.declaration_kind() != DeclarationKind::Var || !variable.target().has<NonnullRefPtr<Identifier>>())
  3091. syntax_error("Variable initializer not allowed in for..in/of");
  3092. else
  3093. has_annexB_for_in_init_extension = true;
  3094. }
  3095. }
  3096. } else if (!lhs->is_identifier() && !is<MemberExpression>(*lhs) && !is<CallExpression>(*lhs)) {
  3097. bool valid = false;
  3098. if (is<ObjectExpression>(*lhs) || is<ArrayExpression>(*lhs)) {
  3099. auto synthesized_binding_pattern = synthesize_binding_pattern(static_cast<Expression const&>(*lhs));
  3100. if (synthesized_binding_pattern) {
  3101. for_declaration = synthesized_binding_pattern.release_nonnull();
  3102. valid = true;
  3103. }
  3104. }
  3105. if (!valid)
  3106. syntax_error(String::formatted("Invalid left-hand side in for-loop ('{}')", lhs->class_name()));
  3107. }
  3108. auto in_or_of = consume();
  3109. auto is_in = in_or_of.type() == TokenType::In;
  3110. if (!is_in) {
  3111. if (is<MemberExpression>(*lhs)) {
  3112. auto& member = static_cast<MemberExpression const&>(*lhs);
  3113. if (member.object().is_identifier() && static_cast<Identifier const&>(member.object()).string() == "let"sv)
  3114. syntax_error("For of statement may not start with let.");
  3115. }
  3116. if (has_annexB_for_in_init_extension)
  3117. syntax_error("Variable initializer not allowed in for..of", rule_start.position());
  3118. }
  3119. auto rhs = parse_expression(is_in ? 0 : 2);
  3120. consume(TokenType::ParenClose);
  3121. TemporaryChange break_change(m_state.in_break_context, true);
  3122. TemporaryChange continue_change(m_state.in_continue_context, true);
  3123. ScopePusher for_loop_scope = ScopePusher::for_loop_scope(*this, lhs);
  3124. auto body = parse_statement();
  3125. if (is_in)
  3126. return create_ast_node<ForInStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3127. if (is_for_await_loop == IsForAwaitLoop::Yes)
  3128. return create_ast_node<ForAwaitOfStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3129. return create_ast_node<ForOfStatement>({ m_source_code, rule_start.position(), position() }, move(for_declaration), move(rhs), move(body));
  3130. }
  3131. NonnullRefPtr<DebuggerStatement> Parser::parse_debugger_statement()
  3132. {
  3133. auto rule_start = push_start();
  3134. consume(TokenType::Debugger);
  3135. consume_or_insert_semicolon();
  3136. return create_ast_node<DebuggerStatement>({ m_source_code, rule_start.position(), position() });
  3137. }
  3138. bool Parser::match(TokenType type) const
  3139. {
  3140. return m_state.current_token.type() == type;
  3141. }
  3142. bool Parser::match_expression() const
  3143. {
  3144. auto type = m_state.current_token.type();
  3145. if (type == TokenType::Import) {
  3146. auto lookahead_token = next_token();
  3147. return lookahead_token.type() == TokenType::Period || lookahead_token.type() == TokenType::ParenOpen;
  3148. }
  3149. return type == TokenType::BoolLiteral
  3150. || type == TokenType::NumericLiteral
  3151. || type == TokenType::BigIntLiteral
  3152. || type == TokenType::StringLiteral
  3153. || type == TokenType::TemplateLiteralStart
  3154. || type == TokenType::NullLiteral
  3155. || match_identifier()
  3156. || type == TokenType::PrivateIdentifier
  3157. || type == TokenType::Await
  3158. || type == TokenType::New
  3159. || type == TokenType::Class
  3160. || type == TokenType::CurlyOpen
  3161. || type == TokenType::BracketOpen
  3162. || type == TokenType::ParenOpen
  3163. || type == TokenType::Function
  3164. || type == TokenType::Async
  3165. || type == TokenType::This
  3166. || type == TokenType::Super
  3167. || type == TokenType::RegexLiteral
  3168. || type == TokenType::Slash // Wrongly recognized regex by lexer
  3169. || type == TokenType::SlashEquals // Wrongly recognized regex by lexer (/=a/ is a valid regex)
  3170. || type == TokenType::Yield
  3171. || match_unary_prefixed_expression();
  3172. }
  3173. bool Parser::match_unary_prefixed_expression() const
  3174. {
  3175. auto type = m_state.current_token.type();
  3176. return type == TokenType::PlusPlus
  3177. || type == TokenType::MinusMinus
  3178. || type == TokenType::ExclamationMark
  3179. || type == TokenType::Tilde
  3180. || type == TokenType::Plus
  3181. || type == TokenType::Minus
  3182. || type == TokenType::Typeof
  3183. || type == TokenType::Void
  3184. || type == TokenType::Delete;
  3185. }
  3186. bool Parser::match_secondary_expression(ForbiddenTokens forbidden) const
  3187. {
  3188. auto type = m_state.current_token.type();
  3189. if (!forbidden.allows(type))
  3190. return false;
  3191. return type == TokenType::Plus
  3192. || type == TokenType::PlusEquals
  3193. || type == TokenType::Minus
  3194. || type == TokenType::MinusEquals
  3195. || type == TokenType::Asterisk
  3196. || type == TokenType::AsteriskEquals
  3197. || type == TokenType::Slash
  3198. || type == TokenType::SlashEquals
  3199. || type == TokenType::Percent
  3200. || type == TokenType::PercentEquals
  3201. || type == TokenType::DoubleAsterisk
  3202. || type == TokenType::DoubleAsteriskEquals
  3203. || type == TokenType::Equals
  3204. || type == TokenType::EqualsEqualsEquals
  3205. || type == TokenType::ExclamationMarkEqualsEquals
  3206. || type == TokenType::EqualsEquals
  3207. || type == TokenType::ExclamationMarkEquals
  3208. || type == TokenType::GreaterThan
  3209. || type == TokenType::GreaterThanEquals
  3210. || type == TokenType::LessThan
  3211. || type == TokenType::LessThanEquals
  3212. || type == TokenType::ParenOpen
  3213. || type == TokenType::Period
  3214. || type == TokenType::BracketOpen
  3215. || (type == TokenType::PlusPlus && !m_state.current_token.trivia_contains_line_terminator())
  3216. || (type == TokenType::MinusMinus && !m_state.current_token.trivia_contains_line_terminator())
  3217. || type == TokenType::In
  3218. || type == TokenType::Instanceof
  3219. || type == TokenType::QuestionMark
  3220. || type == TokenType::Ampersand
  3221. || type == TokenType::AmpersandEquals
  3222. || type == TokenType::Pipe
  3223. || type == TokenType::PipeEquals
  3224. || type == TokenType::Caret
  3225. || type == TokenType::CaretEquals
  3226. || type == TokenType::ShiftLeft
  3227. || type == TokenType::ShiftLeftEquals
  3228. || type == TokenType::ShiftRight
  3229. || type == TokenType::ShiftRightEquals
  3230. || type == TokenType::UnsignedShiftRight
  3231. || type == TokenType::UnsignedShiftRightEquals
  3232. || type == TokenType::DoubleAmpersand
  3233. || type == TokenType::DoubleAmpersandEquals
  3234. || type == TokenType::DoublePipe
  3235. || type == TokenType::DoublePipeEquals
  3236. || type == TokenType::DoubleQuestionMark
  3237. || type == TokenType::DoubleQuestionMarkEquals
  3238. || type == TokenType::QuestionMarkPeriod;
  3239. }
  3240. bool Parser::match_statement() const
  3241. {
  3242. auto type = m_state.current_token.type();
  3243. return match_expression()
  3244. || type == TokenType::Return
  3245. || type == TokenType::Yield
  3246. || type == TokenType::Do
  3247. || type == TokenType::If
  3248. || type == TokenType::Throw
  3249. || type == TokenType::Try
  3250. || type == TokenType::While
  3251. || type == TokenType::With
  3252. || type == TokenType::For
  3253. || type == TokenType::CurlyOpen
  3254. || type == TokenType::Switch
  3255. || type == TokenType::Break
  3256. || type == TokenType::Continue
  3257. || type == TokenType::Var
  3258. || type == TokenType::Debugger
  3259. || type == TokenType::Semicolon;
  3260. }
  3261. bool Parser::match_export_or_import() const
  3262. {
  3263. auto type = m_state.current_token.type();
  3264. return type == TokenType::Export
  3265. || type == TokenType::Import;
  3266. }
  3267. bool Parser::match_declaration() const
  3268. {
  3269. auto type = m_state.current_token.type();
  3270. if (type == TokenType::Let && !m_state.strict_mode) {
  3271. return try_match_let_declaration();
  3272. }
  3273. if (type == TokenType::Async) {
  3274. auto lookahead_token = next_token();
  3275. return lookahead_token.type() == TokenType::Function && !lookahead_token.trivia_contains_line_terminator();
  3276. }
  3277. return type == TokenType::Function
  3278. || type == TokenType::Class
  3279. || type == TokenType::Const
  3280. || type == TokenType::Let;
  3281. }
  3282. Token Parser::next_token(size_t steps) const
  3283. {
  3284. Lexer lookahead_lexer = m_state.lexer;
  3285. Token lookahead_token;
  3286. while (steps > 0) {
  3287. lookahead_token = lookahead_lexer.next();
  3288. steps--;
  3289. }
  3290. return lookahead_token;
  3291. }
  3292. bool Parser::try_match_let_declaration() const
  3293. {
  3294. VERIFY(m_state.current_token.type() == TokenType::Let);
  3295. auto token_after = next_token();
  3296. if (token_after.is_identifier_name() && token_after.value() != "in"sv)
  3297. return true;
  3298. if (token_after.type() == TokenType::CurlyOpen || token_after.type() == TokenType::BracketOpen)
  3299. return true;
  3300. return false;
  3301. }
  3302. bool Parser::match_variable_declaration() const
  3303. {
  3304. auto type = m_state.current_token.type();
  3305. if (type == TokenType::Let && !m_state.strict_mode) {
  3306. return try_match_let_declaration();
  3307. }
  3308. return type == TokenType::Var
  3309. || type == TokenType::Let
  3310. || type == TokenType::Const;
  3311. }
  3312. bool Parser::match_identifier() const
  3313. {
  3314. if (m_state.current_token.type() == TokenType::EscapedKeyword) {
  3315. if (m_state.current_token.value() == "let"sv)
  3316. return !m_state.strict_mode;
  3317. if (m_state.current_token.value() == "yield"sv)
  3318. return !m_state.strict_mode && !m_state.in_generator_function_context;
  3319. if (m_state.current_token.value() == "await"sv)
  3320. return m_program_type != Program::Type::Module && !m_state.await_expression_is_valid && !m_state.in_class_static_init_block;
  3321. return true;
  3322. }
  3323. return m_state.current_token.type() == TokenType::Identifier
  3324. || m_state.current_token.type() == TokenType::Async
  3325. || (m_state.current_token.type() == TokenType::Let && !m_state.strict_mode)
  3326. || (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)
  3327. || (m_state.current_token.type() == TokenType::Yield && !m_state.in_generator_function_context && !m_state.strict_mode); // See note in Parser::parse_identifier().
  3328. }
  3329. bool Parser::match_identifier_name() const
  3330. {
  3331. return m_state.current_token.is_identifier_name();
  3332. }
  3333. bool Parser::match_property_key() const
  3334. {
  3335. auto type = m_state.current_token.type();
  3336. return match_identifier_name()
  3337. || type == TokenType::BracketOpen
  3338. || type == TokenType::StringLiteral
  3339. || type == TokenType::NumericLiteral
  3340. || type == TokenType::BigIntLiteral;
  3341. }
  3342. bool Parser::done() const
  3343. {
  3344. return match(TokenType::Eof);
  3345. }
  3346. Token Parser::consume()
  3347. {
  3348. auto old_token = m_state.current_token;
  3349. m_state.current_token = m_state.lexer.next();
  3350. // NOTE: This is the bare minimum needed to decide whether we might need an arguments object
  3351. // in a function expression or declaration. ("might" because the AST implements some further
  3352. // conditions from the spec that rule out the need for allocating one)
  3353. if (old_token.type() == TokenType::Identifier && old_token.value().is_one_of("arguments"sv, "eval"sv))
  3354. m_state.function_might_need_arguments_object = true;
  3355. return old_token;
  3356. }
  3357. void Parser::consume_or_insert_semicolon()
  3358. {
  3359. // Semicolon was found and will be consumed
  3360. if (match(TokenType::Semicolon)) {
  3361. consume();
  3362. return;
  3363. }
  3364. // Insert semicolon if...
  3365. // ...token is preceded by one or more newlines
  3366. if (m_state.current_token.trivia_contains_line_terminator())
  3367. return;
  3368. // ...token is a closing curly brace
  3369. if (match(TokenType::CurlyClose))
  3370. return;
  3371. // ...token is eof
  3372. if (match(TokenType::Eof))
  3373. return;
  3374. // No rule for semicolon insertion applies -> syntax error
  3375. expected("Semicolon");
  3376. }
  3377. Token Parser::consume_identifier()
  3378. {
  3379. if (match(TokenType::Identifier))
  3380. return consume(TokenType::Identifier);
  3381. if (match(TokenType::EscapedKeyword))
  3382. return consume(TokenType::EscapedKeyword);
  3383. // Note that 'let' is not a reserved keyword, but our lexer considers it such
  3384. // As it's pretty nice to have that (for syntax highlighting and such), we'll
  3385. // special-case it here instead.
  3386. if (match(TokenType::Let)) {
  3387. if (m_state.strict_mode)
  3388. syntax_error("'let' is not allowed as an identifier in strict mode");
  3389. return consume();
  3390. }
  3391. if (match(TokenType::Yield)) {
  3392. if (m_state.strict_mode || m_state.in_generator_function_context)
  3393. syntax_error("Identifier must not be a reserved word in strict mode ('yield')");
  3394. return consume();
  3395. }
  3396. if (match(TokenType::Await)) {
  3397. if (m_program_type == Program::Type::Module || m_state.await_expression_is_valid || m_state.in_class_static_init_block)
  3398. syntax_error("Identifier must not be a reserved word in modules ('await')");
  3399. return consume();
  3400. }
  3401. if (match(TokenType::Async))
  3402. return consume();
  3403. expected("Identifier");
  3404. return consume();
  3405. }
  3406. // https://tc39.es/ecma262/#prod-IdentifierReference
  3407. Token Parser::consume_identifier_reference()
  3408. {
  3409. if (match(TokenType::Identifier))
  3410. return consume(TokenType::Identifier);
  3411. if (match(TokenType::EscapedKeyword)) {
  3412. auto name = m_state.current_token.value();
  3413. if (m_state.strict_mode && (name == "let"sv || name == "yield"sv))
  3414. syntax_error(String::formatted("'{}' is not allowed as an identifier in strict mode", name));
  3415. if (m_program_type == Program::Type::Module && name == "await"sv)
  3416. syntax_error("'await' is not allowed as an identifier in module");
  3417. return consume();
  3418. }
  3419. // See note in Parser::parse_identifier().
  3420. if (match(TokenType::Let)) {
  3421. if (m_state.strict_mode)
  3422. syntax_error("'let' is not allowed as an identifier in strict mode");
  3423. return consume();
  3424. }
  3425. if (match(TokenType::Yield)) {
  3426. if (m_state.strict_mode)
  3427. syntax_error("Identifier reference may not be 'yield' in strict mode");
  3428. return consume();
  3429. }
  3430. if (match(TokenType::Await)) {
  3431. if (m_program_type == Program::Type::Module)
  3432. syntax_error("'await' is not allowed as an identifier in module");
  3433. return consume();
  3434. }
  3435. if (match(TokenType::Async))
  3436. return consume();
  3437. expected(Token::name(TokenType::Identifier));
  3438. return consume();
  3439. }
  3440. Token Parser::consume(TokenType expected_type)
  3441. {
  3442. if (!match(expected_type)) {
  3443. expected(Token::name(expected_type));
  3444. }
  3445. auto token = consume();
  3446. if (expected_type == TokenType::Identifier) {
  3447. if (m_state.strict_mode && is_strict_reserved_word(token.value()))
  3448. syntax_error(String::formatted("Identifier must not be a reserved word in strict mode ('{}')", token.value()));
  3449. }
  3450. return token;
  3451. }
  3452. Token Parser::consume_and_validate_numeric_literal()
  3453. {
  3454. auto is_unprefixed_octal_number = [](StringView value) {
  3455. return value.length() > 1 && value[0] == '0' && is_ascii_digit(value[1]);
  3456. };
  3457. auto literal_start = position();
  3458. auto token = consume(TokenType::NumericLiteral);
  3459. if (m_state.strict_mode && is_unprefixed_octal_number(token.value()))
  3460. syntax_error("Unprefixed octal number not allowed in strict mode", literal_start);
  3461. if (match_identifier_name() && m_state.current_token.trivia().is_empty())
  3462. syntax_error("Numeric literal must not be immediately followed by identifier");
  3463. return token;
  3464. }
  3465. void Parser::expected(char const* what)
  3466. {
  3467. auto message = m_state.current_token.message();
  3468. if (message.is_empty())
  3469. message = String::formatted("Unexpected token {}. Expected {}", m_state.current_token.name(), what);
  3470. syntax_error(message);
  3471. }
  3472. Position Parser::position() const
  3473. {
  3474. return {
  3475. m_state.current_token.line_number(),
  3476. m_state.current_token.line_column(),
  3477. m_state.current_token.offset(),
  3478. };
  3479. }
  3480. bool Parser::try_parse_arrow_function_expression_failed_at_position(Position const& position) const
  3481. {
  3482. auto it = m_token_memoizations.find(position);
  3483. if (it == m_token_memoizations.end())
  3484. return false;
  3485. return (*it).value.try_parse_arrow_function_expression_failed;
  3486. }
  3487. void Parser::set_try_parse_arrow_function_expression_failed_at_position(Position const& position, bool failed)
  3488. {
  3489. m_token_memoizations.set(position, { failed });
  3490. }
  3491. void Parser::syntax_error(String const& message, Optional<Position> position)
  3492. {
  3493. if (!position.has_value())
  3494. position = this->position();
  3495. m_state.errors.append({ message, position });
  3496. }
  3497. void Parser::save_state()
  3498. {
  3499. m_saved_state.append(m_state);
  3500. }
  3501. void Parser::load_state()
  3502. {
  3503. VERIFY(!m_saved_state.is_empty());
  3504. m_state = m_saved_state.take_last();
  3505. }
  3506. void Parser::discard_saved_state()
  3507. {
  3508. m_saved_state.take_last();
  3509. }
  3510. void Parser::check_identifier_name_for_assignment_validity(FlyString const& name, bool force_strict)
  3511. {
  3512. // FIXME: this is now called from multiple places maybe the error message should be dynamic?
  3513. if (any_of(s_reserved_words, [&](auto& value) { return name == value; })) {
  3514. syntax_error("Binding pattern target may not be a reserved word");
  3515. } else if (m_state.strict_mode || force_strict) {
  3516. if (name.is_one_of("arguments"sv, "eval"sv))
  3517. syntax_error("Binding pattern target may not be called 'arguments' or 'eval' in strict mode");
  3518. else if (is_strict_reserved_word(name))
  3519. syntax_error(String::formatted("Binding pattern target may not be called '{}' in strict mode", name));
  3520. }
  3521. }
  3522. bool Parser::match_assert_clause() const
  3523. {
  3524. return !m_state.current_token.trivia_contains_line_terminator() && m_state.current_token.original_value() == "assert"sv;
  3525. }
  3526. FlyString Parser::consume_string_value()
  3527. {
  3528. VERIFY(match(TokenType::StringLiteral));
  3529. auto string_token = consume();
  3530. FlyString value = parse_string_literal(string_token)->value();
  3531. // This also checks IsStringWellFormedUnicode which makes sure there is no unpaired surrogate
  3532. // Surrogates are at least 3 bytes
  3533. if (value.length() < 3)
  3534. return value;
  3535. Utf8View view { value.view().substring_view(value.length() - 3) };
  3536. VERIFY(view.length() <= 3);
  3537. auto codepoint = *view.begin();
  3538. if (Utf16View::is_high_surrogate(codepoint)) {
  3539. syntax_error("StringValue ending with unpaired high surrogate");
  3540. VERIFY(view.length() == 1);
  3541. }
  3542. return value;
  3543. }
  3544. // AssertClause, https://tc39.es/proposal-import-assertions/#prod-AssertClause
  3545. ModuleRequest Parser::parse_module_request()
  3546. {
  3547. // Does not include the 'from' since that is not always required.
  3548. if (!match(TokenType::StringLiteral)) {
  3549. expected("ModuleSpecifier (string)");
  3550. return ModuleRequest { "!!invalid!!" };
  3551. }
  3552. ModuleRequest request { consume_string_value() };
  3553. if (!match_assert_clause())
  3554. return request;
  3555. VERIFY(m_state.current_token.original_value() == "assert"sv);
  3556. consume(TokenType::Identifier);
  3557. consume(TokenType::CurlyOpen);
  3558. while (!done() && !match(TokenType::CurlyClose)) {
  3559. String key;
  3560. if (match(TokenType::StringLiteral)) {
  3561. key = parse_string_literal(m_state.current_token)->value().to_string();
  3562. consume();
  3563. } else if (match_identifier_name()) {
  3564. key = consume().value();
  3565. } else {
  3566. expected("IdentifierName or StringValue as AssertionKey");
  3567. consume();
  3568. }
  3569. consume(TokenType::Colon);
  3570. if (match(TokenType::StringLiteral)) {
  3571. for (auto& entries : request.assertions) {
  3572. if (entries.key == key)
  3573. syntax_error(String::formatted("Duplicate assertion clauses with name: {}", key));
  3574. }
  3575. request.add_assertion(move(key), parse_string_literal(m_state.current_token)->value().to_string());
  3576. }
  3577. consume(TokenType::StringLiteral);
  3578. if (match(TokenType::Comma))
  3579. consume(TokenType::Comma);
  3580. else
  3581. break;
  3582. }
  3583. consume(TokenType::CurlyClose);
  3584. return request;
  3585. }
  3586. static FlyString default_string_value = "default";
  3587. NonnullRefPtr<ImportStatement> Parser::parse_import_statement(Program& program)
  3588. {
  3589. // We use the extended syntax which adds:
  3590. // ImportDeclaration:
  3591. // import ImportClause FromClause [no LineTerminator here] AssertClause;
  3592. // import ModuleSpecifier [no LineTerminator here] AssertClause;
  3593. // From: https://tc39.es/proposal-import-assertions/#prod-ImportDeclaration
  3594. auto rule_start = push_start();
  3595. if (program.type() != Program::Type::Module)
  3596. syntax_error("Cannot use import statement outside a module");
  3597. consume(TokenType::Import);
  3598. if (match(TokenType::StringLiteral)) {
  3599. // import ModuleSpecifier ;
  3600. auto module_request = parse_module_request();
  3601. return create_ast_node<ImportStatement>({ m_source_code, rule_start.position(), position() }, move(module_request));
  3602. }
  3603. auto match_imported_binding = [&] {
  3604. return match_identifier() || match(TokenType::Yield) || match(TokenType::Await);
  3605. };
  3606. auto match_as = [&] {
  3607. return match(TokenType::Identifier) && m_state.current_token.original_value() == "as"sv;
  3608. };
  3609. bool continue_parsing = true;
  3610. struct ImportWithLocation {
  3611. ImportStatement::ImportEntry entry;
  3612. Position position;
  3613. };
  3614. Vector<ImportWithLocation> entries_with_location;
  3615. // import ImportClause FromClause ;
  3616. // ImportClause :
  3617. // ImportedDefaultBinding
  3618. // NameSpaceImport
  3619. // NamedImports
  3620. // ImportedDefaultBinding , NameSpaceImport
  3621. // ImportedDefaultBinding , NamedImports
  3622. if (match_imported_binding()) {
  3623. // ImportedDefaultBinding : ImportedBinding
  3624. auto id_position = position();
  3625. auto bound_name = consume().value();
  3626. entries_with_location.append({ { default_string_value, bound_name }, id_position });
  3627. if (match(TokenType::Comma)) {
  3628. consume(TokenType::Comma);
  3629. } else {
  3630. continue_parsing = false;
  3631. }
  3632. }
  3633. if (!continue_parsing) {
  3634. // skip the rest
  3635. } else if (match(TokenType::Asterisk)) {
  3636. // NameSpaceImport : * as ImportedBinding
  3637. consume(TokenType::Asterisk);
  3638. if (!match_as())
  3639. syntax_error(String::formatted("Unexpected token: {}", m_state.current_token.name()));
  3640. consume(TokenType::Identifier);
  3641. if (match_imported_binding()) {
  3642. auto namespace_position = position();
  3643. auto namespace_name = consume().value();
  3644. entries_with_location.append({ ImportStatement::ImportEntry({}, namespace_name, true), namespace_position });
  3645. } else {
  3646. syntax_error(String::formatted("Unexpected token: {}", m_state.current_token.name()));
  3647. }
  3648. } else if (match(TokenType::CurlyOpen)) {
  3649. // NamedImports :
  3650. // { ImportSpecifier ,_opt } (repeated any amount of times)
  3651. consume(TokenType::CurlyOpen);
  3652. while (!done() && !match(TokenType::CurlyClose)) {
  3653. if (match_identifier_name()) {
  3654. // ImportSpecifier : ImportedBinding
  3655. auto require_as = !match_imported_binding();
  3656. auto name_position = position();
  3657. auto name = consume().flystring_value();
  3658. if (match_as()) {
  3659. consume(TokenType::Identifier);
  3660. auto alias_position = position();
  3661. auto alias = consume_identifier().flystring_value();
  3662. check_identifier_name_for_assignment_validity(alias);
  3663. entries_with_location.append({ { name, alias }, alias_position });
  3664. } else if (require_as) {
  3665. syntax_error(String::formatted("Unexpected reserved word '{}'", name));
  3666. } else {
  3667. check_identifier_name_for_assignment_validity(name);
  3668. entries_with_location.append({ { name, name }, name_position });
  3669. }
  3670. } else if (match(TokenType::StringLiteral)) {
  3671. // ImportSpecifier : ModuleExportName as ImportedBinding
  3672. auto name = consume_string_value();
  3673. if (!match_as())
  3674. expected("as");
  3675. consume(TokenType::Identifier);
  3676. auto alias_position = position();
  3677. auto alias = consume_identifier().flystring_value();
  3678. check_identifier_name_for_assignment_validity(alias);
  3679. entries_with_location.append({ { move(name), alias }, alias_position });
  3680. } else {
  3681. expected("identifier");
  3682. break;
  3683. }
  3684. if (!match(TokenType::Comma))
  3685. break;
  3686. consume(TokenType::Comma);
  3687. }
  3688. consume(TokenType::CurlyClose);
  3689. } else {
  3690. expected("import clauses");
  3691. }
  3692. auto from_statement = consume(TokenType::Identifier).original_value();
  3693. if (from_statement != "from"sv)
  3694. syntax_error(String::formatted("Expected 'from' got {}", from_statement));
  3695. auto module_request = parse_module_request();
  3696. Vector<ImportStatement::ImportEntry> entries;
  3697. entries.ensure_capacity(entries_with_location.size());
  3698. for (auto& entry : entries_with_location) {
  3699. for (auto& import_statement : program.imports()) {
  3700. if (import_statement.has_bound_name(entry.entry.local_name))
  3701. syntax_error(String::formatted("Identifier '{}' already declared", entry.entry.local_name), entry.position);
  3702. }
  3703. for (auto& new_entry : entries) {
  3704. if (new_entry.local_name == entry.entry.local_name)
  3705. syntax_error(String::formatted("Identifier '{}' already declared", entry.entry.local_name), entry.position);
  3706. }
  3707. entries.append(move(entry.entry));
  3708. }
  3709. return create_ast_node<ImportStatement>({ m_source_code, rule_start.position(), position() }, move(module_request), move(entries));
  3710. }
  3711. NonnullRefPtr<ExportStatement> Parser::parse_export_statement(Program& program)
  3712. {
  3713. using ExportEntry = ExportStatement::ExportEntry;
  3714. // We use the extended syntax which adds:
  3715. // ExportDeclaration:
  3716. // export ExportFromClause FromClause [no LineTerminator here] AssertClause ;
  3717. // From: https://tc39.es/proposal-import-assertions/#prod-ExportDeclaration
  3718. auto rule_start = push_start();
  3719. if (program.type() != Program::Type::Module)
  3720. syntax_error("Cannot use export statement outside a module");
  3721. auto match_as = [&] {
  3722. return match(TokenType::Identifier) && m_state.current_token.original_value() == "as"sv;
  3723. };
  3724. auto match_from = [&] {
  3725. return match(TokenType::Identifier) && m_state.current_token.original_value() == "from"sv;
  3726. };
  3727. auto match_default = [&] {
  3728. return match(TokenType::Default) && m_state.current_token.original_value() == "default"sv;
  3729. };
  3730. consume(TokenType::Export);
  3731. struct EntryAndLocation {
  3732. ExportEntry entry;
  3733. Position position;
  3734. };
  3735. Vector<EntryAndLocation> entries_with_location;
  3736. RefPtr<ASTNode> expression = {};
  3737. bool is_default = false;
  3738. ModuleRequest from_specifier;
  3739. if (match_default()) {
  3740. is_default = true;
  3741. auto default_position = position();
  3742. consume(TokenType::Default);
  3743. FlyString local_name;
  3744. auto lookahead_token = next_token();
  3745. enum class MatchesFunctionDeclaration {
  3746. Yes,
  3747. No,
  3748. WithoutName,
  3749. };
  3750. // Note: For some reason the spec here has declaration which can have no name
  3751. // and the rest of the parser is just not setup for that. With these
  3752. // hacks below we get through most things but we should probably figure
  3753. // out a better solution. I have attempted to explain why/what these "hacks" do below.
  3754. // The summary is treat named declarations just as declarations and hack around unnamed
  3755. // declarations with expression see also SourceTextModule::initialize_environment.
  3756. // As far as I'm aware the only problem (which is a tricky one) is:
  3757. // `export default function() {}()`
  3758. // Since we parse this as an expression you are immediately allowed to call it
  3759. // which is incorrect and this should give a SyntaxError.
  3760. auto has_name = [&](Token const& token) {
  3761. if (token.type() != TokenType::ParenOpen)
  3762. return MatchesFunctionDeclaration::Yes;
  3763. return MatchesFunctionDeclaration::WithoutName;
  3764. };
  3765. auto match_function_declaration = [&] {
  3766. // Hack part 1.
  3767. // Match a function declaration with a name, since we have async and generator
  3768. // and asyncgenerator variants this is quite complicated.
  3769. auto current_type = m_state.current_token.type();
  3770. Lexer lookahead_lexer = m_state.lexer;
  3771. lookahead_lexer.next();
  3772. if (current_type == TokenType::Function) {
  3773. if (lookahead_token.type() == TokenType::Asterisk)
  3774. return has_name(lookahead_lexer.next()); // function * [name]
  3775. else
  3776. return has_name(lookahead_token); // function [name]
  3777. }
  3778. if (current_type == TokenType::Async) {
  3779. if (lookahead_token.type() != TokenType::Function)
  3780. return MatchesFunctionDeclaration::No;
  3781. if (lookahead_token.trivia_contains_line_terminator())
  3782. return MatchesFunctionDeclaration::No;
  3783. auto lookahead_two_token = lookahead_lexer.next();
  3784. if (lookahead_two_token.type() == TokenType::Asterisk)
  3785. return has_name(lookahead_lexer.next()); // async function * [name]
  3786. else
  3787. return has_name(lookahead_two_token); // async function [name]
  3788. }
  3789. return MatchesFunctionDeclaration::No;
  3790. };
  3791. if (auto matches_function = match_function_declaration(); matches_function != MatchesFunctionDeclaration::No) {
  3792. auto function_declaration = parse_function_node<FunctionDeclaration>(
  3793. (matches_function == MatchesFunctionDeclaration::WithoutName ? FunctionNodeParseOptions::HasDefaultExportName : 0)
  3794. | FunctionNodeParseOptions::CheckForFunctionAndName);
  3795. m_state.current_scope_pusher->add_declaration(function_declaration);
  3796. if (matches_function == MatchesFunctionDeclaration::WithoutName)
  3797. local_name = ExportStatement::local_name_for_default;
  3798. else
  3799. local_name = function_declaration->name();
  3800. expression = move(function_declaration);
  3801. } else if (match(TokenType::Class) && lookahead_token.type() != TokenType::CurlyOpen && lookahead_token.type() != TokenType::Extends) {
  3802. // Hack part 2.
  3803. // Attempt to detect classes with names only as those are declarations,
  3804. // this actually seems to cover all cases already.
  3805. auto class_expression = parse_class_declaration();
  3806. m_state.current_scope_pusher->add_declaration(class_expression);
  3807. local_name = class_expression->name();
  3808. expression = move(class_expression);
  3809. } else if (match_expression()) {
  3810. // Hack part 3.
  3811. // Even though the unnamed declarations look like expression we should
  3812. // not treat them as such and thus not consume a semicolon after them.
  3813. 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());
  3814. expression = parse_expression(2);
  3815. if (!special_case_declaration_without_name)
  3816. consume_or_insert_semicolon();
  3817. if (is<ClassExpression>(*expression)) {
  3818. auto const& class_expression = static_cast<ClassExpression&>(*expression);
  3819. if (class_expression.has_name())
  3820. local_name = class_expression.name();
  3821. }
  3822. } else {
  3823. expected("Declaration or assignment expression");
  3824. local_name = "!!invalid!!";
  3825. }
  3826. if (local_name.is_null()) {
  3827. local_name = ExportStatement::local_name_for_default;
  3828. }
  3829. entries_with_location.append({ ExportEntry::named_export(default_string_value, move(local_name)), default_position });
  3830. } else {
  3831. enum class FromSpecifier {
  3832. NotAllowed,
  3833. Optional,
  3834. Required
  3835. } check_for_from { FromSpecifier::NotAllowed };
  3836. auto parse_module_export_name = [&](bool lhs) -> FlyString {
  3837. // https://tc39.es/ecma262/#prod-ModuleExportName
  3838. // ModuleExportName :
  3839. // IdentifierName
  3840. // StringLiteral
  3841. if (match_identifier_name()) {
  3842. return consume().value();
  3843. }
  3844. if (match(TokenType::StringLiteral)) {
  3845. // It is a Syntax Error if ReferencedBindings of NamedExports contains any StringLiterals.
  3846. // Only for export { "a" as "b" }; // <-- no from
  3847. if (lhs)
  3848. check_for_from = FromSpecifier::Required;
  3849. return consume_string_value();
  3850. }
  3851. expected("ExportSpecifier (string or identifier)");
  3852. return {};
  3853. };
  3854. if (match(TokenType::Asterisk)) {
  3855. auto asterisk_position = position();
  3856. consume(TokenType::Asterisk);
  3857. if (match_as()) {
  3858. // * as ModuleExportName
  3859. consume(TokenType::Identifier);
  3860. auto namespace_position = position();
  3861. auto exported_name = parse_module_export_name(false);
  3862. entries_with_location.append({ ExportEntry::all_module_request(exported_name), namespace_position });
  3863. } else {
  3864. entries_with_location.append({ ExportEntry::all_but_default_entry(), asterisk_position });
  3865. }
  3866. check_for_from = FromSpecifier::Required;
  3867. } else if (match_declaration()) {
  3868. auto decl_position = position();
  3869. auto declaration = parse_declaration();
  3870. m_state.current_scope_pusher->add_declaration(declaration);
  3871. if (is<FunctionDeclaration>(*declaration)) {
  3872. auto& func = static_cast<FunctionDeclaration&>(*declaration);
  3873. entries_with_location.append({ ExportEntry::named_export(func.name(), func.name()), func.source_range().start });
  3874. } else if (is<ClassDeclaration>(*declaration)) {
  3875. auto& class_declaration = static_cast<ClassDeclaration&>(*declaration);
  3876. entries_with_location.append({ ExportEntry::named_export(class_declaration.name(), class_declaration.name()), class_declaration.source_range().start });
  3877. } else {
  3878. VERIFY(is<VariableDeclaration>(*declaration));
  3879. auto& variables = static_cast<VariableDeclaration&>(*declaration);
  3880. VERIFY(variables.is_lexical_declaration());
  3881. for (auto& decl : variables.declarations()) {
  3882. decl.target().visit(
  3883. [&](NonnullRefPtr<Identifier> const& identifier) {
  3884. entries_with_location.append({ ExportEntry::named_export(identifier->string(), identifier->string()), identifier->source_range().start });
  3885. },
  3886. [&](NonnullRefPtr<BindingPattern> const& binding) {
  3887. binding->for_each_bound_name([&](auto& name) {
  3888. entries_with_location.append({ ExportEntry::named_export(name, name), decl_position });
  3889. });
  3890. });
  3891. }
  3892. }
  3893. expression = declaration;
  3894. } else if (match(TokenType::Var)) {
  3895. auto variable_position = position();
  3896. auto variable_declaration = parse_variable_declaration();
  3897. m_state.current_scope_pusher->add_declaration(variable_declaration);
  3898. for (auto& decl : variable_declaration->declarations()) {
  3899. decl.target().visit(
  3900. [&](NonnullRefPtr<Identifier> const& identifier) {
  3901. entries_with_location.append({ ExportEntry::named_export(identifier->string(), identifier->string()), identifier->source_range().start });
  3902. },
  3903. [&](NonnullRefPtr<BindingPattern> const& binding) {
  3904. binding->for_each_bound_name([&](auto& name) {
  3905. entries_with_location.append({ ExportEntry::named_export(name, name), variable_position });
  3906. });
  3907. });
  3908. }
  3909. expression = variable_declaration;
  3910. } else if (match(TokenType::CurlyOpen)) {
  3911. consume(TokenType::CurlyOpen);
  3912. check_for_from = FromSpecifier::Optional;
  3913. // FIXME: Even when empty should add module to requiredModules!
  3914. while (!done() && !match(TokenType::CurlyClose)) {
  3915. auto identifier_position = position();
  3916. auto identifier = parse_module_export_name(true);
  3917. if (match_as()) {
  3918. consume(TokenType::Identifier);
  3919. auto export_name = parse_module_export_name(false);
  3920. entries_with_location.append({ ExportEntry::named_export(move(export_name), move(identifier)), identifier_position });
  3921. } else {
  3922. entries_with_location.append({ ExportEntry::named_export(identifier, identifier), identifier_position });
  3923. }
  3924. if (!match(TokenType::Comma))
  3925. break;
  3926. consume(TokenType::Comma);
  3927. }
  3928. if (entries_with_location.is_empty()) {
  3929. // export {} from "module"; Since this will never be a
  3930. // duplicate we can give a slightly wrong location.
  3931. entries_with_location.append({ ExportEntry::empty_named_export(), position() });
  3932. }
  3933. consume(TokenType::CurlyClose);
  3934. } else {
  3935. syntax_error("Unexpected token 'export'", rule_start.position());
  3936. }
  3937. if (check_for_from != FromSpecifier::NotAllowed && match_from()) {
  3938. consume(TokenType::Identifier);
  3939. from_specifier = parse_module_request();
  3940. } else if (check_for_from == FromSpecifier::Required) {
  3941. expected("from");
  3942. }
  3943. if (check_for_from != FromSpecifier::NotAllowed)
  3944. consume_or_insert_semicolon();
  3945. }
  3946. Vector<ExportStatement::ExportEntry> entries;
  3947. entries.ensure_capacity(entries_with_location.size());
  3948. for (auto& entry : entries_with_location) {
  3949. for (auto& export_statement : program.exports()) {
  3950. if (export_statement.has_export(entry.entry.export_name))
  3951. syntax_error(String::formatted("Duplicate export with name: '{}'", entry.entry.export_name), entry.position);
  3952. }
  3953. for (auto& new_entry : entries) {
  3954. if (new_entry.kind != ExportStatement::ExportEntry::Kind::EmptyNamedExport && new_entry.export_name == entry.entry.export_name)
  3955. syntax_error(String::formatted("Duplicate export with name: '{}'", entry.entry.export_name), entry.position);
  3956. }
  3957. entries.append(move(entry.entry));
  3958. }
  3959. return create_ast_node<ExportStatement>({ m_source_code, rule_start.position(), position() }, move(expression), move(entries), is_default, move(from_specifier));
  3960. }
  3961. Parser::ForbiddenTokens::ForbiddenTokens(std::initializer_list<TokenType> const& forbidden)
  3962. {
  3963. forbid_tokens(forbidden);
  3964. }
  3965. void Parser::ForbiddenTokens::forbid_tokens(std::initializer_list<TokenType> const& forbidden)
  3966. {
  3967. for (auto token : forbidden) {
  3968. switch (token) {
  3969. case TokenType::In:
  3970. m_forbid_in_token = true;
  3971. break;
  3972. case TokenType::DoubleAmpersand:
  3973. case TokenType::DoublePipe:
  3974. m_forbid_logical_tokens = true;
  3975. break;
  3976. case TokenType::DoubleQuestionMark:
  3977. m_forbid_coalesce_token = true;
  3978. break;
  3979. case TokenType::QuestionMarkPeriod:
  3980. m_forbid_question_mark_period = true;
  3981. break;
  3982. case TokenType::ParenOpen:
  3983. m_forbid_paren_open = true;
  3984. break;
  3985. case TokenType::Equals:
  3986. m_forbid_equals = true;
  3987. break;
  3988. default:
  3989. VERIFY_NOT_REACHED();
  3990. }
  3991. }
  3992. }
  3993. bool Parser::ForbiddenTokens::allows(TokenType token) const
  3994. {
  3995. switch (token) {
  3996. case TokenType::In:
  3997. return !m_forbid_in_token;
  3998. case TokenType::DoubleAmpersand:
  3999. case TokenType::DoublePipe:
  4000. return !m_forbid_logical_tokens;
  4001. case TokenType::DoubleQuestionMark:
  4002. return !m_forbid_coalesce_token;
  4003. case TokenType::QuestionMarkPeriod:
  4004. return !m_forbid_question_mark_period;
  4005. case TokenType::ParenOpen:
  4006. return !m_forbid_paren_open;
  4007. case TokenType::Equals:
  4008. return !m_forbid_equals;
  4009. default:
  4010. return true;
  4011. }
  4012. }
  4013. Parser::ForbiddenTokens Parser::ForbiddenTokens::merge(ForbiddenTokens other) const
  4014. {
  4015. ForbiddenTokens result = *this;
  4016. result.m_forbid_in_token |= other.m_forbid_in_token;
  4017. result.m_forbid_logical_tokens |= other.m_forbid_logical_tokens;
  4018. result.m_forbid_coalesce_token |= other.m_forbid_coalesce_token;
  4019. result.m_forbid_paren_open |= other.m_forbid_paren_open;
  4020. result.m_forbid_question_mark_period |= other.m_forbid_question_mark_period;
  4021. result.m_forbid_equals |= other.m_forbid_equals;
  4022. return result;
  4023. }
  4024. Parser::ForbiddenTokens Parser::ForbiddenTokens::forbid(std::initializer_list<TokenType> const& forbidden) const
  4025. {
  4026. ForbiddenTokens result = *this;
  4027. result.forbid_tokens(forbidden);
  4028. return result;
  4029. }
  4030. template NonnullRefPtr<FunctionExpression> Parser::parse_function_node(u16, Optional<Position> const&);
  4031. template NonnullRefPtr<FunctionDeclaration> Parser::parse_function_node(u16, Optional<Position> const&);
  4032. }