Parser.cpp 207 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755
  1. // Copyright (c) 2008 Roberto Raggi <[email protected]>
  2. //
  3. // Permission is hereby granted, free of charge, to any person obtaining a copy
  4. // of this software and associated documentation files (the "Software"), to deal
  5. // in the Software without restriction, including without limitation the rights
  6. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. // copies of the Software, and to permit persons to whom the Software is
  8. // furnished to do so, subject to the following conditions:
  9. //
  10. // The above copyright notice and this permission notice shall be included in
  11. // all copies or substantial portions of the Software.
  12. //
  13. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  14. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  15. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  16. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  17. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  18. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  19. // THE SOFTWARE.
  20. #include "Parser.h"
  21. #include "Token.h"
  22. #include "Lexer.h"
  23. #include "Control.h"
  24. #include "AST.h"
  25. #include "Literals.h"
  26. #include "ObjectiveCTypeQualifiers.h"
  27. #include "QtContextKeywords.h"
  28. #include <unordered_map>
  29. #include <utility>
  30. #include <string>
  31. #include <cstdio> // for putchar
  32. #if defined(_MSC_VER) && (_MSC_VER < 1800)
  33. # define va_copy(dst, src) ((dst) = (src))
  34. #elif defined(__INTEL_COMPILER) && !defined(va_copy)
  35. # define va_copy __va_copy
  36. #endif
  37. #define CPLUSPLUS_NO_DEBUG_RULE
  38. #define MAX_EXPRESSION_DEPTH 100
  39. #define MAX_STATEMENT_DEPTH 100
  40. using namespace CPlusPlus;
  41. namespace {
  42. class DebugRule {
  43. public:
  44. static int depth;
  45. DebugRule(const char *name, const char *spell, unsigned idx, bool blocked)
  46. {
  47. for (int i = 0; i <= depth; ++i)
  48. fputc('-', stderr);
  49. ++depth;
  50. fprintf(stderr, " %s, ahead: '%s' (%u) - block-errors: %d\n", name, spell, idx, blocked);
  51. }
  52. ~DebugRule()
  53. { --depth; }
  54. };
  55. int DebugRule::depth = 0;
  56. inline bool lookAtAssignmentOperator(int tokenKind)
  57. {
  58. switch (tokenKind) {
  59. case T_EQUAL:
  60. case T_AMPER_EQUAL:
  61. case T_CARET_EQUAL:
  62. case T_SLASH_EQUAL:
  63. case T_GREATER_GREATER_EQUAL:
  64. case T_LESS_LESS_EQUAL:
  65. case T_MINUS_EQUAL:
  66. case T_PERCENT_EQUAL:
  67. case T_PIPE_EQUAL:
  68. case T_PLUS_EQUAL:
  69. case T_STAR_EQUAL:
  70. case T_TILDE_EQUAL:
  71. return true;
  72. default:
  73. return false;
  74. } // switch
  75. }
  76. namespace Prec {
  77. enum {
  78. Unknown = 0,
  79. Comma = 1,
  80. Assignment = 2,
  81. Conditional = 3,
  82. LogicalOr = 4,
  83. LogicalAnd = 5,
  84. InclusiveOr = 6,
  85. ExclusiveOr = 7,
  86. And = 8,
  87. Equality = 9,
  88. Relational = 10,
  89. Shift = 11,
  90. Additive = 12,
  91. Multiplicative = 13,
  92. PointerToMember = 14
  93. };
  94. } // namespace Precedece
  95. inline int precedence(int tokenKind, bool templateArguments)
  96. {
  97. // ### this will/might need some tuning for C++0x
  98. // (see: [temp.names]p3)
  99. if (templateArguments && (tokenKind == T_GREATER || tokenKind == T_GREATER_GREATER))
  100. return -1;
  101. if (lookAtAssignmentOperator(tokenKind))
  102. return Prec::Assignment;
  103. switch (tokenKind) {
  104. case T_COMMA: return Prec::Comma;
  105. case T_QUESTION: return Prec::Conditional;
  106. case T_PIPE_PIPE: return Prec::LogicalOr;
  107. case T_AMPER_AMPER: return Prec::LogicalAnd;
  108. case T_PIPE: return Prec::InclusiveOr;
  109. case T_CARET: return Prec::ExclusiveOr;
  110. case T_AMPER: return Prec::And;
  111. case T_EQUAL_EQUAL:
  112. case T_EXCLAIM_EQUAL: return Prec::Equality;
  113. case T_GREATER:
  114. case T_LESS:
  115. case T_LESS_EQUAL:
  116. case T_GREATER_EQUAL: return Prec::Relational;
  117. case T_LESS_LESS:
  118. case T_GREATER_GREATER: return Prec::ExclusiveOr;
  119. case T_PLUS:
  120. case T_MINUS: return Prec::Additive;
  121. case T_STAR:
  122. case T_SLASH:
  123. case T_PERCENT: return Prec::Multiplicative;
  124. case T_ARROW_STAR:
  125. case T_DOT_STAR: return Prec::PointerToMember;
  126. default: return Prec::Unknown;
  127. }
  128. }
  129. inline bool isBinaryOperator(int tokenKind)
  130. { return precedence(tokenKind, false) != Prec::Unknown; }
  131. inline bool isRightAssociative(int tokenKind)
  132. {
  133. const int prec = precedence(tokenKind, false);
  134. return prec == Prec::Conditional || prec == Prec::Assignment;
  135. }
  136. } // end of anonymous namespace
  137. class Parser::ASTCache
  138. {
  139. ASTCache(const ASTCache &other);
  140. void operator =(const ASTCache &other);
  141. public:
  142. enum ASTKind {
  143. Expression,
  144. ExpressionList,
  145. ParameterDeclarationClause,
  146. TypeId
  147. };
  148. public:
  149. ASTCache() {}
  150. void insert(ASTKind astKind, unsigned tokenIndexBeforeParsing,
  151. AST *resultingAST, unsigned resultingTokenIndex, bool resultingReturnValue)
  152. {
  153. const auto key = std::make_pair(astKind, tokenIndexBeforeParsing);
  154. ParseFunctionResult result;
  155. result.resultingAST = resultingAST;
  156. result.resultingTokenIndex = resultingTokenIndex;
  157. result.returnValue = resultingReturnValue;
  158. const auto keyValue = std::make_pair(key, result);
  159. _cache.insert(keyValue);
  160. }
  161. AST *find(ASTKind astKind, unsigned tokenIndex,
  162. unsigned *resultingTokenIndex, bool *foundInCache, bool *returnValue) const
  163. {
  164. const auto key = std::make_pair(astKind, tokenIndex);
  165. const auto it = _cache.find(key);
  166. if (it == _cache.end()) {
  167. *foundInCache = false;
  168. return 0;
  169. } else {
  170. *foundInCache = true;
  171. *resultingTokenIndex = it->second.resultingTokenIndex;
  172. *returnValue = it->second.returnValue;
  173. return it->second.resultingAST;
  174. }
  175. }
  176. void clear()
  177. {
  178. _cache.clear();
  179. }
  180. private:
  181. struct KeyHasher {
  182. size_t operator()(const std::pair<int, unsigned> &key) const
  183. { return std::hash<int>()(key.first) ^ std::hash<unsigned>()(key.second); }
  184. };
  185. struct ParseFunctionResult {
  186. AST *resultingAST;
  187. unsigned resultingTokenIndex;
  188. bool returnValue;
  189. };
  190. typedef std::pair<int, unsigned> ASTKindAndTokenIndex;
  191. std::unordered_map<ASTKindAndTokenIndex, ParseFunctionResult, KeyHasher> _cache;
  192. };
  193. #ifndef CPLUSPLUS_NO_DEBUG_RULE
  194. # define DEBUG_THIS_RULE() DebugRule __debug_rule__(__func__, tok().spell(), cursor(), _translationUnit->blockErrors())
  195. inline void debugPrintCheckCache(bool goodCase)
  196. {
  197. for (int i = 0; i <= DebugRule::depth - 1; ++i)
  198. fputc('-', stderr);
  199. if (goodCase)
  200. fprintf(stderr, " CACHE: Re-using AST from Cache.\n");
  201. else
  202. fprintf(stderr, " CACHE: Already tried to parse this, skipping.\n");
  203. }
  204. #else
  205. # define DEBUG_THIS_RULE() do {} while (0)
  206. inline void debugPrintCheckCache(bool) {}
  207. #endif
  208. #define CHECK_CACHE(ASTKind, ASTType) \
  209. do { \
  210. bool foundInCache; \
  211. unsigned newTokenIndex; \
  212. bool returnValue; \
  213. if (AST *ast = _astCache->find(ASTKind, cursor(), \
  214. &newTokenIndex, &foundInCache, &returnValue)) { \
  215. debugPrintCheckCache(true); \
  216. node = (ASTType *) ast; \
  217. _tokenIndex = newTokenIndex; \
  218. return returnValue; \
  219. } else if (foundInCache) { \
  220. debugPrintCheckCache(false); \
  221. return returnValue; \
  222. } \
  223. } while (0)
  224. #define PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, minPrecedence) { \
  225. if (LA() == T_THROW) { \
  226. if (!parseThrowExpression(node)) \
  227. return false; \
  228. } else if (!parseCastExpression(node)) \
  229. return false; \
  230. \
  231. parseExpressionWithOperatorPrecedence(node, minPrecedence); \
  232. return true; \
  233. }
  234. Parser::Parser(TranslationUnit *unit)
  235. : _translationUnit(unit),
  236. _control(unit->control()),
  237. _pool(unit->memoryPool()),
  238. _languageFeatures(unit->languageFeatures()),
  239. _tokenIndex(1),
  240. _templateArguments(0),
  241. _inFunctionBody(false),
  242. _inExpressionStatement(false),
  243. _expressionDepth(0),
  244. _statementDepth(0),
  245. _astCache(new ASTCache),
  246. _expressionStatementAstCache(new ASTCache)
  247. { }
  248. Parser::~Parser()
  249. {
  250. delete _expressionStatementAstCache;
  251. delete _astCache;
  252. }
  253. bool Parser::switchTemplateArguments(bool templateArguments)
  254. {
  255. bool previousTemplateArguments = _templateArguments;
  256. _templateArguments = templateArguments;
  257. return previousTemplateArguments;
  258. }
  259. bool Parser::maybeSplitGreaterGreaterToken(int n)
  260. {
  261. return _translationUnit->maybeSplitGreaterGreaterToken(_tokenIndex + n - 1);
  262. }
  263. bool Parser::skipUntil(int token)
  264. {
  265. while (int tk = LA()) {
  266. if (tk == token)
  267. return true;
  268. consumeToken();
  269. }
  270. return false;
  271. }
  272. void Parser::skipUntilDeclaration()
  273. {
  274. for (; ; consumeToken()) {
  275. switch (LA()) {
  276. case T_EOF_SYMBOL:
  277. // end of a block
  278. case T_RBRACE:
  279. // names
  280. case T_IDENTIFIER:
  281. case T_COLON_COLON:
  282. case T_TILDE:
  283. case T_OPERATOR:
  284. // empty declaration
  285. case T_SEMICOLON:
  286. // member specification
  287. case T_USING:
  288. case T_TEMPLATE:
  289. case T_PUBLIC:
  290. case T_PROTECTED:
  291. case T_PRIVATE:
  292. case T_Q_SIGNALS:
  293. case T_Q_SLOTS:
  294. case T_Q_PROPERTY:
  295. case T_Q_PRIVATE_PROPERTY:
  296. case T_Q_ENUMS:
  297. case T_Q_FLAGS:
  298. case T_Q_INTERFACES:
  299. // Qt function specifiers
  300. case T_Q_SIGNAL:
  301. case T_Q_SLOT:
  302. case T_Q_INVOKABLE:
  303. // declarations
  304. case T_ENUM:
  305. case T_NAMESPACE:
  306. case T_INLINE:
  307. case T_STATIC_ASSERT:
  308. case T_ASM:
  309. case T_EXPORT:
  310. case T_AT_CLASS:
  311. case T_AT_INTERFACE:
  312. case T_AT_PROTOCOL:
  313. case T_AT_IMPLEMENTATION:
  314. case T_AT_END:
  315. return;
  316. default:
  317. if (lookAtBuiltinTypeSpecifier() || lookAtClassKey() ||
  318. lookAtFunctionSpecifier() || lookAtStorageClassSpecifier())
  319. return;
  320. } // switch
  321. }
  322. }
  323. bool Parser::skipUntilStatement()
  324. {
  325. while (int tk = LA()) {
  326. switch (tk) {
  327. case T_SEMICOLON:
  328. case T_LBRACE:
  329. case T_RBRACE:
  330. case T_CONST:
  331. case T_VOLATILE:
  332. case T_IDENTIFIER:
  333. case T_CASE:
  334. case T_DEFAULT:
  335. case T_IF:
  336. case T_SWITCH:
  337. case T_WHILE:
  338. case T_DO:
  339. case T_FOR:
  340. case T_BREAK:
  341. case T_CONTINUE:
  342. case T_RETURN:
  343. case T_GOTO:
  344. case T_TRY:
  345. case T_CATCH:
  346. case T_THROW:
  347. case T_CHAR:
  348. case T_CHAR16_T:
  349. case T_CHAR32_T:
  350. case T_WCHAR_T:
  351. case T_BOOL:
  352. case T_SHORT:
  353. case T_INT:
  354. case T_LONG:
  355. case T_SIGNED:
  356. case T_UNSIGNED:
  357. case T_FLOAT:
  358. case T_DOUBLE:
  359. case T_VOID:
  360. case T_CLASS:
  361. case T_STRUCT:
  362. case T_UNION:
  363. case T_ENUM:
  364. case T_COLON_COLON:
  365. case T_TEMPLATE:
  366. case T_USING:
  367. return true;
  368. case T_AT_TRY:
  369. case T_AT_SYNCHRONIZED:
  370. case T_AT_THROW:
  371. if (_languageFeatures.objCEnabled)
  372. return true;
  373. default:
  374. consumeToken();
  375. }
  376. }
  377. return false;
  378. }
  379. bool Parser::skip(int l, int r)
  380. {
  381. int count = 0;
  382. while (int tk = LA()) {
  383. if (tk == l)
  384. ++count;
  385. else if (tk == r)
  386. --count;
  387. else if (l != T_LBRACE && (tk == T_LBRACE ||
  388. tk == T_RBRACE ||
  389. tk == T_SEMICOLON))
  390. return false;
  391. if (count == 0)
  392. return true;
  393. consumeToken();
  394. }
  395. return false;
  396. }
  397. int Parser::find(int token, int stopAt)
  398. {
  399. for (int i = 1; ; ++i) {
  400. const int tk = LA(i);
  401. if (!tk || tk == stopAt)
  402. return 0;
  403. if (tk == token)
  404. return i;
  405. }
  406. return 0;
  407. }
  408. void Parser::match(int kind, unsigned *token)
  409. {
  410. if (LA() == kind)
  411. *token = consumeToken();
  412. else {
  413. *token = 0;
  414. error(_tokenIndex, "expected token `%s' got `%s'",
  415. Token::name(kind), tok().spell());
  416. }
  417. }
  418. bool Parser::parseClassOrNamespaceName(NameAST *&node)
  419. {
  420. DEBUG_THIS_RULE();
  421. if (LA() == T_IDENTIFIER && (LA(2) == T_COLON_COLON || LA(2) == T_LESS)) {
  422. unsigned identifier_token = cursor();
  423. if (LA(2) == T_LESS) {
  424. bool blocked = blockErrors(true);
  425. if (parseTemplateId(node) && LA() == T_COLON_COLON) {
  426. blockErrors(blocked);
  427. return true;
  428. }
  429. blockErrors(blocked);
  430. }
  431. rewind(identifier_token);
  432. if (LA(2) == T_COLON_COLON) {
  433. SimpleNameAST *ast = new (_pool) SimpleNameAST;
  434. ast->identifier_token = consumeToken();
  435. node = ast;
  436. return true;
  437. }
  438. } else if (LA() == T_TEMPLATE) {
  439. unsigned template_token = consumeToken();
  440. if (parseTemplateId(node, template_token) && LA() == T_COLON_COLON)
  441. return true;
  442. rewind(template_token);
  443. }
  444. return false;
  445. }
  446. bool Parser::parseTemplateId(NameAST *&node, unsigned template_token)
  447. {
  448. DEBUG_THIS_RULE();
  449. const unsigned start = cursor();
  450. if (LA() == T_IDENTIFIER && LA(2) == T_LESS) {
  451. TemplateIdAST *ast = new (_pool) TemplateIdAST;
  452. ast->template_token = template_token;
  453. ast->identifier_token = consumeToken();
  454. ast->less_token = consumeToken();
  455. if (maybeSplitGreaterGreaterToken() || LA() == T_GREATER || parseTemplateArgumentList(
  456. ast->template_argument_list)) {
  457. if (maybeSplitGreaterGreaterToken() || LA() == T_GREATER) {
  458. ast->greater_token = consumeToken();
  459. node = ast;
  460. return true;
  461. }
  462. }
  463. }
  464. rewind(start);
  465. return false;
  466. }
  467. bool Parser::parseNestedNameSpecifier(NestedNameSpecifierListAST *&node,
  468. bool /*acceptTemplateId*/)
  469. {
  470. DEBUG_THIS_RULE();
  471. NestedNameSpecifierListAST **nested_name_specifier = &node;
  472. NameAST *class_or_namespace_name = 0;
  473. if (parseClassOrNamespaceName(class_or_namespace_name) && LA() == T_COLON_COLON) {
  474. unsigned scope_token = consumeToken();
  475. NestedNameSpecifierAST *name = new (_pool) NestedNameSpecifierAST;
  476. name->class_or_namespace_name = class_or_namespace_name;
  477. name->scope_token = scope_token;
  478. *nested_name_specifier = new (_pool) NestedNameSpecifierListAST(name);
  479. nested_name_specifier = &(*nested_name_specifier)->next;
  480. while (parseClassOrNamespaceName(class_or_namespace_name) && LA() == T_COLON_COLON) {
  481. scope_token = consumeToken();
  482. name = new (_pool) NestedNameSpecifierAST;
  483. name->class_or_namespace_name = class_or_namespace_name;
  484. name->scope_token = scope_token;
  485. *nested_name_specifier = new (_pool) NestedNameSpecifierListAST(name);
  486. nested_name_specifier = &(*nested_name_specifier)->next;
  487. }
  488. // ### ugly hack
  489. rewind(scope_token);
  490. consumeToken();
  491. return true;
  492. }
  493. return false;
  494. }
  495. bool Parser::parseNestedNameSpecifierOpt(NestedNameSpecifierListAST *&name, bool acceptTemplateId)
  496. {
  497. DEBUG_THIS_RULE();
  498. unsigned start = cursor();
  499. if (! parseNestedNameSpecifier(name, acceptTemplateId))
  500. rewind(start);
  501. return true;
  502. }
  503. bool Parser::parseName(NameAST *&node, bool acceptTemplateId)
  504. {
  505. DEBUG_THIS_RULE();
  506. unsigned global_scope_token = 0;
  507. switch (LA()) {
  508. case T_COLON_COLON:
  509. case T_IDENTIFIER:
  510. case T_TILDE: // destructor-name-id
  511. case T_OPERATOR: // operator-name-id
  512. case T_TEMPLATE: // template introduced template-id
  513. break;
  514. default:
  515. return false;
  516. }
  517. if (LA() == T_COLON_COLON)
  518. global_scope_token = consumeToken();
  519. NestedNameSpecifierListAST *nested_name_specifier = 0;
  520. parseNestedNameSpecifierOpt(nested_name_specifier,
  521. /*acceptTemplateId=*/ true);
  522. NameAST *unqualified_name = 0;
  523. if (parseUnqualifiedName(unqualified_name,
  524. /*acceptTemplateId=*/ acceptTemplateId || nested_name_specifier != 0)) {
  525. if (! global_scope_token && ! nested_name_specifier) {
  526. node = unqualified_name;
  527. return true;
  528. }
  529. QualifiedNameAST *ast = new (_pool) QualifiedNameAST;
  530. ast->global_scope_token = global_scope_token;
  531. ast->nested_name_specifier_list = nested_name_specifier;
  532. ast->unqualified_name = unqualified_name;
  533. node = ast;
  534. return true;
  535. }
  536. return false;
  537. }
  538. bool Parser::parseTranslationUnit(TranslationUnitAST *&node)
  539. {
  540. DEBUG_THIS_RULE();
  541. TranslationUnitAST *ast = new (_pool) TranslationUnitAST;
  542. DeclarationListAST **decl = &ast->declaration_list;
  543. while (LA()) {
  544. unsigned start_declaration = cursor();
  545. DeclarationAST *declaration = 0;
  546. if (parseDeclaration(declaration)) {
  547. *decl = new (_pool) DeclarationListAST;
  548. (*decl)->value = declaration;
  549. decl = &(*decl)->next;
  550. } else {
  551. error(start_declaration, "expected a declaration");
  552. rewind(start_declaration + 1);
  553. skipUntilDeclaration();
  554. }
  555. if (TopLevelDeclarationProcessor *processor = _control->topLevelDeclarationProcessor()) {
  556. if (!processor->processDeclaration(declaration))
  557. break;
  558. }
  559. _templateArgumentList.clear();
  560. }
  561. node = ast;
  562. return true;
  563. }
  564. bool Parser::parseEmptyDeclaration(DeclarationAST *&node)
  565. {
  566. DEBUG_THIS_RULE();
  567. if (LA() == T_SEMICOLON) {
  568. EmptyDeclarationAST *ast = new (_pool) EmptyDeclarationAST;
  569. ast->semicolon_token = consumeToken();
  570. node = ast;
  571. return true;
  572. }
  573. return false;
  574. }
  575. bool Parser::parseDeclaration(DeclarationAST *&node)
  576. {
  577. DEBUG_THIS_RULE();
  578. switch (LA()) {
  579. case T_SEMICOLON:
  580. return parseEmptyDeclaration(node);
  581. case T_NAMESPACE:
  582. return parseNamespace(node);
  583. case T_USING:
  584. return parseUsing(node);
  585. case T_ASM:
  586. return parseAsmDefinition(node);
  587. case T_TEMPLATE:
  588. case T_EXPORT:
  589. return parseTemplateDeclaration(node);
  590. // ObjcC++
  591. case T_AT_CLASS:
  592. return parseObjCClassForwardDeclaration(node);
  593. case T_AT_INTERFACE:
  594. return parseObjCInterface(node);
  595. case T_AT_PROTOCOL:
  596. return parseObjCProtocol(node);
  597. case T_AT_IMPLEMENTATION:
  598. return parseObjCImplementation(node);
  599. case T_Q_DECLARE_INTERFACE:
  600. {
  601. consumeToken();
  602. unsigned lparen_token = 0;
  603. match(T_LPAREN, &lparen_token);
  604. NameAST *name = 0;
  605. parseName(name);
  606. unsigned comma_token = 0;
  607. match(T_COMMA, &comma_token);
  608. unsigned string_literal = 0;
  609. match(T_STRING_LITERAL, &string_literal);
  610. unsigned rparen_token = 0;
  611. match(T_RPAREN, &rparen_token);
  612. } return true;
  613. case T_AT_END:
  614. // TODO: should this be done here, or higher-up?
  615. error(cursor(), "skip stray token `%s'", tok().spell());
  616. consumeToken();
  617. break;
  618. case T_INLINE:
  619. if (_languageFeatures.cxx11Enabled && LA(2) == T_NAMESPACE)
  620. return parseNamespace(node);
  621. return parseSimpleDeclaration(node);
  622. case T_STATIC_ASSERT:
  623. if (_languageFeatures.cxx11Enabled)
  624. return parseStaticAssertDeclaration(node);
  625. return parseSimpleDeclaration(node);
  626. default: {
  627. if (_languageFeatures.objCEnabled && LA() == T___ATTRIBUTE__) {
  628. const unsigned start = cursor();
  629. SpecifierListAST *attributes = 0, **attr = &attributes;
  630. while (parseGnuAttributeSpecifier(*attr))
  631. attr = &(*attr)->next;
  632. if (LA() == T_AT_INTERFACE)
  633. return parseObjCInterface(node, attributes);
  634. else if (LA() == T_AT_PROTOCOL)
  635. return parseObjCProtocol(node, attributes);
  636. else if (LA() == T_AT_PROPERTY)
  637. return parseObjCPropertyDeclaration(node, attributes);
  638. rewind(start);
  639. }
  640. if (LA() == T_EXTERN && LA(2) == T_TEMPLATE)
  641. return parseTemplateDeclaration(node);
  642. else if (LA() == T_EXTERN && LA(2) == T_STRING_LITERAL)
  643. return parseLinkageSpecification(node);
  644. else
  645. return parseSimpleDeclaration(node);
  646. } break; // default
  647. } // end switch
  648. return false;
  649. }
  650. bool Parser::parseLinkageSpecification(DeclarationAST *&node)
  651. {
  652. DEBUG_THIS_RULE();
  653. if (LA() == T_EXTERN && LA(2) == T_STRING_LITERAL) {
  654. LinkageSpecificationAST *ast = new (_pool) LinkageSpecificationAST;
  655. ast->extern_token = consumeToken();
  656. ast->extern_type_token = consumeToken();
  657. if (LA() == T_LBRACE)
  658. parseLinkageBody(ast->declaration);
  659. else
  660. parseDeclaration(ast->declaration);
  661. node = ast;
  662. return true;
  663. }
  664. return false;
  665. }
  666. bool Parser::parseLinkageBody(DeclarationAST *&node)
  667. {
  668. DEBUG_THIS_RULE();
  669. if (LA() == T_LBRACE) {
  670. LinkageBodyAST *ast = new (_pool) LinkageBodyAST;
  671. ast->lbrace_token = consumeToken();
  672. DeclarationListAST **declaration_ptr = &ast->declaration_list;
  673. while (int tk = LA()) {
  674. if (tk == T_RBRACE)
  675. break;
  676. unsigned start_declaration = cursor();
  677. DeclarationAST *declaration = 0;
  678. if (parseDeclaration(declaration)) {
  679. *declaration_ptr = new (_pool) DeclarationListAST;
  680. (*declaration_ptr)->value = declaration;
  681. declaration_ptr = &(*declaration_ptr)->next;
  682. } else {
  683. error(start_declaration, "expected a declaration");
  684. rewind(start_declaration + 1);
  685. skipUntilDeclaration();
  686. }
  687. _templateArgumentList.clear();
  688. }
  689. match(T_RBRACE, &ast->rbrace_token);
  690. node = ast;
  691. return true;
  692. }
  693. return false;
  694. }
  695. bool Parser::parseStaticAssertDeclaration(DeclarationAST *&node)
  696. {
  697. DEBUG_THIS_RULE();
  698. if (LA() != T_STATIC_ASSERT)
  699. return false;
  700. StaticAssertDeclarationAST *ast = new (_pool) StaticAssertDeclarationAST;
  701. ast->static_assert_token = consumeToken();
  702. match(T_LPAREN, &ast->lparen_token);
  703. parseConstantExpression(ast->expression);
  704. match(T_COMMA, &ast->comma_token);
  705. parseStringLiteral(ast->string_literal);
  706. match(T_RPAREN, &ast->rparen_token);
  707. match(T_SEMICOLON, &ast->semicolon_token);
  708. node = ast;
  709. return true;
  710. }
  711. // ### rename parseNamespaceAliarOrDeclaration?
  712. bool Parser::parseNamespace(DeclarationAST *&node)
  713. {
  714. DEBUG_THIS_RULE();
  715. if (LA() != T_NAMESPACE && !(_languageFeatures.cxx11Enabled && LA() == T_INLINE && LA(2) == T_NAMESPACE))
  716. return false;
  717. unsigned inline_token = 0;
  718. if (_languageFeatures.cxx11Enabled && LA() == T_INLINE)
  719. inline_token = consumeToken();
  720. unsigned namespace_token = consumeToken();
  721. if (LA() == T_IDENTIFIER && LA(2) == T_EQUAL) {
  722. if (inline_token)
  723. warning(inline_token, "namespace alias cannot be inline");
  724. NamespaceAliasDefinitionAST *ast =
  725. new (_pool) NamespaceAliasDefinitionAST;
  726. ast->namespace_token = namespace_token;
  727. ast->namespace_name_token = consumeToken();
  728. ast->equal_token = consumeToken();
  729. parseName(ast->name);
  730. match(T_SEMICOLON, &ast->semicolon_token);
  731. node = ast;
  732. return true;
  733. }
  734. NamespaceAST *ast = new (_pool) NamespaceAST;
  735. ast->inline_token = inline_token;
  736. ast->namespace_token = namespace_token;
  737. if (LA() == T_IDENTIFIER)
  738. ast->identifier_token = consumeToken();
  739. parseOptionalAttributeSpecifierSequence(ast->attribute_list);
  740. if (LA() == T_LBRACE) {
  741. parseLinkageBody(ast->linkage_body);
  742. } else { // attempt to do error recovery
  743. unsigned pos = cursor();
  744. for (;LA() != T_EOF_SYMBOL; consumeToken()) {
  745. switch (LA()) {
  746. case T_IDENTIFIER:
  747. case T_POUND:
  748. case T_POUND_POUND:
  749. case T___ATTRIBUTE__:
  750. case T_LPAREN:
  751. case T_RPAREN:
  752. case T_DEFAULT:
  753. case T_PUBLIC:
  754. case T_PRIVATE:
  755. case T_PROTECTED:
  756. continue;
  757. }
  758. if (tok().isLiteral())
  759. continue;
  760. break;
  761. }
  762. if (LA() == T_LBRACE && parseLinkageBody(ast->linkage_body))
  763. warning(pos, "expected '{' before '%s'", _translationUnit->tokenAt(pos).spell());
  764. else
  765. rewind(pos);
  766. }
  767. node = ast;
  768. return true;
  769. }
  770. bool Parser::parseUsing(DeclarationAST *&node)
  771. {
  772. DEBUG_THIS_RULE();
  773. if (LA() != T_USING)
  774. return false;
  775. if (LA(2) == T_NAMESPACE)
  776. return parseUsingDirective(node);
  777. if (_languageFeatures.cxx11Enabled && LA(2) == T_IDENTIFIER && parseAliasDeclaration(node))
  778. return true;
  779. UsingAST *ast = new (_pool) UsingAST;
  780. ast->using_token = consumeToken();
  781. if (LA() == T_TYPENAME)
  782. ast->typename_token = consumeToken();
  783. parseName(ast->name);
  784. match(T_SEMICOLON, &ast->semicolon_token);
  785. node = ast;
  786. return true;
  787. }
  788. bool Parser::parseUsingDirective(DeclarationAST *&node)
  789. {
  790. DEBUG_THIS_RULE();
  791. if (LA() == T_USING && LA(2) == T_NAMESPACE) {
  792. UsingDirectiveAST *ast = new (_pool) UsingDirectiveAST;
  793. ast->using_token = consumeToken();
  794. ast->namespace_token = consumeToken();
  795. if (! parseName(ast->name))
  796. warning(cursor(), "expected `namespace name' before `%s'",
  797. tok().spell());
  798. match(T_SEMICOLON, &ast->semicolon_token);
  799. node = ast;
  800. return true;
  801. }
  802. return false;
  803. }
  804. // alias-declaration = 'using' identifier attribute-specifier-seq(opt) '=' type-id ';'
  805. bool Parser::parseAliasDeclaration(DeclarationAST *&node)
  806. {
  807. DEBUG_THIS_RULE();
  808. if (LA() != T_USING || LA(2) != T_IDENTIFIER)
  809. return false;
  810. if (!find(T_EQUAL, T_SEMICOLON))
  811. return false;
  812. AliasDeclarationAST *alias = new (_pool) AliasDeclarationAST;
  813. alias->using_token = consumeToken();
  814. SimpleNameAST *name = new (_pool) SimpleNameAST;
  815. name->identifier_token = consumeToken();
  816. alias->name = name;
  817. // ### attributes!
  818. while (LA() != T_EQUAL)
  819. consumeToken();
  820. alias->equal_token = consumeToken();
  821. ExpressionAST *expr = 0;
  822. parseTypeId(expr);
  823. if (expr)
  824. alias->typeId = expr->asTypeId();
  825. match(T_SEMICOLON, &alias->semicolon_token);
  826. node = alias;
  827. return true;
  828. }
  829. bool Parser::parseConversionFunctionId(NameAST *&node)
  830. {
  831. DEBUG_THIS_RULE();
  832. if (LA() != T_OPERATOR)
  833. return false;
  834. unsigned operator_token = consumeToken();
  835. SpecifierListAST *type_specifier = 0;
  836. if (! parseTypeSpecifier(type_specifier))
  837. return false;
  838. PtrOperatorListAST *ptr_operators = 0, **ptr_operators_tail = &ptr_operators;
  839. while (parsePtrOperator(*ptr_operators_tail))
  840. ptr_operators_tail = &(*ptr_operators_tail)->next;
  841. ConversionFunctionIdAST *ast = new (_pool) ConversionFunctionIdAST;
  842. ast->operator_token = operator_token;
  843. ast->type_specifier_list = type_specifier;
  844. ast->ptr_operator_list = ptr_operators;
  845. node = ast;
  846. return true;
  847. }
  848. bool Parser::parseOperatorFunctionId(NameAST *&node)
  849. {
  850. DEBUG_THIS_RULE();
  851. if (LA() != T_OPERATOR)
  852. return false;
  853. unsigned operator_token = consumeToken();
  854. OperatorAST *op = 0;
  855. if (! parseOperator(op))
  856. return false;
  857. OperatorFunctionIdAST *ast = new (_pool) OperatorFunctionIdAST;
  858. ast->operator_token = operator_token;
  859. ast->op = op;
  860. node = ast;
  861. return true;
  862. }
  863. Parser::TemplateArgumentListEntry *Parser::templateArgumentListEntry(unsigned tokenIndex)
  864. {
  865. std::map<unsigned, TemplateArgumentListEntry>::iterator it =_templateArgumentList.find(tokenIndex);
  866. if (it != _templateArgumentList.end())
  867. return &it->second;
  868. return 0;
  869. }
  870. bool Parser::parseTemplateArgumentList(ExpressionListAST *&node)
  871. {
  872. DEBUG_THIS_RULE();
  873. if (TemplateArgumentListEntry *entry = templateArgumentListEntry(cursor())) {
  874. rewind(entry->cursor);
  875. node = entry->ast;
  876. return entry->ast != 0;
  877. }
  878. unsigned start = cursor();
  879. ExpressionListAST **template_argument_ptr = &node;
  880. ExpressionAST *template_argument = 0;
  881. const bool cxx11Enabled = _languageFeatures.cxx11Enabled;
  882. if (parseTemplateArgument(template_argument)) {
  883. *template_argument_ptr = new (_pool) ExpressionListAST;
  884. (*template_argument_ptr)->value = template_argument;
  885. template_argument_ptr = &(*template_argument_ptr)->next;
  886. if (cxx11Enabled && LA() == T_DOT_DOT_DOT)
  887. consumeToken(); // ### store this token in the AST
  888. while (LA() == T_COMMA) {
  889. consumeToken(); // consume T_COMMA
  890. if (parseTemplateArgument(template_argument)) {
  891. *template_argument_ptr = new (_pool) ExpressionListAST;
  892. (*template_argument_ptr)->value = template_argument;
  893. template_argument_ptr = &(*template_argument_ptr)->next;
  894. if (cxx11Enabled && LA() == T_DOT_DOT_DOT)
  895. consumeToken(); // ### store this token in the AST
  896. }
  897. }
  898. if (_pool != _translationUnit->memoryPool()) {
  899. MemoryPool *pool = _translationUnit->memoryPool();
  900. ExpressionListAST *template_argument_list = node;
  901. for (ExpressionListAST *iter = template_argument_list, **ast_iter = &node;
  902. iter; iter = iter->next, ast_iter = &(*ast_iter)->next)
  903. *ast_iter = new (pool) ExpressionListAST((iter->value) ? iter->value->clone(pool) : 0);
  904. }
  905. _templateArgumentList.insert(std::make_pair(start, TemplateArgumentListEntry(start, cursor(), node)));
  906. return true;
  907. }
  908. _templateArgumentList.insert(std::make_pair(start, TemplateArgumentListEntry(start, cursor(), 0)));
  909. return false;
  910. }
  911. bool Parser::parseAsmDefinition(DeclarationAST *&node)
  912. {
  913. DEBUG_THIS_RULE();
  914. if (LA() != T_ASM)
  915. return false;
  916. AsmDefinitionAST *ast = new (_pool) AsmDefinitionAST;
  917. ast->asm_token = consumeToken();
  918. if (LA() == T_VOLATILE)
  919. ast->volatile_token = consumeToken();
  920. match(T_LPAREN, &ast->lparen_token);
  921. unsigned string_literal_token = 0;
  922. match(T_STRING_LITERAL, &string_literal_token);
  923. while (LA() == T_STRING_LITERAL) {
  924. consumeToken();
  925. }
  926. if (LA() == T_COLON) {
  927. consumeToken(); // skip T_COLON
  928. parseAsmOperandList();
  929. if (LA() == T_COLON) {
  930. consumeToken();
  931. parseAsmOperandList();
  932. if (LA() == T_COLON) {
  933. consumeToken();
  934. parseAsmClobberList();
  935. }
  936. } else if (LA() == T_COLON_COLON) {
  937. consumeToken();
  938. parseAsmClobberList();
  939. }
  940. } else if (LA() == T_COLON_COLON) {
  941. consumeToken();
  942. parseAsmOperandList();
  943. if (LA() == T_COLON) {
  944. consumeToken();
  945. parseAsmClobberList();
  946. }
  947. }
  948. match(T_RPAREN, &ast->rparen_token);
  949. match(T_SEMICOLON, &ast->semicolon_token);
  950. node = ast;
  951. return true;
  952. }
  953. bool Parser::parseAsmOperandList()
  954. {
  955. DEBUG_THIS_RULE();
  956. if (LA() != T_STRING_LITERAL)
  957. return true;
  958. if (parseAsmOperand()) {
  959. while (LA() == T_COMMA) {
  960. consumeToken();
  961. parseAsmOperand();
  962. }
  963. return true;
  964. }
  965. return false;
  966. }
  967. bool Parser::parseAsmOperand()
  968. {
  969. DEBUG_THIS_RULE();
  970. unsigned string_literal_token = 0;
  971. match(T_STRING_LITERAL, &string_literal_token);
  972. if (LA() == T_LBRACKET) {
  973. /*unsigned lbracket_token = */ consumeToken();
  974. match(T_STRING_LITERAL, &string_literal_token);
  975. unsigned rbracket_token = 0;
  976. match(T_RBRACKET, &rbracket_token);
  977. }
  978. unsigned lparen_token = 0, rparen_token = 0;
  979. match(T_LPAREN, &lparen_token);
  980. ExpressionAST *expression = 0;
  981. parseExpression(expression);
  982. match(T_RPAREN, &rparen_token);
  983. return true;
  984. }
  985. bool Parser::parseAsmClobberList()
  986. {
  987. DEBUG_THIS_RULE();
  988. if (LA() != T_STRING_LITERAL)
  989. return false;
  990. unsigned string_literal_token = consumeToken();
  991. while (LA() == T_COMMA) {
  992. consumeToken();
  993. match(T_STRING_LITERAL, &string_literal_token);
  994. }
  995. return true;
  996. }
  997. bool Parser::parseTemplateDeclaration(DeclarationAST *&node)
  998. {
  999. DEBUG_THIS_RULE();
  1000. if (! (LA(1) == T_TEMPLATE || ((LA(1) == T_EXPORT || LA(1) == T_EXTERN)
  1001. && LA(2) == T_TEMPLATE)))
  1002. return false;
  1003. TemplateDeclarationAST *ast = new (_pool) TemplateDeclarationAST;
  1004. if (LA() == T_EXPORT || LA() == T_EXTERN)
  1005. ast->export_token = consumeToken();
  1006. ast->template_token = consumeToken();
  1007. if (LA() == T_LESS) {
  1008. ast->less_token = consumeToken();
  1009. if (maybeSplitGreaterGreaterToken() || LA() == T_GREATER || parseTemplateParameterList(ast->template_parameter_list))
  1010. match(T_GREATER, &ast->greater_token);
  1011. }
  1012. while (LA()) {
  1013. unsigned start_declaration = cursor();
  1014. ast->declaration = 0;
  1015. if (parseDeclaration(ast->declaration))
  1016. break;
  1017. error(start_declaration, "expected a declaration");
  1018. rewind(start_declaration + 1);
  1019. skipUntilDeclaration();
  1020. }
  1021. node = ast;
  1022. return true;
  1023. }
  1024. bool Parser::parseOperator(OperatorAST *&node) // ### FIXME
  1025. {
  1026. DEBUG_THIS_RULE();
  1027. OperatorAST *ast = new (_pool) OperatorAST;
  1028. switch (LA()) {
  1029. case T_NEW:
  1030. case T_DELETE: {
  1031. ast->op_token = consumeToken();
  1032. if (LA() == T_LBRACKET) {
  1033. ast->open_token = consumeToken();
  1034. match(T_RBRACKET, &ast->close_token);
  1035. }
  1036. } break;
  1037. case T_PLUS:
  1038. case T_MINUS:
  1039. case T_STAR:
  1040. case T_SLASH:
  1041. case T_PERCENT:
  1042. case T_CARET:
  1043. case T_AMPER:
  1044. case T_PIPE:
  1045. case T_TILDE:
  1046. case T_EXCLAIM:
  1047. case T_LESS:
  1048. case T_GREATER:
  1049. case T_COMMA:
  1050. case T_AMPER_EQUAL:
  1051. case T_CARET_EQUAL:
  1052. case T_SLASH_EQUAL:
  1053. case T_EQUAL:
  1054. case T_EQUAL_EQUAL:
  1055. case T_EXCLAIM_EQUAL:
  1056. case T_GREATER_EQUAL:
  1057. case T_GREATER_GREATER_EQUAL:
  1058. case T_LESS_EQUAL:
  1059. case T_LESS_LESS_EQUAL:
  1060. case T_MINUS_EQUAL:
  1061. case T_PERCENT_EQUAL:
  1062. case T_PIPE_EQUAL:
  1063. case T_PLUS_EQUAL:
  1064. case T_STAR_EQUAL:
  1065. case T_TILDE_EQUAL:
  1066. case T_LESS_LESS:
  1067. case T_GREATER_GREATER:
  1068. case T_AMPER_AMPER:
  1069. case T_PIPE_PIPE:
  1070. case T_PLUS_PLUS:
  1071. case T_MINUS_MINUS:
  1072. case T_ARROW_STAR:
  1073. case T_DOT_STAR:
  1074. case T_ARROW:
  1075. ast->op_token = consumeToken();
  1076. break;
  1077. default:
  1078. if (LA() == T_LPAREN && LA(2) == T_RPAREN) {
  1079. ast->op_token = ast->open_token = consumeToken();
  1080. ast->close_token = consumeToken();
  1081. } else if (LA() == T_LBRACKET && LA(2) == T_RBRACKET) {
  1082. ast->op_token = ast->open_token = consumeToken();
  1083. ast->close_token = consumeToken();
  1084. } else {
  1085. return false;
  1086. }
  1087. }
  1088. node = ast;
  1089. return true;
  1090. }
  1091. bool Parser::parseCvQualifiers(SpecifierListAST *&node)
  1092. {
  1093. DEBUG_THIS_RULE();
  1094. unsigned start = cursor();
  1095. SpecifierListAST **ast = &node;
  1096. while (*ast)
  1097. ast = &(*ast)->next;
  1098. while (int tk = LA()) {
  1099. if (tk == T_CONST || tk == T_VOLATILE) {
  1100. SimpleSpecifierAST *spec = new (_pool) SimpleSpecifierAST;
  1101. spec->specifier_token = consumeToken();
  1102. *ast = new (_pool) SpecifierListAST(spec);
  1103. ast = &(*ast)->next;
  1104. } else if (parseOptionalAttributeSpecifierSequence(*ast)) {
  1105. continue;
  1106. } else {
  1107. break;
  1108. }
  1109. }
  1110. return start != cursor();
  1111. }
  1112. bool Parser::parseRefQualifier(unsigned &ref_qualifier)
  1113. {
  1114. DEBUG_THIS_RULE();
  1115. if (!_languageFeatures.cxx11Enabled)
  1116. return false;
  1117. if (LA() == T_AMPER || LA() == T_AMPER_AMPER) {
  1118. ref_qualifier = consumeToken();
  1119. return true;
  1120. }
  1121. return false;
  1122. }
  1123. /**
  1124. * \brief Handles override and final from C++ 2011, they are pseudo keywords and has special meaning only in function declaration
  1125. */
  1126. bool Parser::parseOverrideFinalQualifiers(SpecifierListAST *&node)
  1127. {
  1128. DEBUG_THIS_RULE();
  1129. if (!_languageFeatures.cxx11Enabled)
  1130. return false;
  1131. unsigned start = cursor();
  1132. SpecifierListAST **ast = &node;
  1133. while (*ast)
  1134. ast = &(*ast)->next;
  1135. while (LA() == T_IDENTIFIER) {
  1136. const Identifier &id = *(_translationUnit->tokenAt(cursor()).identifier);
  1137. if (id.equalTo(_control->cpp11Override())
  1138. || id.equalTo(_control->cpp11Final())) {
  1139. SimpleSpecifierAST *spec = new (_pool) SimpleSpecifierAST;
  1140. spec->specifier_token = consumeToken();
  1141. *ast = new (_pool) SpecifierListAST(spec);
  1142. ast = &(*ast)->next;
  1143. }
  1144. else {
  1145. break;
  1146. }
  1147. }
  1148. return (start != cursor());
  1149. }
  1150. bool Parser::parsePtrOperator(PtrOperatorListAST *&node)
  1151. {
  1152. DEBUG_THIS_RULE();
  1153. if (LA() == T_AMPER || (_languageFeatures.cxx11Enabled && LA() == T_AMPER_AMPER)) {
  1154. ReferenceAST *ast = new (_pool) ReferenceAST;
  1155. ast->reference_token = consumeToken();
  1156. node = new (_pool) PtrOperatorListAST(ast);
  1157. return true;
  1158. } else if (LA() == T_STAR) {
  1159. PointerAST *ast = new (_pool) PointerAST;
  1160. ast->star_token = consumeToken();
  1161. parseCvQualifiers(ast->cv_qualifier_list);
  1162. node = new (_pool) PtrOperatorListAST(ast);
  1163. return true;
  1164. } else if (LA() == T_COLON_COLON || LA() == T_IDENTIFIER) {
  1165. unsigned scope_or_identifier_token = cursor();
  1166. unsigned global_scope_token = 0;
  1167. if (LA() == T_COLON_COLON)
  1168. global_scope_token = consumeToken();
  1169. NestedNameSpecifierListAST *nested_name_specifiers = 0;
  1170. bool has_nested_name_specifier = parseNestedNameSpecifier(nested_name_specifiers, true);
  1171. if (has_nested_name_specifier && LA() == T_STAR) {
  1172. PointerToMemberAST *ast = new (_pool) PointerToMemberAST;
  1173. ast->global_scope_token = global_scope_token;
  1174. ast->nested_name_specifier_list = nested_name_specifiers;
  1175. ast->star_token = consumeToken();
  1176. parseCvQualifiers(ast->cv_qualifier_list);
  1177. node = new (_pool) PtrOperatorListAST(ast);
  1178. return true;
  1179. }
  1180. rewind(scope_or_identifier_token);
  1181. }
  1182. return false;
  1183. }
  1184. bool Parser::parseTemplateArgument(ExpressionAST *&node)
  1185. {
  1186. DEBUG_THIS_RULE();
  1187. unsigned start = cursor();
  1188. if (parseTypeId(node)) {
  1189. int index = 1;
  1190. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  1191. index = 2;
  1192. if (LA(index) == T_COMMA || maybeSplitGreaterGreaterToken(index) || LA(index) == T_GREATER)
  1193. return true;
  1194. }
  1195. rewind(start);
  1196. bool previousTemplateArguments = switchTemplateArguments(true);
  1197. bool parsed = parseConstantExpression(node);
  1198. (void) switchTemplateArguments(previousTemplateArguments);
  1199. return parsed;
  1200. }
  1201. /** Parses a sequence of
  1202. *
  1203. * storage-class-specifier (unless noStorageSpecifier is true)
  1204. * trailing-type-specifier, which contains
  1205. * cv-qualifier
  1206. * simple-type-specifier
  1207. * typename-specifier
  1208. * elaborated-type-specifier
  1209. *
  1210. * If onlySimpleTypeSpecifiers is true, it only eats simple-type-specifiers
  1211. * and cv-qualifiers.
  1212. */
  1213. bool Parser::parseDeclSpecifierSeq(SpecifierListAST *&decl_specifier_seq,
  1214. bool noStorageSpecifiers,
  1215. bool onlySimpleTypeSpecifiers)
  1216. {
  1217. DEBUG_THIS_RULE();
  1218. bool has_type_specifier = false;
  1219. NameAST *named_type_specifier = 0;
  1220. SpecifierListAST **decl_specifier_seq_ptr = &decl_specifier_seq;
  1221. for (;;) {
  1222. if (! noStorageSpecifiers && ! onlySimpleTypeSpecifiers && lookAtStorageClassSpecifier()) {
  1223. // storage-class-specifier
  1224. SimpleSpecifierAST *spec = new (_pool) SimpleSpecifierAST;
  1225. spec->specifier_token = consumeToken();
  1226. *decl_specifier_seq_ptr = new (_pool) SpecifierListAST(spec);
  1227. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  1228. } else if (lookAtCVQualifier()) {
  1229. // cv-qualifier
  1230. SimpleSpecifierAST *spec = new (_pool) SimpleSpecifierAST;
  1231. spec->specifier_token = consumeToken();
  1232. *decl_specifier_seq_ptr = new (_pool) SpecifierListAST(spec);
  1233. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  1234. } else if (! named_type_specifier && lookAtBuiltinTypeSpecifier()) {
  1235. // parts of simple-type-specifier
  1236. parseBuiltinTypeSpecifier(*decl_specifier_seq_ptr);
  1237. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  1238. has_type_specifier = true;
  1239. } else if (! has_type_specifier && (LA() == T_COLON_COLON ||
  1240. LA() == T_IDENTIFIER)) {
  1241. // parts of simple-type-specifier
  1242. if (! parseName(named_type_specifier))
  1243. return false;
  1244. NamedTypeSpecifierAST *spec = new (_pool) NamedTypeSpecifierAST;
  1245. spec->name = named_type_specifier;
  1246. *decl_specifier_seq_ptr = new (_pool) SpecifierListAST(spec);
  1247. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  1248. has_type_specifier = true;
  1249. } else if (! onlySimpleTypeSpecifiers && ! has_type_specifier &&
  1250. (LA() == T_TYPENAME || LA() == T_ENUM || lookAtClassKey())) {
  1251. // typename-specifier, elaborated-type-specifier
  1252. unsigned startOfElaboratedTypeSpecifier = cursor();
  1253. if (! parseElaboratedTypeSpecifier(*decl_specifier_seq_ptr)) {
  1254. error(startOfElaboratedTypeSpecifier, "expected an elaborated type specifier");
  1255. break;
  1256. }
  1257. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  1258. has_type_specifier = true;
  1259. } else
  1260. break;
  1261. }
  1262. return decl_specifier_seq != 0;
  1263. }
  1264. bool Parser::parseDeclaratorOrAbstractDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list)
  1265. {
  1266. DEBUG_THIS_RULE();
  1267. unsigned start = cursor();
  1268. bool blocked = blockErrors(true);
  1269. if (parseDeclarator(node, decl_specifier_list)) {
  1270. blockErrors(blocked);
  1271. return true;
  1272. }
  1273. blockErrors(blocked);
  1274. rewind(start);
  1275. return parseAbstractDeclarator(node, decl_specifier_list);
  1276. }
  1277. bool Parser::parseCoreDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list, ClassSpecifierAST *)
  1278. {
  1279. DEBUG_THIS_RULE();
  1280. unsigned start = cursor();
  1281. SpecifierListAST *attributes = 0;
  1282. parseOptionalAttributeSpecifierSequence(attributes);
  1283. PtrOperatorListAST *ptr_operators = 0, **ptr_operators_tail = &ptr_operators;
  1284. while (parsePtrOperator(*ptr_operators_tail))
  1285. ptr_operators_tail = &(*ptr_operators_tail)->next;
  1286. if (LA() == T_COLON_COLON || LA() == T_IDENTIFIER || LA() == T_TILDE || LA() == T_OPERATOR
  1287. || (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT && (LA(2) == T_COLON_COLON || LA(2) == T_IDENTIFIER))) {
  1288. unsigned dot_dot_dot_token = 0;
  1289. if (LA() == T_DOT_DOT_DOT)
  1290. dot_dot_dot_token = consumeToken();
  1291. NameAST *name = 0;
  1292. if (parseName(name)) {
  1293. DeclaratorIdAST *declarator_id = new (_pool) DeclaratorIdAST;
  1294. declarator_id->dot_dot_dot_token = dot_dot_dot_token;
  1295. declarator_id->name = name;
  1296. DeclaratorAST *ast = new (_pool) DeclaratorAST;
  1297. ast->attribute_list = attributes;
  1298. ast->ptr_operator_list = ptr_operators;
  1299. ast->core_declarator = declarator_id;
  1300. node = ast;
  1301. return true;
  1302. }
  1303. } else if (decl_specifier_list && LA() == T_LPAREN) {
  1304. if (attributes)
  1305. warning(attributes->firstToken(), "unexpected attribtues");
  1306. unsigned lparen_token = consumeToken();
  1307. DeclaratorAST *declarator = 0;
  1308. if (parseDeclarator(declarator, decl_specifier_list) && LA() == T_RPAREN) {
  1309. NestedDeclaratorAST *nested_declarator = new (_pool) NestedDeclaratorAST;
  1310. nested_declarator->lparen_token = lparen_token;
  1311. nested_declarator->declarator = declarator;
  1312. nested_declarator->rparen_token = consumeToken();
  1313. DeclaratorAST *ast = new (_pool) DeclaratorAST;
  1314. ast->ptr_operator_list = ptr_operators;
  1315. ast->core_declarator = nested_declarator;
  1316. node = ast;
  1317. return true;
  1318. }
  1319. }
  1320. rewind(start);
  1321. return false;
  1322. }
  1323. static bool maybeCppInitializer(DeclaratorAST *declarator)
  1324. {
  1325. if (declarator->ptr_operator_list)
  1326. return false;
  1327. CoreDeclaratorAST *core_declarator = declarator->core_declarator;
  1328. if (! core_declarator)
  1329. return false;
  1330. DeclaratorIdAST *declarator_id = core_declarator->asDeclaratorId();
  1331. if (! declarator_id)
  1332. return false;
  1333. else if (! declarator_id->name)
  1334. return false;
  1335. else if (! declarator_id->name->asSimpleName())
  1336. return false;
  1337. return true;
  1338. }
  1339. bool Parser::parseDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list, ClassSpecifierAST *declaringClass)
  1340. {
  1341. DEBUG_THIS_RULE();
  1342. if (! parseCoreDeclarator(node, decl_specifier_list, declaringClass))
  1343. return false;
  1344. PostfixDeclaratorListAST **postfix_ptr = &node->postfix_declarator_list;
  1345. for (;;) {
  1346. unsigned startOfPostDeclarator = cursor();
  1347. if (LA() == T_LPAREN) {
  1348. if (! declaringClass && LA(2) != T_RPAREN && maybeCppInitializer(node)) {
  1349. unsigned lparen_token = cursor();
  1350. ExpressionAST *initializer = 0;
  1351. bool blocked = blockErrors(true);
  1352. if (parseInitializer(initializer, &node->equal_token)) {
  1353. // maybe the initializer also parses as a FunctionDeclarator?
  1354. ExpressionListParenAST *expr = 0;
  1355. if (initializer)
  1356. expr = initializer->asExpressionListParen();
  1357. if (expr) {
  1358. if (expr->expression_list && expr->rparen_token && (LA() == T_COMMA || LA() == T_SEMICOLON)) {
  1359. rewind(lparen_token);
  1360. // check for ambiguous declarators.
  1361. consumeToken();
  1362. ParameterDeclarationClauseAST *parameter_declaration_clause = 0;
  1363. if (parseParameterDeclarationClause(parameter_declaration_clause) && LA() == T_RPAREN) {
  1364. unsigned rparen_token = consumeToken();
  1365. FunctionDeclaratorAST *ast = new (_pool) FunctionDeclaratorAST;
  1366. ast->lparen_token = lparen_token;
  1367. ast->parameter_declaration_clause = parameter_declaration_clause;
  1368. ast->as_cpp_initializer = initializer;
  1369. ast->rparen_token = rparen_token;
  1370. *postfix_ptr = new (_pool) PostfixDeclaratorListAST(ast);
  1371. blockErrors(blocked);
  1372. return true;
  1373. }
  1374. blockErrors(blocked);
  1375. rewind(lparen_token);
  1376. return true;
  1377. }
  1378. }
  1379. }
  1380. blockErrors(blocked);
  1381. rewind(lparen_token);
  1382. }
  1383. FunctionDeclaratorAST *ast = new (_pool) FunctionDeclaratorAST;
  1384. ast->lparen_token = consumeToken();
  1385. parseParameterDeclarationClause(ast->parameter_declaration_clause);
  1386. if (LA() != T_RPAREN) {
  1387. rewind(startOfPostDeclarator);
  1388. break;
  1389. }
  1390. ast->rparen_token = consumeToken();
  1391. // ### parse attributes
  1392. parseCvQualifiers(ast->cv_qualifier_list);
  1393. parseRefQualifier(ast->ref_qualifier_token);
  1394. parseExceptionSpecification(ast->exception_specification);
  1395. if (_languageFeatures.cxx11Enabled && ! node->ptr_operator_list && LA() == T_ARROW) {
  1396. // only allow if there is 1 type spec, which has to be 'auto'
  1397. bool hasAuto = false;
  1398. for (SpecifierListAST *iter = decl_specifier_list; !hasAuto && iter; iter = iter->next) {
  1399. SpecifierAST *spec = iter->value;
  1400. if (SimpleSpecifierAST *simpleSpec = spec->asSimpleSpecifier()) {
  1401. if (_translationUnit->tokenKind(simpleSpec->specifier_token) == T_AUTO)
  1402. hasAuto = true;
  1403. }
  1404. }
  1405. if (hasAuto)
  1406. parseTrailingReturnType(ast->trailing_return_type);
  1407. }
  1408. parseOverrideFinalQualifiers(ast->cv_qualifier_list);
  1409. *postfix_ptr = new (_pool) PostfixDeclaratorListAST(ast);
  1410. postfix_ptr = &(*postfix_ptr)->next;
  1411. } else if (LA() == T_LBRACKET) {
  1412. ArrayDeclaratorAST *ast = new (_pool) ArrayDeclaratorAST;
  1413. ast->lbracket_token = consumeToken();
  1414. if (LA() == T_RBRACKET || parseConstantExpression(ast->expression))
  1415. match(T_RBRACKET, &ast->rbracket_token);
  1416. *postfix_ptr = new (_pool) PostfixDeclaratorListAST(ast);
  1417. postfix_ptr = &(*postfix_ptr)->next;
  1418. } else
  1419. break;
  1420. }
  1421. if (LA() == T___ASM__ && LA(2) == T_LPAREN) { // ### store the asm specifier in the AST
  1422. consumeToken(); // skip __asm__
  1423. consumeToken(); // skip T_LPAREN
  1424. if (skipUntil(T_RPAREN))
  1425. consumeToken(); // skip T_RPAREN
  1426. }
  1427. parseOptionalAttributeSpecifierSequence(node->post_attribute_list);
  1428. return true;
  1429. }
  1430. bool Parser::parseAbstractCoreDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list)
  1431. {
  1432. DEBUG_THIS_RULE();
  1433. PtrOperatorListAST *ptr_operators = 0, **ptr_operators_tail = &ptr_operators;
  1434. while (parsePtrOperator(*ptr_operators_tail))
  1435. ptr_operators_tail = &(*ptr_operators_tail)->next;
  1436. unsigned after_ptr_operators = cursor();
  1437. if (LA() == T_LPAREN && LA(2) != T_RPAREN) {
  1438. unsigned lparen_token = consumeToken();
  1439. DeclaratorAST *declarator = 0;
  1440. if (parseAbstractDeclarator(declarator, decl_specifier_list) && LA() == T_RPAREN) {
  1441. NestedDeclaratorAST *nested_declarator = new (_pool) NestedDeclaratorAST;
  1442. nested_declarator->lparen_token = lparen_token;
  1443. nested_declarator->declarator = declarator;
  1444. nested_declarator->rparen_token = consumeToken();
  1445. DeclaratorAST *ast = new (_pool) DeclaratorAST;
  1446. ast->ptr_operator_list = ptr_operators;
  1447. ast->core_declarator = nested_declarator;
  1448. node = ast;
  1449. return true;
  1450. }
  1451. }
  1452. rewind(after_ptr_operators);
  1453. if (ptr_operators) {
  1454. DeclaratorAST *ast = new (_pool) DeclaratorAST;
  1455. ast->ptr_operator_list = ptr_operators;
  1456. node = ast;
  1457. }
  1458. return true;
  1459. }
  1460. bool Parser::parseAbstractDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list)
  1461. {
  1462. DEBUG_THIS_RULE();
  1463. if (! parseAbstractCoreDeclarator(node, decl_specifier_list))
  1464. return false;
  1465. PostfixDeclaratorListAST *postfix_declarators = 0,
  1466. **postfix_ptr = &postfix_declarators;
  1467. for (;;) {
  1468. if (LA() == T_LPAREN) {
  1469. FunctionDeclaratorAST *ast = new (_pool) FunctionDeclaratorAST;
  1470. ast->lparen_token = consumeToken();
  1471. if (LA() == T_RPAREN || parseParameterDeclarationClause(ast->parameter_declaration_clause)) {
  1472. if (LA() == T_RPAREN)
  1473. ast->rparen_token = consumeToken();
  1474. }
  1475. parseCvQualifiers(ast->cv_qualifier_list);
  1476. parseRefQualifier(ast->ref_qualifier_token);
  1477. parseExceptionSpecification(ast->exception_specification);
  1478. *postfix_ptr = new (_pool) PostfixDeclaratorListAST(ast);
  1479. postfix_ptr = &(*postfix_ptr)->next;
  1480. } else if (LA() == T_LBRACKET) {
  1481. ArrayDeclaratorAST *ast = new (_pool) ArrayDeclaratorAST;
  1482. ast->lbracket_token = consumeToken();
  1483. if (LA() == T_RBRACKET || parseConstantExpression(ast->expression)) {
  1484. if (LA() == T_RBRACKET)
  1485. ast->rbracket_token = consumeToken();
  1486. }
  1487. *postfix_ptr = new (_pool) PostfixDeclaratorListAST(ast);
  1488. postfix_ptr = &(*postfix_ptr)->next;
  1489. } else
  1490. break;
  1491. }
  1492. if (postfix_declarators) {
  1493. if (! node)
  1494. node = new (_pool) DeclaratorAST;
  1495. node->postfix_declarator_list = postfix_declarators;
  1496. }
  1497. return true;
  1498. }
  1499. /**
  1500. * @brief Reads enumeration type declaration, examples:
  1501. * @code
  1502. enum {
  1503. debug = 1
  1504. };
  1505. enum class Format {
  1506. FormatPNG,
  1507. FormatJPEG
  1508. };
  1509. * @endcode
  1510. */
  1511. bool Parser::parseEnumSpecifier(SpecifierListAST *&node)
  1512. {
  1513. DEBUG_THIS_RULE();
  1514. if (LA() == T_ENUM) {
  1515. EnumSpecifierAST *ast = new (_pool) EnumSpecifierAST;
  1516. ast->enum_token = consumeToken();
  1517. if (_languageFeatures.cxx11Enabled && (LA() == T_CLASS || LA() == T_STRUCT))
  1518. ast->key_token = consumeToken();
  1519. parseName(ast->name);
  1520. if (_languageFeatures.cxx11Enabled && LA() == T_COLON) {
  1521. ast->colon_token = consumeToken();
  1522. parseTypeSpecifier(ast->type_specifier_list);
  1523. }
  1524. if (LA() == T_LBRACE) {
  1525. ast->lbrace_token = consumeToken();
  1526. unsigned comma_token = 0;
  1527. EnumeratorListAST **enumerator_ptr = &ast->enumerator_list;
  1528. while (int tk = LA()) {
  1529. if (tk == T_RBRACE)
  1530. break;
  1531. if (LA() != T_IDENTIFIER) {
  1532. error(cursor(), "expected identifier before '%s'", tok().spell());
  1533. skipUntil(T_IDENTIFIER);
  1534. }
  1535. if (parseEnumerator(*enumerator_ptr))
  1536. enumerator_ptr = &(*enumerator_ptr)->next;
  1537. if (LA() == T_COMMA && LA(2) == T_RBRACE)
  1538. ast->stray_comma_token = consumeToken();
  1539. if (LA() != T_RBRACE)
  1540. match(T_COMMA, &comma_token);
  1541. }
  1542. match(T_RBRACE, &ast->rbrace_token);
  1543. } else if (!_languageFeatures.cxx11Enabled) {
  1544. return false;
  1545. }
  1546. node = new (_pool) SpecifierListAST(ast);
  1547. return true;
  1548. }
  1549. return false;
  1550. }
  1551. bool Parser::parseTemplateParameterList(DeclarationListAST *&node)
  1552. {
  1553. DEBUG_THIS_RULE();
  1554. DeclarationListAST **template_parameter_ptr = &node;
  1555. DeclarationAST *declaration = 0;
  1556. if (parseTemplateParameter(declaration)) {
  1557. *template_parameter_ptr = new (_pool) DeclarationListAST;
  1558. (*template_parameter_ptr)->value = declaration;
  1559. template_parameter_ptr = &(*template_parameter_ptr)->next;
  1560. while (LA() == T_COMMA) {
  1561. consumeToken(); // XXX Store this token somewhere
  1562. declaration = 0;
  1563. if (parseTemplateParameter(declaration)) {
  1564. *template_parameter_ptr = new (_pool) DeclarationListAST;
  1565. (*template_parameter_ptr)->value = declaration;
  1566. template_parameter_ptr = &(*template_parameter_ptr)->next;
  1567. }
  1568. }
  1569. return true;
  1570. }
  1571. return false;
  1572. }
  1573. bool Parser::parseTemplateParameter(DeclarationAST *&node)
  1574. {
  1575. DEBUG_THIS_RULE();
  1576. if (parseTypeParameter(node))
  1577. return true;
  1578. bool previousTemplateArguments = switchTemplateArguments(true);
  1579. ParameterDeclarationAST *ast = 0;
  1580. bool parsed = parseParameterDeclaration(ast);
  1581. node = ast;
  1582. (void) switchTemplateArguments(previousTemplateArguments);
  1583. return parsed;
  1584. }
  1585. bool Parser::parseTypenameTypeParameter(DeclarationAST *&node)
  1586. {
  1587. DEBUG_THIS_RULE();
  1588. if (LA() == T_CLASS || LA() == T_TYPENAME) {
  1589. TypenameTypeParameterAST *ast = new (_pool) TypenameTypeParameterAST;
  1590. ast->classkey_token = consumeToken();
  1591. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  1592. ast->dot_dot_dot_token = consumeToken();
  1593. parseName(ast->name);
  1594. if (LA() == T_EQUAL) {
  1595. ast->equal_token = consumeToken();
  1596. parseTypeId(ast->type_id);
  1597. }
  1598. node = ast;
  1599. return true;
  1600. }
  1601. return false;
  1602. }
  1603. bool Parser::parseTemplateTypeParameter(DeclarationAST *&node)
  1604. {
  1605. DEBUG_THIS_RULE();
  1606. if (LA() == T_TEMPLATE) {
  1607. TemplateTypeParameterAST *ast = new (_pool) TemplateTypeParameterAST;
  1608. ast->template_token = consumeToken();
  1609. if (LA() == T_LESS)
  1610. ast->less_token = consumeToken();
  1611. parseTemplateParameterList(ast->template_parameter_list);
  1612. if (maybeSplitGreaterGreaterToken() || LA() == T_GREATER)
  1613. ast->greater_token = consumeToken();
  1614. if (LA() == T_CLASS)
  1615. ast->class_token = consumeToken();
  1616. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  1617. ast->dot_dot_dot_token = consumeToken();
  1618. // parse optional name
  1619. parseName(ast->name);
  1620. if (LA() == T_EQUAL) {
  1621. ast->equal_token = consumeToken();
  1622. parseTypeId(ast->type_id);
  1623. }
  1624. node = ast;
  1625. return true;
  1626. }
  1627. return false;
  1628. }
  1629. bool Parser::lookAtTypeParameter()
  1630. {
  1631. if (LA() == T_CLASS || LA() == T_TYPENAME) {
  1632. if (LA(2) == T_IDENTIFIER) {
  1633. switch (LA(3)) {
  1634. case T_EQUAL:
  1635. case T_COMMA:
  1636. case T_GREATER:
  1637. return true;
  1638. default:
  1639. return maybeSplitGreaterGreaterToken(3);
  1640. }
  1641. } else if (LA(2) == T_COLON_COLON) {
  1642. // found something like template <typename ::foo::bar>...
  1643. return false;
  1644. }
  1645. // recognized an anonymous template type parameter. e.g
  1646. // template <typename>
  1647. return true;
  1648. }
  1649. return false;
  1650. }
  1651. bool Parser::parseTypeParameter(DeclarationAST *&node)
  1652. {
  1653. DEBUG_THIS_RULE();
  1654. if (lookAtTypeParameter())
  1655. return parseTypenameTypeParameter(node);
  1656. else if (LA() == T_TEMPLATE)
  1657. return parseTemplateTypeParameter(node);
  1658. else
  1659. return false;
  1660. }
  1661. bool Parser::parseTypeId(ExpressionAST *&node)
  1662. {
  1663. DEBUG_THIS_RULE();
  1664. CHECK_CACHE(ASTCache::TypeId, ExpressionAST);
  1665. SpecifierListAST *type_specifier = 0;
  1666. if (parseTypeSpecifier(type_specifier)) {
  1667. TypeIdAST *ast = new (_pool) TypeIdAST;
  1668. ast->type_specifier_list = type_specifier;
  1669. parseAbstractDeclarator(ast->declarator, type_specifier);
  1670. node = ast;
  1671. return true;
  1672. }
  1673. return false;
  1674. }
  1675. bool Parser::parseParameterDeclarationClause(ParameterDeclarationClauseAST *&node)
  1676. {
  1677. DEBUG_THIS_RULE();
  1678. if (LA() == T_RPAREN)
  1679. return true; // nothing to do
  1680. CHECK_CACHE(ASTCache::ParameterDeclarationClause, ParameterDeclarationClauseAST);
  1681. const unsigned initialCursor = cursor();
  1682. ParameterDeclarationListAST *parameter_declarations = 0;
  1683. unsigned dot_dot_dot_token = 0;
  1684. if (LA() == T_DOT_DOT_DOT)
  1685. dot_dot_dot_token = consumeToken();
  1686. else {
  1687. parseParameterDeclarationList(parameter_declarations);
  1688. if (LA() == T_DOT_DOT_DOT) {
  1689. dot_dot_dot_token = consumeToken();
  1690. } else if (LA() == T_COMMA && LA(2) == T_DOT_DOT_DOT) {
  1691. consumeToken(); // skip comma
  1692. dot_dot_dot_token = consumeToken();
  1693. }
  1694. }
  1695. if (parameter_declarations || dot_dot_dot_token) {
  1696. ParameterDeclarationClauseAST *ast = new (_pool) ParameterDeclarationClauseAST;
  1697. ast->parameter_declaration_list = parameter_declarations;
  1698. ast->dot_dot_dot_token = dot_dot_dot_token;
  1699. node = ast;
  1700. }
  1701. const bool result = true;
  1702. _astCache->insert(ASTCache::ParameterDeclarationClause, initialCursor, node, cursor(), result);
  1703. return result;
  1704. }
  1705. bool Parser::parseParameterDeclarationList(ParameterDeclarationListAST *&node)
  1706. {
  1707. DEBUG_THIS_RULE();
  1708. if (LA() == T_DOT_DOT_DOT || (LA() == T_COMMA && LA(2) == T_DOT_DOT_DOT))
  1709. return false; // nothing to do.
  1710. ParameterDeclarationListAST **parameter_declaration_ptr = &node;
  1711. ParameterDeclarationAST *declaration = 0;
  1712. if (parseParameterDeclaration(declaration)) {
  1713. *parameter_declaration_ptr = new (_pool) ParameterDeclarationListAST;
  1714. (*parameter_declaration_ptr)->value = declaration;
  1715. parameter_declaration_ptr = &(*parameter_declaration_ptr)->next;
  1716. while (LA() == T_COMMA) {
  1717. consumeToken();
  1718. if (LA() == T_DOT_DOT_DOT)
  1719. break;
  1720. declaration = 0;
  1721. if (parseParameterDeclaration(declaration)) {
  1722. *parameter_declaration_ptr = new (_pool) ParameterDeclarationListAST;
  1723. (*parameter_declaration_ptr)->value = declaration;
  1724. parameter_declaration_ptr = &(*parameter_declaration_ptr)->next;
  1725. }
  1726. }
  1727. return true;
  1728. }
  1729. return false;
  1730. }
  1731. bool Parser::parseParameterDeclaration(ParameterDeclarationAST *&node)
  1732. {
  1733. DEBUG_THIS_RULE();
  1734. SpecifierListAST *decl_specifier_seq = 0;
  1735. if (parseDeclSpecifierSeq(decl_specifier_seq)) {
  1736. ParameterDeclarationAST *ast = new (_pool) ParameterDeclarationAST;
  1737. ast->type_specifier_list = decl_specifier_seq;
  1738. parseDeclaratorOrAbstractDeclarator(ast->declarator, decl_specifier_seq);
  1739. if (LA() == T_EQUAL) {
  1740. ast->equal_token = consumeToken();
  1741. if (!_languageFeatures.cxx11Enabled)
  1742. parseLogicalOrExpression(ast->expression);
  1743. else
  1744. parseInitializerClause0x(ast->expression);
  1745. }
  1746. node = ast;
  1747. return true;
  1748. }
  1749. return false;
  1750. }
  1751. const Identifier *Parser::className(ClassSpecifierAST *ast) const
  1752. {
  1753. if (! ast)
  1754. return 0;
  1755. return identifier(ast->name);
  1756. }
  1757. const Identifier *Parser::identifier(NameAST *name) const
  1758. {
  1759. if (! name)
  1760. return 0;
  1761. if (QualifiedNameAST *q = name->asQualifiedName())
  1762. name = q->unqualified_name;
  1763. if (name) {
  1764. if (SimpleNameAST *simple = name->asSimpleName())
  1765. return _translationUnit->identifier(simple->identifier_token);
  1766. else if (TemplateIdAST *template_id = name->asTemplateId())
  1767. return _translationUnit->identifier(template_id->identifier_token);
  1768. }
  1769. return 0;
  1770. }
  1771. bool Parser::parseClassSpecifier(SpecifierListAST *&node)
  1772. {
  1773. DEBUG_THIS_RULE();
  1774. if (! lookAtClassKey())
  1775. return false;
  1776. unsigned classkey_token = consumeToken();
  1777. SpecifierListAST *attributes = 0;
  1778. parseOptionalAttributeSpecifierSequence(attributes);
  1779. if (LA(1) == T_IDENTIFIER && LA(2) == T_IDENTIFIER) {
  1780. const Identifier *id = tok(2).identifier;
  1781. if (!id->equalTo(_control->cpp11Final())) {
  1782. warning(cursor(), "skip identifier `%s'",
  1783. tok().spell());
  1784. consumeToken();
  1785. }
  1786. }
  1787. NameAST *name = 0;
  1788. parseName(name);
  1789. bool parsed = false;
  1790. const bool previousInFunctionBody = _inFunctionBody;
  1791. _inFunctionBody = false;
  1792. unsigned colon_token = 0;
  1793. unsigned dot_dot_dot_token = 0;
  1794. unsigned final_token = 0;
  1795. if (LA() == T_IDENTIFIER) {
  1796. const Identifier *id = tok().identifier;
  1797. if (id->equalTo(_control->cpp11Final()))
  1798. final_token = consumeToken();
  1799. }
  1800. if (LA() == T_COLON || LA() == T_LBRACE) {
  1801. if (!name) {
  1802. AnonymousNameAST *ast = new (_pool) AnonymousNameAST;
  1803. ast->class_token = classkey_token;
  1804. name = ast;
  1805. }
  1806. BaseSpecifierListAST *base_clause_list = 0;
  1807. if (LA() == T_COLON) {
  1808. colon_token = cursor();
  1809. parseBaseClause(base_clause_list);
  1810. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  1811. dot_dot_dot_token = consumeToken();
  1812. if (LA() != T_LBRACE) {
  1813. error(cursor(), "expected `{' before `%s'", tok().spell());
  1814. const unsigned saved = cursor();
  1815. for (int n = 0; n < 3 && LA() != T_EOF_SYMBOL; ++n, consumeToken()) {
  1816. if (LA() == T_LBRACE)
  1817. break;
  1818. }
  1819. if (LA() != T_LBRACE)
  1820. rewind(saved);
  1821. }
  1822. }
  1823. ClassSpecifierAST *ast = new (_pool) ClassSpecifierAST;
  1824. ast->classkey_token = classkey_token;
  1825. ast->attribute_list = attributes;
  1826. ast->final_token = final_token;
  1827. ast->name = name;
  1828. ast->colon_token = colon_token;
  1829. ast->base_clause_list = base_clause_list;
  1830. ast->dot_dot_dot_token = dot_dot_dot_token;
  1831. if (LA() == T_LBRACE)
  1832. ast->lbrace_token = consumeToken();
  1833. DeclarationListAST **declaration_ptr = &ast->member_specifier_list;
  1834. while (int tk = LA()) {
  1835. if (tk == T_RBRACE) {
  1836. ast->rbrace_token = consumeToken();
  1837. break;
  1838. }
  1839. unsigned start_declaration = cursor();
  1840. DeclarationAST *declaration = 0;
  1841. if (parseMemberSpecification(declaration, ast)) {
  1842. if (declaration) { // paranoia check
  1843. *declaration_ptr = new (_pool) DeclarationListAST;
  1844. (*declaration_ptr)->value = declaration;
  1845. declaration_ptr = &(*declaration_ptr)->next;
  1846. }
  1847. if (cursor() == start_declaration) { // more paranoia
  1848. rewind(start_declaration + 1);
  1849. skipUntilDeclaration();
  1850. }
  1851. } else {
  1852. error(start_declaration, "expected a declaration");
  1853. rewind(start_declaration + 1);
  1854. skipUntilDeclaration();
  1855. }
  1856. }
  1857. node = new (_pool) SpecifierListAST(ast);
  1858. parsed = true;
  1859. }
  1860. _inFunctionBody = previousInFunctionBody;
  1861. return parsed;
  1862. }
  1863. bool Parser::parseAccessDeclaration(DeclarationAST *&node)
  1864. {
  1865. DEBUG_THIS_RULE();
  1866. if (LA() == T_PUBLIC || LA() == T_PROTECTED || LA() == T_PRIVATE || LA() == T_Q_SIGNALS || LA() == T_Q_SLOTS) {
  1867. bool isSignals = LA() == T_Q_SIGNALS;
  1868. bool isSlots = LA() == T_Q_SLOTS;
  1869. AccessDeclarationAST *ast = new (_pool) AccessDeclarationAST;
  1870. ast->access_specifier_token = consumeToken();
  1871. if (! isSignals && (LA() == T_Q_SLOTS || isSlots))
  1872. ast->slots_token = consumeToken();
  1873. match(T_COLON, &ast->colon_token);
  1874. node = ast;
  1875. return true;
  1876. }
  1877. return false;
  1878. }
  1879. /*
  1880. Q_PROPERTY(type name
  1881. (READ getFunction [WRITE setFunction]
  1882. | MEMBER memberName [(READ getFunction | WRITE setFunction)])
  1883. [RESET resetFunction]
  1884. [NOTIFY notifySignal]
  1885. [REVISION int]
  1886. [DESIGNABLE bool]
  1887. [SCRIPTABLE bool]
  1888. [STORED bool]
  1889. [USER bool]
  1890. [CONSTANT]
  1891. [FINAL])
  1892. Note that "type" appears to be any valid type. So these are valid:
  1893. Q_PROPERTY(const char *zoo READ zoo)
  1894. Q_PROPERTY(const class Blah *blah READ blah)
  1895. Furthermore, the only restriction on the order of the items in between the
  1896. parenthesis is that the type is the first parameter and the name comes after
  1897. the type. Especially, there seems to be no restriction on the READ/WRITE/MEMBER
  1898. order.
  1899. */
  1900. bool Parser::parseQtPropertyDeclaration(DeclarationAST *&node)
  1901. {
  1902. DEBUG_THIS_RULE();
  1903. const bool privateProperty = (LA() == T_Q_PRIVATE_PROPERTY);
  1904. if (LA() != T_Q_PROPERTY && !privateProperty)
  1905. return false;
  1906. QtPropertyDeclarationAST *ast = new (_pool)QtPropertyDeclarationAST;
  1907. ast->property_specifier_token = consumeToken();
  1908. if (LA() == T_LPAREN) {
  1909. ast->lparen_token = consumeToken();
  1910. if (privateProperty) {
  1911. if (parsePostfixExpression(ast->expression)) {
  1912. match(T_COMMA, &ast->comma_token);
  1913. } else {
  1914. error(cursor(), "expected expression before `%s'", tok().spell());
  1915. return true;
  1916. }
  1917. }
  1918. parseTypeId(ast->type_id);
  1919. SimpleNameAST *property_name = new (_pool) SimpleNameAST;
  1920. // special case: keywords are allowed for property names!
  1921. if (tok().isKeyword())
  1922. property_name->identifier_token = consumeToken();
  1923. else
  1924. match(T_IDENTIFIER, &property_name->identifier_token);
  1925. ast->property_name = property_name;
  1926. QtPropertyDeclarationItemListAST **iter = &ast->property_declaration_item_list;
  1927. while (true) {
  1928. if (LA() == T_RPAREN) {
  1929. ast->rparen_token = consumeToken();
  1930. node = ast;
  1931. break;
  1932. } else if (LA() == T_IDENTIFIER) {
  1933. QtPropertyDeclarationItemAST *item = 0;
  1934. switch (peekAtQtContextKeyword()) {
  1935. case Token_READ:
  1936. case Token_WRITE:
  1937. case Token_MEMBER:
  1938. case Token_RESET:
  1939. case Token_NOTIFY:
  1940. case Token_REVISION:
  1941. case Token_DESIGNABLE:
  1942. case Token_SCRIPTABLE:
  1943. case Token_STORED:
  1944. case Token_USER: {
  1945. unsigned item_name_token = consumeToken();
  1946. ExpressionAST *expr = 0;
  1947. if (parsePostfixExpression(expr)) {
  1948. QtPropertyDeclarationItemAST *bItem =
  1949. new (_pool) QtPropertyDeclarationItemAST;
  1950. bItem->item_name_token = item_name_token;
  1951. bItem->expression = expr;
  1952. item = bItem;
  1953. } else {
  1954. error(cursor(), "expected expression before `%s'", tok().spell());
  1955. }
  1956. break;
  1957. }
  1958. case Token_CONSTANT:
  1959. case Token_FINAL: {
  1960. QtPropertyDeclarationItemAST *fItem = new (_pool) QtPropertyDeclarationItemAST;
  1961. fItem->item_name_token = consumeToken();
  1962. item = fItem;
  1963. break;
  1964. }
  1965. default:
  1966. error(cursor(), "expected `)' before `%s'", tok().spell());
  1967. // skip the token
  1968. consumeToken();
  1969. }
  1970. if (item) {
  1971. *iter = new (_pool) QtPropertyDeclarationItemListAST;
  1972. (*iter)->value = item;
  1973. iter = &(*iter)->next;
  1974. }
  1975. } else if (!LA()) {
  1976. break;
  1977. } else {
  1978. error(cursor(), "expected `)' before `%s'", tok().spell());
  1979. // skip the token
  1980. consumeToken();
  1981. }
  1982. }
  1983. }
  1984. return true;
  1985. }
  1986. // q-enums-decl ::= 'Q_ENUMS' '(' q-enums-list? ')'
  1987. // q-enums-list ::= identifier
  1988. // q-enums-list ::= q-enums-list identifier
  1989. //
  1990. // Note: Q_ENUMS is a CPP macro with exactly 1 parameter.
  1991. // Examples of valid uses:
  1992. // Q_ENUMS()
  1993. // Q_ENUMS(Priority)
  1994. // Q_ENUMS(Priority Severity)
  1995. // so, these are not allowed:
  1996. // Q_ENUMS
  1997. // Q_ENUMS(Priority, Severity)
  1998. bool Parser::parseQtEnumDeclaration(DeclarationAST *&node)
  1999. {
  2000. DEBUG_THIS_RULE();
  2001. if (LA() != T_Q_ENUMS)
  2002. return false;
  2003. QtEnumDeclarationAST *ast = new (_pool) QtEnumDeclarationAST;
  2004. ast->enum_specifier_token = consumeToken();
  2005. match(T_LPAREN, &ast->lparen_token);
  2006. for (NameListAST **iter = &ast->enumerator_list; LA() && LA() != T_RPAREN; iter = &(*iter)->next) {
  2007. NameAST *name_ast = 0;
  2008. if (!parseName(name_ast))
  2009. break;
  2010. *iter = new (_pool) NameListAST;
  2011. (*iter)->value = name_ast;
  2012. }
  2013. match(T_RPAREN, &ast->rparen_token);
  2014. node = ast;
  2015. return true;
  2016. }
  2017. // q-flags-decl ::= 'Q_FLAGS' '(' q-flags-list? ')'
  2018. // q-flags-list ::= identifier
  2019. // q-flags-list ::= q-flags-list identifier
  2020. //
  2021. // Note: Q_FLAGS is a CPP macro with exactly 1 parameter.
  2022. // Examples of valid uses:
  2023. // Q_FLAGS()
  2024. // Q_FLAGS(Orientation)
  2025. // Q_FLAGS(Orientation DropActions)
  2026. // so, these are not allowed:
  2027. // Q_FLAGS
  2028. // Q_FLAGS(Orientation, DropActions)
  2029. bool Parser::parseQtFlags(DeclarationAST *&node)
  2030. {
  2031. DEBUG_THIS_RULE();
  2032. if (LA() != T_Q_FLAGS)
  2033. return false;
  2034. QtFlagsDeclarationAST *ast = new (_pool) QtFlagsDeclarationAST;
  2035. ast->flags_specifier_token = consumeToken();
  2036. match(T_LPAREN, &ast->lparen_token);
  2037. for (NameListAST **iter = &ast->flag_enums_list; LA() && LA() != T_RPAREN; iter = &(*iter)->next) {
  2038. NameAST *name_ast = 0;
  2039. if (!parseName(name_ast))
  2040. break;
  2041. *iter = new (_pool) NameListAST;
  2042. (*iter)->value = name_ast;
  2043. }
  2044. match(T_RPAREN, &ast->rparen_token);
  2045. node = ast;
  2046. return true;
  2047. }
  2048. // class-specifier ::=
  2049. // c++-class-specifier
  2050. // q-tag
  2051. // q-enums-of-flags
  2052. // q-class-info
  2053. // q-interfaces
  2054. // q-private-slot
  2055. //
  2056. // declaration ::=
  2057. // c++-declaration
  2058. // q-declare-interface
  2059. // q-declare-metatype
  2060. //
  2061. // q-tag ::=
  2062. // Q_OBJECT
  2063. // Q_GADGET
  2064. //
  2065. // q-enums-or-flags ::=
  2066. // (Q_ENUMS | Q_FLAGS) LPAREN name+ RPAREN
  2067. //
  2068. // q-class-info ::=
  2069. // Q_CLASS_INFO LPAREN string-literal COMMA STRING_LITERAL RPAREN
  2070. // Q_CLASS_INFO LPAREN string-literal COMMA IDENTIFIER LPAREN STRING_LITERAL RPAREN RPAREN
  2071. // q-interfaces ::=
  2072. // Q_INTERFACES LPAREN (name q-constraints)* RPAREN
  2073. //
  2074. // q-constraints ::=
  2075. // (COLON name)*
  2076. bool Parser::parseQtInterfaces(DeclarationAST *&node)
  2077. {
  2078. DEBUG_THIS_RULE();
  2079. if (LA() != T_Q_INTERFACES)
  2080. return false;
  2081. QtInterfacesDeclarationAST *ast = new (_pool) QtInterfacesDeclarationAST;
  2082. ast->interfaces_token = consumeToken();
  2083. match(T_LPAREN, &ast->lparen_token);
  2084. for (QtInterfaceNameListAST **iter = &ast->interface_name_list; LA() && LA() != T_RPAREN; iter = &(*iter)->next) {
  2085. NameAST *name_ast = 0;
  2086. if (!parseName(name_ast))
  2087. break;
  2088. *iter = new (_pool) QtInterfaceNameListAST;
  2089. (*iter)->value = new (_pool) QtInterfaceNameAST;
  2090. (*iter)->value->interface_name = name_ast;
  2091. for (NameListAST **iter2 = &(*iter)->value->constraint_list; LA() && LA() == T_COLON; iter2 = &(*iter2)->next) {
  2092. /*unsigned colon_token =*/ consumeToken();
  2093. NameAST *name_ast2 = 0;
  2094. if (!parseName(name_ast2))
  2095. break;
  2096. *iter2 = new (_pool) NameListAST;
  2097. (*iter2)->value = name_ast2;
  2098. }
  2099. }
  2100. match(T_RPAREN, &ast->rparen_token);
  2101. node = ast;
  2102. return true;
  2103. }
  2104. // q-private-slot ::=
  2105. // Q_PRIVATE_SLOT LPAREN IDENTIFIER (LPAREN RPAREN)? COMMA q-function-declaration RPAREN
  2106. //
  2107. // q-function-declaration ::=
  2108. // decl-specifier-list declarator [+ check for the function-declarator]
  2109. //
  2110. // q-declare-interface ::=
  2111. // Q_DECLARE_INTERFACE LPAREN name COMMA (STRING_LITERAL | IDENTIFIER) RPAREN
  2112. //
  2113. // q-declare-metatype ::=
  2114. // Q_DECLARE_METATYPE LPAREN name RPAREN SEMICOLON? [warning]
  2115. bool Parser::parseMemberSpecification(DeclarationAST *&node, ClassSpecifierAST *declaringClass)
  2116. {
  2117. DEBUG_THIS_RULE();
  2118. switch (LA()) {
  2119. case T_Q_OBJECT:
  2120. case T_Q_GADGET:
  2121. {
  2122. QtObjectTagAST *ast = new (_pool) QtObjectTagAST;
  2123. ast->q_object_token = consumeToken();
  2124. node = ast;
  2125. return true;
  2126. }
  2127. case T_Q_PRIVATE_SLOT:
  2128. {
  2129. QtPrivateSlotAST *ast = new (_pool) QtPrivateSlotAST;
  2130. ast->q_private_slot_token = consumeToken();
  2131. match(T_LPAREN, &ast->lparen_token);
  2132. match(T_IDENTIFIER, &ast->dptr_token);
  2133. if (LA() == T_LPAREN) {
  2134. ast->dptr_lparen_token = consumeToken();
  2135. match(T_RPAREN, &ast->dptr_rparen_token);
  2136. }
  2137. match(T_COMMA, &ast->comma_token);
  2138. (void) parseTypeSpecifier(ast->type_specifier_list);
  2139. parseDeclarator(ast->declarator, ast->type_specifier_list);
  2140. match(T_RPAREN, &ast->rparen_token);
  2141. node = ast;
  2142. } return true;
  2143. case T_SEMICOLON:
  2144. return parseEmptyDeclaration(node);
  2145. case T_USING:
  2146. return parseUsing(node);
  2147. case T_TEMPLATE:
  2148. return parseTemplateDeclaration(node);
  2149. case T_Q_SIGNALS:
  2150. case T_PUBLIC:
  2151. case T_PROTECTED:
  2152. case T_PRIVATE:
  2153. case T_Q_SLOTS:
  2154. return parseAccessDeclaration(node);
  2155. case T_Q_PROPERTY:
  2156. case T_Q_PRIVATE_PROPERTY:
  2157. return parseQtPropertyDeclaration(node);
  2158. case T_Q_ENUMS:
  2159. return parseQtEnumDeclaration(node);
  2160. case T_Q_FLAGS:
  2161. return parseQtFlags(node);
  2162. case T_Q_INTERFACES:
  2163. return parseQtInterfaces(node);
  2164. case T_STATIC_ASSERT:
  2165. if (_languageFeatures.cxx11Enabled)
  2166. return parseStaticAssertDeclaration(node);
  2167. // fall-through
  2168. default:
  2169. return parseSimpleDeclaration(node, declaringClass);
  2170. } // switch
  2171. }
  2172. bool Parser::parseCtorInitializer(CtorInitializerAST *&node)
  2173. {
  2174. DEBUG_THIS_RULE();
  2175. if (LA() == T_COLON) {
  2176. unsigned colon_token = consumeToken();
  2177. CtorInitializerAST *ast = new (_pool) CtorInitializerAST;
  2178. ast->colon_token = colon_token;
  2179. parseMemInitializerList(ast->member_initializer_list);
  2180. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  2181. ast->dot_dot_dot_token = consumeToken();
  2182. node = ast;
  2183. return true;
  2184. }
  2185. return false;
  2186. }
  2187. bool Parser::parseElaboratedTypeSpecifier(SpecifierListAST *&node)
  2188. {
  2189. DEBUG_THIS_RULE();
  2190. if (lookAtClassKey() || LA() == T_ENUM || LA() == T_TYPENAME) {
  2191. unsigned classkey_token = consumeToken();
  2192. SpecifierListAST *attributes = 0;
  2193. parseOptionalAttributeSpecifierSequence(attributes);
  2194. NameAST *name = 0;
  2195. if (parseName(name)) {
  2196. ElaboratedTypeSpecifierAST *ast = new (_pool) ElaboratedTypeSpecifierAST;
  2197. ast->classkey_token = classkey_token;
  2198. ast->attribute_list = attributes;
  2199. ast->name = name;
  2200. node = new (_pool) SpecifierListAST(ast);
  2201. return true;
  2202. }
  2203. }
  2204. return false;
  2205. }
  2206. bool Parser::parseExceptionSpecification(ExceptionSpecificationAST *&node)
  2207. {
  2208. DEBUG_THIS_RULE();
  2209. if (LA() == T_THROW) {
  2210. DynamicExceptionSpecificationAST *ast = new (_pool) DynamicExceptionSpecificationAST;
  2211. ast->throw_token = consumeToken();
  2212. if (LA() == T_LPAREN)
  2213. ast->lparen_token = consumeToken();
  2214. if (LA() == T_DOT_DOT_DOT)
  2215. ast->dot_dot_dot_token = consumeToken();
  2216. else
  2217. parseTypeIdList(ast->type_id_list);
  2218. if (LA() == T_RPAREN)
  2219. ast->rparen_token = consumeToken();
  2220. node = ast;
  2221. return true;
  2222. } else if (_languageFeatures.cxx11Enabled && LA() == T_NOEXCEPT) {
  2223. NoExceptSpecificationAST *ast = new (_pool) NoExceptSpecificationAST;
  2224. ast->noexcept_token = consumeToken();
  2225. if (LA() == T_LPAREN) {
  2226. ast->lparen_token = consumeToken();
  2227. parseConstantExpression(ast->expression);
  2228. match(T_RPAREN, &ast->rparen_token);
  2229. }
  2230. node = ast;
  2231. return true;
  2232. }
  2233. return false;
  2234. }
  2235. bool Parser::parseEnumerator(EnumeratorListAST *&node)
  2236. {
  2237. DEBUG_THIS_RULE();
  2238. if (LA() == T_IDENTIFIER) {
  2239. EnumeratorAST *ast = new (_pool) EnumeratorAST;
  2240. ast->identifier_token = consumeToken();
  2241. if (LA() == T_EQUAL) {
  2242. ast->equal_token = consumeToken();
  2243. parseConstantExpression(ast->expression);
  2244. }
  2245. node = new (_pool) EnumeratorListAST;
  2246. node->value = ast;
  2247. return true;
  2248. }
  2249. return false;
  2250. }
  2251. bool Parser::parseInitDeclarator(DeclaratorAST *&node, SpecifierListAST *decl_specifier_list,
  2252. ClassSpecifierAST *declaringClass) // ### rewrite me
  2253. {
  2254. DEBUG_THIS_RULE();
  2255. if (declaringClass && LA() == T_COLON) {
  2256. // anonymous bit-field declaration.
  2257. } else if (! parseDeclarator(node, decl_specifier_list, declaringClass)) {
  2258. return false;
  2259. }
  2260. if (LA() == T_ASM && LA(2) == T_LPAREN) { // ### FIXME
  2261. consumeToken();
  2262. if (skip(T_LPAREN, T_RPAREN))
  2263. consumeToken();
  2264. }
  2265. const bool isFunctionDeclarator = node
  2266. && node->postfix_declarator_list
  2267. && node->postfix_declarator_list->lastValue()
  2268. && node->postfix_declarator_list->lastValue()->asFunctionDeclarator();
  2269. if (declaringClass && LA() == T_COLON
  2270. && (! node || ! node->postfix_declarator_list)) {
  2271. unsigned colon_token = consumeToken();
  2272. ExpressionAST *expression = 0;
  2273. if (parseConstantExpression(expression) && (LA() == T_COMMA ||
  2274. LA() == T_SEMICOLON)) {
  2275. // recognized a bitfielddeclarator.
  2276. if (! node)
  2277. node = new (_pool) DeclaratorAST;
  2278. node->initializer = expression;
  2279. return true;
  2280. }
  2281. rewind(colon_token);
  2282. } else if (isFunctionDeclarator && declaringClass && node->core_declarator && LA() == T_EQUAL && LA(3) == T_SEMICOLON) { // = 0, = delete, = default
  2283. if (!_languageFeatures.cxx11Enabled || LA(2) == T_NUMERIC_LITERAL) {
  2284. parseInitializer(node->initializer, &node->equal_token);
  2285. } else {
  2286. node->equal_token = consumeToken();
  2287. IdExpressionAST *id_expr = new (_pool) IdExpressionAST;
  2288. node->initializer = id_expr;
  2289. SimpleNameAST *simple_name = new (_pool) SimpleNameAST;
  2290. id_expr->name = simple_name;
  2291. simple_name->identifier_token = consumeToken();
  2292. }
  2293. } else if (node->core_declarator && (LA() == T_EQUAL || (_languageFeatures.cxx11Enabled && !isFunctionDeclarator && LA() == T_LBRACE) || (! declaringClass && LA() == T_LPAREN))) {
  2294. parseInitializer(node->initializer, &node->equal_token);
  2295. }
  2296. return true;
  2297. }
  2298. bool Parser::parseBaseClause(BaseSpecifierListAST *&node)
  2299. {
  2300. DEBUG_THIS_RULE();
  2301. if (LA() == T_COLON) {
  2302. consumeToken(); // ### remove me
  2303. BaseSpecifierListAST **ast = &node;
  2304. if (parseBaseSpecifier(*ast)) {
  2305. ast = &(*ast)->next;
  2306. while (LA() == T_COMMA) {
  2307. consumeToken(); // consume T_COMMA
  2308. if (parseBaseSpecifier(*ast))
  2309. ast = &(*ast)->next;
  2310. }
  2311. }
  2312. return true;
  2313. }
  2314. return false;
  2315. }
  2316. bool Parser::parseInitializer(ExpressionAST *&node, unsigned *equals_token)
  2317. {
  2318. DEBUG_THIS_RULE();
  2319. return parseInitializer0x(node, equals_token);
  2320. }
  2321. bool Parser::parseInitializer0x(ExpressionAST *&node, unsigned *equals_token)
  2322. {
  2323. DEBUG_THIS_RULE();
  2324. if ((_languageFeatures.cxx11Enabled && LA() == T_LBRACE) || LA() == T_EQUAL) {
  2325. if (LA() == T_EQUAL)
  2326. *equals_token = cursor();
  2327. return parseBraceOrEqualInitializer0x(node);
  2328. }
  2329. else if (LA() == T_LPAREN) {
  2330. return parseExpressionListParen(node);
  2331. }
  2332. return false;
  2333. }
  2334. bool Parser::parseBraceOrEqualInitializer0x(ExpressionAST *&node)
  2335. {
  2336. if (LA() == T_EQUAL) {
  2337. consumeToken();
  2338. parseInitializerClause0x(node);
  2339. return true;
  2340. } else if (LA() == T_LBRACE) {
  2341. return parseBracedInitList0x(node);
  2342. }
  2343. return false;
  2344. }
  2345. /*
  2346. initializer-clause:
  2347. assignment-expression
  2348. braced-init-list
  2349. designated-initializer
  2350. If the next token is a T_LBRACKET, it could be the begin of either
  2351. * a C++11 lambda-introducer (parsed by parseAssignmentExpression)
  2352. * or a C99 designator (parsed by parseDesignatedInitializer).
  2353. Because currently C99 and C++11 Support is activated at the same time,
  2354. first try to parse the assignment-expression. If this fails, try to
  2355. parse a designated-initializer.
  2356. TODO:
  2357. As soon as there will be only "one active language", parse either
  2358. the assignment-expression or the designated-initializer, not both.
  2359. */
  2360. bool Parser::parseInitializerClause0x(ExpressionAST *&node)
  2361. {
  2362. DEBUG_THIS_RULE();
  2363. if (LA() == T_LBRACE)
  2364. return parseBracedInitList0x(node);
  2365. if (parseAssignmentExpression(node))
  2366. return true;
  2367. return parseDesignatedInitializer(node);
  2368. }
  2369. bool Parser::parseInitializerList0x(ExpressionListAST *&node)
  2370. {
  2371. ExpressionListAST **expression_list_ptr = &node;
  2372. ExpressionAST *expression = 0;
  2373. if (parseInitializerClause0x(expression)) {
  2374. *expression_list_ptr = new (_pool) ExpressionListAST;
  2375. (*expression_list_ptr)->value = expression;
  2376. expression_list_ptr = &(*expression_list_ptr)->next;
  2377. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT && (LA(2) == T_COMMA || LA(2) == T_RBRACE || LA(2) == T_RPAREN))
  2378. consumeToken(); // ### create an argument pack
  2379. while (LA() == T_COMMA && LA(2) != T_RBRACE) {
  2380. consumeToken(); // consume T_COMMA
  2381. if (parseInitializerClause0x(expression)) {
  2382. *expression_list_ptr = new (_pool) ExpressionListAST;
  2383. (*expression_list_ptr)->value = expression;
  2384. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT && (LA(2) == T_COMMA || LA(2) == T_RBRACE || LA(2) == T_RPAREN))
  2385. consumeToken(); // ### create an argument pack
  2386. expression_list_ptr = &(*expression_list_ptr)->next;
  2387. }
  2388. }
  2389. }
  2390. return true;
  2391. }
  2392. bool Parser::parseBracedInitList0x(ExpressionAST *&node)
  2393. {
  2394. DEBUG_THIS_RULE();
  2395. if (LA() != T_LBRACE)
  2396. return false;
  2397. BracedInitializerAST *ast = new (_pool) BracedInitializerAST;
  2398. ast->lbrace_token = consumeToken();
  2399. parseInitializerList0x(ast->expression_list);
  2400. if (LA() == T_COMMA && LA(2) == T_RBRACE)
  2401. ast->comma_token = consumeToken();
  2402. match(T_RBRACE, &ast->rbrace_token);
  2403. node = ast;
  2404. return true;
  2405. }
  2406. bool Parser::parseMemInitializerList(MemInitializerListAST *&node)
  2407. {
  2408. DEBUG_THIS_RULE();
  2409. MemInitializerListAST **initializer = &node;
  2410. if (parseMemInitializer(*initializer)) {
  2411. initializer = &(*initializer)->next;
  2412. while (true) {
  2413. if (LA() == T_LBRACE)
  2414. break;
  2415. else if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT && LA(2) == T_LBRACE)
  2416. break;
  2417. else if (LA() == T_COMMA
  2418. || (LA() == T_IDENTIFIER
  2419. && (LA(2) == T_LPAREN || LA(2) == T_COLON_COLON || (_languageFeatures.cxx11Enabled && LA(2) == T_LBRACE)))) {
  2420. if (LA() != T_COMMA)
  2421. error(cursor(), "expected `,'");
  2422. else
  2423. consumeToken();
  2424. if (parseMemInitializer(*initializer))
  2425. initializer = &(*initializer)->next;
  2426. else
  2427. error(cursor(), "expected a member initializer");
  2428. } else break;
  2429. }
  2430. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT) {
  2431. if (LA(2) != T_LBRACE)
  2432. error(cursor(), "expected `{'");
  2433. } else if (LA() != T_LBRACE) {
  2434. error(cursor(), "expected `{'");
  2435. }
  2436. return true;
  2437. }
  2438. return false;
  2439. }
  2440. bool Parser::parseMemInitializer(MemInitializerListAST *&node)
  2441. {
  2442. DEBUG_THIS_RULE();
  2443. NameAST *name = 0;
  2444. if (! parseName(name))
  2445. return false;
  2446. MemInitializerAST *ast = new (_pool) MemInitializerAST;
  2447. ast->name = name;
  2448. if (LA() == T_LPAREN) {
  2449. parseExpressionListParen(ast->expression);
  2450. } else if (_languageFeatures.cxx11Enabled && LA() == T_LBRACE) {
  2451. parseBracedInitList0x(ast->expression);
  2452. } else {
  2453. if (!_languageFeatures.cxx11Enabled)
  2454. error(cursor(), "expected '('");
  2455. else
  2456. error(cursor(), "expected '(' or '{'");
  2457. return false;
  2458. }
  2459. node = new (_pool) MemInitializerListAST;
  2460. node->value = ast;
  2461. return true;
  2462. }
  2463. bool Parser::parseTypeIdList(ExpressionListAST *&node)
  2464. {
  2465. DEBUG_THIS_RULE();
  2466. ExpressionListAST **expression_list_ptr = &node;
  2467. ExpressionAST *typeId = 0;
  2468. if (parseTypeId(typeId)) {
  2469. *expression_list_ptr = new (_pool) ExpressionListAST;
  2470. (*expression_list_ptr)->value = typeId;
  2471. expression_list_ptr = &(*expression_list_ptr)->next;
  2472. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  2473. consumeToken(); // ### store this token
  2474. while (LA() == T_COMMA) {
  2475. consumeToken();
  2476. if (parseTypeId(typeId)) {
  2477. *expression_list_ptr = new (_pool) ExpressionListAST;
  2478. (*expression_list_ptr)->value = typeId;
  2479. expression_list_ptr = &(*expression_list_ptr)->next;
  2480. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  2481. consumeToken(); // ### store this token
  2482. }
  2483. }
  2484. return true;
  2485. }
  2486. return false;
  2487. }
  2488. bool Parser::parseExpressionList(ExpressionListAST *&node)
  2489. {
  2490. DEBUG_THIS_RULE();
  2491. CHECK_CACHE(ASTCache::ExpressionList, ExpressionListAST);
  2492. unsigned initialCursor = cursor();
  2493. if (_languageFeatures.cxx11Enabled) {
  2494. const bool result = parseInitializerList0x(node);
  2495. _astCache->insert(ASTCache::ExpressionList, initialCursor, (AST *) node, cursor(), result);
  2496. return result;
  2497. }
  2498. ExpressionListAST **expression_list_ptr = &node;
  2499. ExpressionAST *expression = 0;
  2500. if (parseAssignmentExpression(expression)) {
  2501. *expression_list_ptr = new (_pool) ExpressionListAST;
  2502. (*expression_list_ptr)->value = expression;
  2503. expression_list_ptr = &(*expression_list_ptr)->next;
  2504. while (LA() == T_COMMA) {
  2505. consumeToken(); // consume T_COMMA
  2506. if (parseAssignmentExpression(expression)) {
  2507. *expression_list_ptr = new (_pool) ExpressionListAST;
  2508. (*expression_list_ptr)->value = expression;
  2509. expression_list_ptr = &(*expression_list_ptr)->next;
  2510. }
  2511. }
  2512. const bool result = true;
  2513. _astCache->insert(ASTCache::ExpressionList, initialCursor, (AST *) node, cursor(), result);
  2514. return result;
  2515. }
  2516. const bool result = false;
  2517. _astCache->insert(ASTCache::ExpressionList, initialCursor, 0, cursor(), result);
  2518. return result;
  2519. }
  2520. bool Parser::parseBaseSpecifier(BaseSpecifierListAST *&node)
  2521. {
  2522. DEBUG_THIS_RULE();
  2523. BaseSpecifierAST *ast = new (_pool) BaseSpecifierAST;
  2524. if (LA() == T_VIRTUAL) {
  2525. ast->virtual_token = consumeToken();
  2526. int tk = LA();
  2527. if (tk == T_PUBLIC || tk == T_PROTECTED || tk == T_PRIVATE)
  2528. ast->access_specifier_token = consumeToken();
  2529. } else {
  2530. int tk = LA();
  2531. if (tk == T_PUBLIC || tk == T_PROTECTED || tk == T_PRIVATE)
  2532. ast->access_specifier_token = consumeToken();
  2533. if (LA() == T_VIRTUAL)
  2534. ast->virtual_token = consumeToken();
  2535. }
  2536. parseName(ast->name);
  2537. if (! ast->name)
  2538. error(cursor(), "expected class-name");
  2539. node = new (_pool) BaseSpecifierListAST;
  2540. node->value = ast;
  2541. return true;
  2542. }
  2543. bool Parser::parseInitializerList(ExpressionListAST *&node)
  2544. {
  2545. DEBUG_THIS_RULE();
  2546. ExpressionListAST **initializer_ptr = &node;
  2547. ExpressionAST *initializer = 0;
  2548. if (parseInitializerClause(initializer)) {
  2549. *initializer_ptr = new (_pool) ExpressionListAST;
  2550. (*initializer_ptr)->value = initializer;
  2551. initializer_ptr = &(*initializer_ptr)->next;
  2552. while (LA() == T_COMMA) {
  2553. consumeToken(); // consume T_COMMA
  2554. initializer = 0;
  2555. parseInitializerClause(initializer);
  2556. *initializer_ptr = new (_pool) ExpressionListAST;
  2557. (*initializer_ptr)->value = initializer;
  2558. initializer_ptr = &(*initializer_ptr)->next;
  2559. }
  2560. }
  2561. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT)
  2562. consumeToken(); // ### store this token
  2563. return true;
  2564. }
  2565. bool Parser::parseInitializerClause(ExpressionAST *&node)
  2566. {
  2567. DEBUG_THIS_RULE();
  2568. if (LA() == T_LBRACE) {
  2569. ArrayInitializerAST *ast = new (_pool) ArrayInitializerAST;
  2570. ast->lbrace_token = consumeToken();
  2571. parseInitializerList(ast->expression_list);
  2572. match(T_RBRACE, &ast->rbrace_token);
  2573. node = ast;
  2574. return true;
  2575. }
  2576. return parseAssignmentExpression(node);
  2577. }
  2578. bool Parser::parseUnqualifiedName(NameAST *&node, bool acceptTemplateId)
  2579. {
  2580. DEBUG_THIS_RULE();
  2581. if (LA() == T_TILDE && LA(2) == T_IDENTIFIER) {
  2582. DestructorNameAST *ast = new (_pool) DestructorNameAST;
  2583. ast->tilde_token = consumeToken();
  2584. parseUnqualifiedName(ast->unqualified_name);
  2585. node = ast;
  2586. return true;
  2587. } else if (LA() == T_OPERATOR) {
  2588. unsigned operator_token = cursor();
  2589. if (parseOperatorFunctionId(node))
  2590. return true;
  2591. rewind(operator_token);
  2592. return parseConversionFunctionId(node);
  2593. } else if (LA() == T_IDENTIFIER) {
  2594. unsigned identifier_token = cursor();
  2595. if (acceptTemplateId && LA(2) == T_LESS) {
  2596. bool blocked = blockErrors(true);
  2597. if (parseTemplateId(node)
  2598. && (! _templateArguments || (LA() == T_COMMA || maybeSplitGreaterGreaterToken() || LA() == T_GREATER ||
  2599. LA() == T_LPAREN || LA() == T_RPAREN ||
  2600. LA() == T_STAR || LA() == T_AMPER || // ptr-operators
  2601. LA() == T_COLON_COLON))) {
  2602. blockErrors(blocked);
  2603. return true;
  2604. }
  2605. blockErrors(blocked);
  2606. }
  2607. rewind(identifier_token);
  2608. SimpleNameAST *ast = new (_pool) SimpleNameAST;
  2609. ast->identifier_token = consumeToken();
  2610. node = ast;
  2611. return true;
  2612. } else if (LA() == T_TEMPLATE) {
  2613. unsigned template_token = consumeToken();
  2614. if (parseTemplateId(node, template_token))
  2615. return true;
  2616. rewind(template_token);
  2617. }
  2618. return false;
  2619. }
  2620. bool Parser::parseStringLiteral(ExpressionAST *&node)
  2621. {
  2622. DEBUG_THIS_RULE();
  2623. if (! (LA() == T_STRING_LITERAL
  2624. || LA() == T_WIDE_STRING_LITERAL
  2625. || LA() == T_UTF8_STRING_LITERAL
  2626. || LA() == T_UTF16_STRING_LITERAL
  2627. || LA() == T_UTF32_STRING_LITERAL
  2628. || LA() == T_RAW_STRING_LITERAL
  2629. || LA() == T_RAW_WIDE_STRING_LITERAL
  2630. || LA() == T_RAW_UTF8_STRING_LITERAL
  2631. || LA() == T_RAW_UTF16_STRING_LITERAL
  2632. || LA() == T_RAW_UTF32_STRING_LITERAL)) {
  2633. return false;
  2634. }
  2635. StringLiteralAST **ast = reinterpret_cast<StringLiteralAST **> (&node);
  2636. while (LA() == T_STRING_LITERAL
  2637. || LA() == T_WIDE_STRING_LITERAL
  2638. || LA() == T_UTF8_STRING_LITERAL
  2639. || LA() == T_UTF16_STRING_LITERAL
  2640. || LA() == T_UTF32_STRING_LITERAL
  2641. || LA() == T_RAW_STRING_LITERAL
  2642. || LA() == T_RAW_WIDE_STRING_LITERAL
  2643. || LA() == T_RAW_UTF8_STRING_LITERAL
  2644. || LA() == T_RAW_UTF16_STRING_LITERAL
  2645. || LA() == T_RAW_UTF32_STRING_LITERAL) {
  2646. *ast = new (_pool) StringLiteralAST;
  2647. (*ast)->literal_token = consumeToken();
  2648. ast = &(*ast)->next;
  2649. }
  2650. return true;
  2651. }
  2652. bool Parser::parseExpressionStatement(StatementAST *&node)
  2653. {
  2654. DEBUG_THIS_RULE();
  2655. if (LA() == T_SEMICOLON) {
  2656. ExpressionStatementAST *ast = new (_pool) ExpressionStatementAST;
  2657. match(T_SEMICOLON, &ast->semicolon_token);
  2658. node = ast;
  2659. return true;
  2660. }
  2661. const bool wasInExpressionStatement = _inExpressionStatement;
  2662. _inExpressionStatement = true;
  2663. // switch to the temp pool and cache
  2664. MemoryPool *previousPool = _pool;
  2665. _pool = &_expressionStatementTempPool;
  2666. ASTCache *previousASTCache = _astCache;
  2667. _astCache = _expressionStatementAstCache;
  2668. bool parsed = false;
  2669. ExpressionAST *expression = 0;
  2670. if (parseExpression(expression)) {
  2671. ExpressionStatementAST *ast = new (previousPool) ExpressionStatementAST;
  2672. if (expression)
  2673. ast->expression = expression->clone(previousPool);
  2674. match(T_SEMICOLON, &ast->semicolon_token);
  2675. node = ast;
  2676. parsed = true;
  2677. }
  2678. _inExpressionStatement = wasInExpressionStatement;
  2679. if (! _inExpressionStatement) {
  2680. // rewind the memory pool and cache after parsing a toplevel expression statement.
  2681. _expressionStatementTempPool.reset();
  2682. _astCache->clear();
  2683. }
  2684. // restore the pool and cache
  2685. _pool = previousPool;
  2686. _astCache = previousASTCache;
  2687. return parsed;
  2688. }
  2689. bool Parser::parseStatement(StatementAST *&node, bool blockLabeledStatement)
  2690. {
  2691. DEBUG_THIS_RULE();
  2692. switch (LA()) {
  2693. case T_WHILE:
  2694. return parseWhileStatement(node);
  2695. case T_DO:
  2696. return parseDoStatement(node);
  2697. case T_Q_FOREACH:
  2698. return parseForeachStatement(node);
  2699. case T_FOR:
  2700. return parseForStatement(node);
  2701. case T_IF:
  2702. return parseIfStatement(node);
  2703. case T_SWITCH:
  2704. return parseSwitchStatement(node);
  2705. case T_TRY:
  2706. return parseTryBlockStatement(node, 0);
  2707. case T_CASE:
  2708. case T_DEFAULT:
  2709. if (blockLabeledStatement)
  2710. return false;
  2711. return parseLabeledStatement(node);
  2712. case T_BREAK:
  2713. return parseBreakStatement(node);
  2714. case T_CONTINUE:
  2715. return parseContinueStatement(node);
  2716. case T_GOTO:
  2717. return parseGotoStatement(node);
  2718. case T_RETURN:
  2719. return parseReturnStatement(node);
  2720. case T_LBRACE:
  2721. return parseCompoundStatement(node);
  2722. case T_ASM:
  2723. case T_NAMESPACE:
  2724. case T_USING:
  2725. case T_TEMPLATE:
  2726. case T_CLASS: case T_STRUCT: case T_UNION:
  2727. return parseDeclarationStatement(node);
  2728. case T_SEMICOLON: {
  2729. ExpressionStatementAST *ast = new (_pool) ExpressionStatementAST;
  2730. ast->semicolon_token = consumeToken();
  2731. node = ast;
  2732. return true;
  2733. }
  2734. case T_AT_TRY:
  2735. return _languageFeatures.objCEnabled && parseObjCTryStatement(node);
  2736. case T_AT_SYNCHRONIZED:
  2737. return _languageFeatures.objCEnabled && parseObjCSynchronizedStatement(node);
  2738. case T_AT_THROW:
  2739. return _languageFeatures.objCEnabled && parseObjCThrowStatement(node);
  2740. case T_Q_D:
  2741. case T_Q_Q: {
  2742. QtMemberDeclarationAST *ast = new (_pool) QtMemberDeclarationAST;
  2743. ast->q_token = consumeToken();
  2744. match(T_LPAREN, &ast->lparen_token);
  2745. parseTypeId(ast->type_id);
  2746. match(T_RPAREN, &ast->rparen_token);
  2747. node = ast;
  2748. } return true;
  2749. case T_EMIT:
  2750. case T_Q_EMIT: {
  2751. // Simply skip the emit token and parse as an expression statement - no strong
  2752. // reason to have an specific ast type.
  2753. consumeToken();
  2754. ExpressionAST *expression = 0;
  2755. if (parsePostfixExpression(expression)) {
  2756. ExpressionStatementAST *ast = new (_pool) ExpressionStatementAST;
  2757. ast->expression = expression;
  2758. match(T_SEMICOLON, &ast->semicolon_token);
  2759. node = ast;
  2760. return true;
  2761. }
  2762. error(cursor(), "expected statement");
  2763. return false;
  2764. }
  2765. default:
  2766. if (LA() == T_IDENTIFIER && LA(2) == T_COLON) {
  2767. if (blockLabeledStatement)
  2768. return false;
  2769. return parseLabeledStatement(node);
  2770. }
  2771. return parseExpressionOrDeclarationStatement(node);
  2772. } // switch
  2773. return false; //Avoid compiler warning
  2774. }
  2775. bool Parser::parseBreakStatement(StatementAST *&node)
  2776. {
  2777. DEBUG_THIS_RULE();
  2778. if (LA() == T_BREAK) {
  2779. BreakStatementAST *ast = new (_pool) BreakStatementAST;
  2780. ast->break_token = consumeToken();
  2781. match(T_SEMICOLON, &ast->semicolon_token);
  2782. node = ast;
  2783. return true;
  2784. }
  2785. return false;
  2786. }
  2787. bool Parser::parseContinueStatement(StatementAST *&node)
  2788. {
  2789. DEBUG_THIS_RULE();
  2790. if (LA() == T_CONTINUE) {
  2791. ContinueStatementAST *ast = new (_pool) ContinueStatementAST;
  2792. ast->continue_token = consumeToken();
  2793. match(T_SEMICOLON, &ast->semicolon_token);
  2794. node = ast;
  2795. return true;
  2796. }
  2797. return false;
  2798. }
  2799. bool Parser::parseGotoStatement(StatementAST *&node)
  2800. {
  2801. DEBUG_THIS_RULE();
  2802. if (LA() == T_GOTO) {
  2803. GotoStatementAST *ast = new (_pool) GotoStatementAST;
  2804. ast->goto_token = consumeToken();
  2805. match(T_IDENTIFIER, &ast->identifier_token);
  2806. match(T_SEMICOLON, &ast->semicolon_token);
  2807. node = ast;
  2808. return true;
  2809. }
  2810. return false;
  2811. }
  2812. bool Parser::parseReturnStatement(StatementAST *&node)
  2813. {
  2814. DEBUG_THIS_RULE();
  2815. if (LA() == T_RETURN) {
  2816. ReturnStatementAST *ast = new (_pool) ReturnStatementAST;
  2817. ast->return_token = consumeToken();
  2818. if (_languageFeatures.cxx11Enabled && LA() == T_LBRACE)
  2819. parseBracedInitList0x(ast->expression);
  2820. else
  2821. parseExpression(ast->expression);
  2822. match(T_SEMICOLON, &ast->semicolon_token);
  2823. node = ast;
  2824. return true;
  2825. }
  2826. return false;
  2827. }
  2828. bool Parser::maybeAmbiguousStatement(DeclarationStatementAST *ast, StatementAST *&node)
  2829. {
  2830. const unsigned start = ast->firstToken();
  2831. const unsigned end = ast->lastToken();
  2832. const bool blocked = blockErrors(true);
  2833. bool maybeAmbiguous = false;
  2834. StatementAST *stmt = 0;
  2835. if (parseExpressionStatement(stmt)) {
  2836. if (stmt->firstToken() == start && stmt->lastToken() == end) {
  2837. maybeAmbiguous = true;
  2838. node = stmt;
  2839. }
  2840. }
  2841. rewind(end);
  2842. (void) blockErrors(blocked);
  2843. return maybeAmbiguous;
  2844. }
  2845. bool Parser::parseExpressionOrDeclarationStatement(StatementAST *&node)
  2846. {
  2847. DEBUG_THIS_RULE();
  2848. if (LA() == T_SEMICOLON)
  2849. return parseExpressionStatement(node);
  2850. const unsigned start = cursor();
  2851. if (lookAtCVQualifier()
  2852. || lookAtStorageClassSpecifier()
  2853. || lookAtBuiltinTypeSpecifier()
  2854. || LA() == T_TYPENAME
  2855. || LA() == T_ENUM
  2856. || lookAtClassKey()
  2857. || (LA() == T_STATIC_ASSERT && _languageFeatures.cxx11Enabled)) {
  2858. return parseDeclarationStatement(node);
  2859. }
  2860. if (LA() == T_IDENTIFIER || (LA() == T_COLON_COLON && LA(2) == T_IDENTIFIER)) {
  2861. const bool blocked = blockErrors(true);
  2862. ExpressionAST *expression = 0;
  2863. const bool hasExpression = parseExpression(expression);
  2864. const unsigned afterExpression = cursor();
  2865. if (hasExpression/* && LA() == T_SEMICOLON*/) {
  2866. //const unsigned semicolon_token = consumeToken();
  2867. unsigned semicolon_token = 0;
  2868. if (LA() == T_SEMICOLON)
  2869. semicolon_token = cursor();
  2870. ExpressionStatementAST *as_expression = new (_pool) ExpressionStatementAST;
  2871. as_expression->expression = expression;
  2872. as_expression->semicolon_token = semicolon_token;
  2873. node = as_expression; // well, at least for now.
  2874. bool invalidAssignment = false;
  2875. if (BinaryExpressionAST *binary = expression->asBinaryExpression()) {
  2876. const int binop = _translationUnit->tokenKind(binary->binary_op_token);
  2877. if (binop == T_EQUAL) {
  2878. if (! binary->left_expression->asBinaryExpression()) {
  2879. (void) blockErrors(blocked);
  2880. node = as_expression;
  2881. match(T_SEMICOLON, &as_expression->semicolon_token);
  2882. return true;
  2883. } else {
  2884. invalidAssignment = true;
  2885. }
  2886. }
  2887. } else if (CallAST *call = expression->asCall()) {
  2888. if (call->base_expression->asIdExpression() != 0) {
  2889. (void) blockErrors(blocked);
  2890. node = as_expression;
  2891. match(T_SEMICOLON, &as_expression->semicolon_token);
  2892. return true;
  2893. }
  2894. }
  2895. rewind(start);
  2896. DeclarationAST *declaration = 0;
  2897. if (parseSimpleDeclaration(declaration)) {
  2898. DeclarationStatementAST *as_declaration = new (_pool) DeclarationStatementAST;
  2899. as_declaration->declaration = declaration;
  2900. SimpleDeclarationAST *simple = declaration->asSimpleDeclaration();
  2901. if (! semicolon_token || invalidAssignment || semicolon_token != simple->semicolon_token ||
  2902. (simple->decl_specifier_list != 0 && simple->declarator_list != 0)) {
  2903. node = as_declaration;
  2904. (void) blockErrors(blocked);
  2905. return true;
  2906. }
  2907. ExpressionOrDeclarationStatementAST *ast = new (_pool) ExpressionOrDeclarationStatementAST;
  2908. ast->declaration = as_declaration;
  2909. ast->expression = as_expression;
  2910. node = ast;
  2911. (void) blockErrors(blocked);
  2912. return true;
  2913. }
  2914. (void) blockErrors(blocked);
  2915. rewind(afterExpression);
  2916. match(T_SEMICOLON, &as_expression->semicolon_token);
  2917. return true;
  2918. }
  2919. rewind(start);
  2920. (void) blockErrors(blocked);
  2921. return parseDeclarationStatement(node);
  2922. }
  2923. rewind(start);
  2924. return parseExpressionStatement(node);
  2925. }
  2926. bool Parser::parseCondition(ExpressionAST *&node)
  2927. {
  2928. DEBUG_THIS_RULE();
  2929. unsigned start = cursor();
  2930. bool blocked = blockErrors(true);
  2931. SpecifierListAST *type_specifier = 0;
  2932. if (parseTypeSpecifier(type_specifier)) {
  2933. DeclaratorAST *declarator = 0;
  2934. if (parseInitDeclarator(declarator, type_specifier, /*declaringClass=*/ 0)) {
  2935. if (declarator->initializer && declarator->equal_token) {
  2936. ConditionAST *ast = new (_pool) ConditionAST;
  2937. ast->type_specifier_list = type_specifier;
  2938. ast->declarator = declarator;
  2939. node = ast;
  2940. blockErrors(blocked);
  2941. return true;
  2942. }
  2943. }
  2944. }
  2945. blockErrors(blocked);
  2946. rewind(start);
  2947. return parseExpression(node);
  2948. }
  2949. bool Parser::parseWhileStatement(StatementAST *&node)
  2950. {
  2951. DEBUG_THIS_RULE();
  2952. if (LA() == T_WHILE) {
  2953. WhileStatementAST *ast = new (_pool) WhileStatementAST;
  2954. ast->while_token = consumeToken();
  2955. match(T_LPAREN, &ast->lparen_token);
  2956. parseCondition(ast->condition);
  2957. match(T_RPAREN, &ast->rparen_token);
  2958. parseStatement(ast->statement);
  2959. node = ast;
  2960. return true;
  2961. }
  2962. return true;
  2963. }
  2964. bool Parser::parseDoStatement(StatementAST *&node)
  2965. {
  2966. DEBUG_THIS_RULE();
  2967. if (LA() == T_DO) {
  2968. DoStatementAST *ast = new (_pool) DoStatementAST;
  2969. ast->do_token = consumeToken();
  2970. parseStatement(ast->statement);
  2971. match(T_WHILE, &ast->while_token);
  2972. match(T_LPAREN, &ast->lparen_token);
  2973. parseExpression(ast->expression);
  2974. match(T_RPAREN, &ast->rparen_token);
  2975. match(T_SEMICOLON, &ast->semicolon_token);
  2976. node = ast;
  2977. return true;
  2978. }
  2979. return false;
  2980. }
  2981. bool Parser::parseForeachStatement(StatementAST *&node)
  2982. {
  2983. DEBUG_THIS_RULE();
  2984. if (LA() == T_Q_FOREACH) {
  2985. ForeachStatementAST *ast = new (_pool) ForeachStatementAST;
  2986. ast->foreach_token = consumeToken();
  2987. match(T_LPAREN, &ast->lparen_token);
  2988. unsigned startOfTypeSpecifier = cursor();
  2989. bool blocked = blockErrors(true);
  2990. if (parseTypeSpecifier(ast->type_specifier_list))
  2991. parseDeclarator(ast->declarator, ast->type_specifier_list);
  2992. if (! ast->type_specifier_list || ! ast->declarator) {
  2993. ast->type_specifier_list = 0;
  2994. ast->declarator = 0;
  2995. blockErrors(blocked);
  2996. rewind(startOfTypeSpecifier);
  2997. parseAssignmentExpression(ast->initializer);
  2998. }
  2999. blockErrors(blocked);
  3000. match(T_COMMA, &ast->comma_token);
  3001. parseExpression(ast->expression);
  3002. match(T_RPAREN, &ast->rparen_token);
  3003. parseStatement(ast->statement);
  3004. node = ast;
  3005. return true;
  3006. }
  3007. return false;
  3008. }
  3009. bool Parser::parseForStatement(StatementAST *&node)
  3010. {
  3011. DEBUG_THIS_RULE();
  3012. if (LA() != T_FOR)
  3013. return false;
  3014. unsigned for_token = consumeToken();
  3015. unsigned lparen_token = 0;
  3016. match(T_LPAREN, &lparen_token);
  3017. unsigned startOfTypeSpecifier = cursor();
  3018. bool blocked = blockErrors(true);
  3019. if (_languageFeatures.objCEnabled) {
  3020. ObjCFastEnumerationAST *ast = new (_pool) ObjCFastEnumerationAST;
  3021. ast->for_token = for_token;
  3022. ast->lparen_token = lparen_token;
  3023. if (parseTypeSpecifier(ast->type_specifier_list))
  3024. parseDeclarator(ast->declarator, ast->type_specifier_list);
  3025. if ((ast->type_specifier_list || ast->declarator) && !peekAtObjCContextKeyword(Token_in)) {
  3026. // woops, probably parsed too much: "in" got parsed as a declarator. Let's redo it:
  3027. ast->type_specifier_list = 0;
  3028. ast->declarator = 0;
  3029. rewind(startOfTypeSpecifier);
  3030. parseDeclarator(ast->declarator, ast->type_specifier_list);
  3031. }
  3032. if (! ast->type_specifier_list || ! ast->declarator) {
  3033. ast->type_specifier_list = 0;
  3034. ast->declarator = 0;
  3035. rewind(startOfTypeSpecifier);
  3036. parseAssignmentExpression(ast->initializer);
  3037. }
  3038. if (parseObjCContextKeyword(Token_in, ast->in_token)) {
  3039. blockErrors(blocked);
  3040. parseExpression(ast->fast_enumeratable_expression);
  3041. match(T_RPAREN, &ast->rparen_token);
  3042. parseStatement(ast->statement);
  3043. node = ast;
  3044. return true;
  3045. }
  3046. // there was no "in" token, so we continue with a normal for-statement
  3047. rewind(startOfTypeSpecifier);
  3048. }
  3049. if (_languageFeatures.cxx11Enabled) {
  3050. RangeBasedForStatementAST *ast = new (_pool) RangeBasedForStatementAST;
  3051. ast->for_token = for_token;
  3052. ast->lparen_token = lparen_token;
  3053. if (parseTypeSpecifier(ast->type_specifier_list))
  3054. parseDeclarator(ast->declarator, ast->type_specifier_list);
  3055. if ((ast->type_specifier_list || ast->declarator) && LA() == T_COLON) {
  3056. ast->colon_token = consumeToken();
  3057. blockErrors(blocked);
  3058. if (LA() == T_LBRACE)
  3059. parseBracedInitList0x(ast->expression);
  3060. else
  3061. parseExpression(ast->expression);
  3062. match(T_RPAREN, &ast->rparen_token);
  3063. parseStatement(ast->statement);
  3064. // We need both type specifier and declarator for C++11 range-based for
  3065. if (!ast->type_specifier_list || !ast->declarator)
  3066. error(for_token, "expected declaration with type specifier");
  3067. node = ast;
  3068. return true;
  3069. }
  3070. rewind(startOfTypeSpecifier);
  3071. }
  3072. blockErrors(blocked);
  3073. // Normal C/C++ for-statement parsing
  3074. ForStatementAST *ast = new (_pool) ForStatementAST;
  3075. ast->for_token = for_token;
  3076. ast->lparen_token = lparen_token;
  3077. parseForInitStatement(ast->initializer);
  3078. parseCondition(ast->condition);
  3079. match(T_SEMICOLON, &ast->semicolon_token);
  3080. parseExpression(ast->expression);
  3081. match(T_RPAREN, &ast->rparen_token);
  3082. parseStatement(ast->statement);
  3083. node = ast;
  3084. return true;
  3085. }
  3086. bool Parser::parseForInitStatement(StatementAST *&node)
  3087. {
  3088. DEBUG_THIS_RULE();
  3089. return parseExpressionOrDeclarationStatement(node);
  3090. }
  3091. bool Parser::parseCompoundStatement(StatementAST *&node)
  3092. {
  3093. DEBUG_THIS_RULE();
  3094. if (LA() == T_LBRACE) {
  3095. if (_statementDepth > MAX_STATEMENT_DEPTH)
  3096. return false;
  3097. ++_statementDepth;
  3098. CompoundStatementAST *ast = new (_pool) CompoundStatementAST;
  3099. ast->lbrace_token = consumeToken();
  3100. // ### TODO: the GNU "local label" extension: "__label__ X, Y, Z;"
  3101. // These are only allowed at the start of a compound stmt regardless of the language.
  3102. StatementListAST **statement_ptr = &ast->statement_list;
  3103. while (int tk = LA()) {
  3104. if (tk == T_RBRACE)
  3105. break;
  3106. unsigned start_statement = cursor();
  3107. StatementAST *statement = 0;
  3108. if (! parseStatement(statement)) {
  3109. rewind(start_statement + 1);
  3110. skipUntilStatement();
  3111. } else {
  3112. *statement_ptr = new (_pool) StatementListAST;
  3113. (*statement_ptr)->value = statement;
  3114. statement_ptr = &(*statement_ptr)->next;
  3115. }
  3116. }
  3117. match(T_RBRACE, &ast->rbrace_token);
  3118. node = ast;
  3119. --_statementDepth;
  3120. return true;
  3121. }
  3122. return false;
  3123. }
  3124. bool Parser::parseIfStatement(StatementAST *&node)
  3125. {
  3126. DEBUG_THIS_RULE();
  3127. if (LA() == T_IF) {
  3128. IfStatementAST *ast = new (_pool) IfStatementAST;
  3129. ast->if_token = consumeToken();
  3130. match(T_LPAREN, &ast->lparen_token);
  3131. parseCondition(ast->condition);
  3132. match(T_RPAREN, &ast->rparen_token);
  3133. if (! parseStatement(ast->statement))
  3134. error(cursor(), "expected statement");
  3135. if (LA() == T_ELSE) {
  3136. ast->else_token = consumeToken();
  3137. if (! parseStatement(ast->else_statement))
  3138. error(cursor(), "expected statement");
  3139. }
  3140. node = ast;
  3141. return true;
  3142. }
  3143. return false;
  3144. }
  3145. bool Parser::parseSwitchStatement(StatementAST *&node)
  3146. {
  3147. DEBUG_THIS_RULE();
  3148. if (LA() == T_SWITCH) {
  3149. SwitchStatementAST *ast = new (_pool) SwitchStatementAST;
  3150. ast->switch_token = consumeToken();
  3151. match(T_LPAREN, &ast->lparen_token);
  3152. parseCondition(ast->condition);
  3153. match(T_RPAREN, &ast->rparen_token);
  3154. parseStatement(ast->statement);
  3155. node = ast;
  3156. return true;
  3157. }
  3158. return false;
  3159. }
  3160. bool Parser::parseLabeledStatement(StatementAST *&node)
  3161. {
  3162. DEBUG_THIS_RULE();
  3163. switch (LA()) {
  3164. case T_IDENTIFIER:
  3165. if (LA(2) == T_COLON) {
  3166. LabeledStatementAST *ast = new (_pool) LabeledStatementAST;
  3167. ast->label_token = consumeToken();
  3168. ast->colon_token = consumeToken();
  3169. parseStatement(ast->statement, /*blockLabeledStatement =*/ true);
  3170. node = ast;
  3171. return true;
  3172. }
  3173. break;
  3174. case T_DEFAULT: {
  3175. LabeledStatementAST *ast = new (_pool) LabeledStatementAST;
  3176. ast->label_token = consumeToken();
  3177. match(T_COLON, &ast->colon_token);
  3178. parseStatement(ast->statement, /*blockLabeledStatement =*/ true);
  3179. node = ast;
  3180. return true;
  3181. }
  3182. case T_CASE: {
  3183. CaseStatementAST *ast = new (_pool) CaseStatementAST;
  3184. ast->case_token = consumeToken();
  3185. parseConstantExpression(ast->expression);
  3186. match(T_COLON, &ast->colon_token);
  3187. parseStatement(ast->statement, /*blockLabeledStatement =*/ true);
  3188. node = ast;
  3189. return true;
  3190. }
  3191. default:
  3192. break;
  3193. } // switch
  3194. return false;
  3195. }
  3196. bool Parser::parseBlockDeclaration(DeclarationAST *&node)
  3197. {
  3198. DEBUG_THIS_RULE();
  3199. switch (LA()) {
  3200. case T_USING:
  3201. return parseUsing(node);
  3202. case T_ASM:
  3203. return parseAsmDefinition(node);
  3204. case T_NAMESPACE:
  3205. return parseNamespaceAliasDefinition(node);
  3206. case T_STATIC_ASSERT:
  3207. if (_languageFeatures.cxx11Enabled)
  3208. return parseStaticAssertDeclaration(node);
  3209. // fall-through
  3210. default:
  3211. return parseSimpleDeclaration(node);
  3212. } // switch
  3213. }
  3214. bool Parser::parseNamespaceAliasDefinition(DeclarationAST *&node)
  3215. {
  3216. DEBUG_THIS_RULE();
  3217. if (LA() == T_NAMESPACE && LA(2) == T_IDENTIFIER && LA(3) == T_EQUAL) {
  3218. NamespaceAliasDefinitionAST *ast = new (_pool) NamespaceAliasDefinitionAST;
  3219. ast->namespace_token = consumeToken();
  3220. ast->namespace_name_token = consumeToken();
  3221. ast->equal_token = consumeToken();
  3222. parseName(ast->name);
  3223. match(T_SEMICOLON, &ast->semicolon_token);
  3224. node = ast;
  3225. return true;
  3226. }
  3227. return false;
  3228. }
  3229. bool Parser::parseDeclarationStatement(StatementAST *&node)
  3230. {
  3231. DEBUG_THIS_RULE();
  3232. unsigned start = cursor();
  3233. DeclarationAST *declaration = 0;
  3234. if (! parseBlockDeclaration(declaration))
  3235. return false;
  3236. if (SimpleDeclarationAST *simpleDeclaration = declaration->asSimpleDeclaration()) {
  3237. if (! simpleDeclaration->decl_specifier_list) {
  3238. rewind(start);
  3239. return false;
  3240. }
  3241. }
  3242. DeclarationStatementAST *ast = new (_pool) DeclarationStatementAST;
  3243. ast->declaration = declaration;
  3244. node = ast;
  3245. return true;
  3246. }
  3247. bool Parser::lookAtCVQualifier() const
  3248. {
  3249. switch (LA()) {
  3250. case T_CONST:
  3251. case T_VOLATILE:
  3252. return true;
  3253. default:
  3254. return false;
  3255. }
  3256. }
  3257. bool Parser::lookAtFunctionSpecifier() const
  3258. {
  3259. switch (LA()) {
  3260. case T_INLINE:
  3261. case T_VIRTUAL:
  3262. case T_EXPLICIT:
  3263. return true;
  3264. default:
  3265. return false;
  3266. }
  3267. }
  3268. bool Parser::lookAtStorageClassSpecifier() const
  3269. {
  3270. switch (LA()) {
  3271. case T_FRIEND:
  3272. case T_REGISTER:
  3273. case T_STATIC:
  3274. case T_EXTERN:
  3275. case T_MUTABLE:
  3276. case T_TYPEDEF:
  3277. case T___THREAD:
  3278. return true;
  3279. case T_THREAD_LOCAL:
  3280. return _languageFeatures.cxx11Enabled;
  3281. case T_CONSTEXPR:
  3282. if (_languageFeatures.cxx11Enabled)
  3283. return true;
  3284. // fall-through
  3285. default:
  3286. return false;
  3287. }
  3288. }
  3289. bool Parser::lookAtBuiltinTypeSpecifier() const
  3290. {
  3291. switch (LA()) {
  3292. case T_CHAR:
  3293. case T_CHAR16_T:
  3294. case T_CHAR32_T:
  3295. case T_WCHAR_T:
  3296. case T_BOOL:
  3297. case T_SHORT:
  3298. case T_INT:
  3299. case T_LONG:
  3300. case T_SIGNED:
  3301. case T_UNSIGNED:
  3302. case T_FLOAT:
  3303. case T_DOUBLE:
  3304. case T_VOID:
  3305. case T_AUTO:
  3306. case T_DECLTYPE:
  3307. return true;
  3308. // [gcc] extensions
  3309. case T___TYPEOF__:
  3310. case T___ATTRIBUTE__:
  3311. return true;
  3312. default:
  3313. return false;
  3314. }
  3315. }
  3316. bool Parser::lookAtClassKey() const
  3317. {
  3318. switch (LA()) {
  3319. case T_CLASS:
  3320. case T_STRUCT:
  3321. case T_UNION:
  3322. return true;
  3323. default:
  3324. return false;
  3325. }
  3326. }
  3327. bool Parser::parseOptionalAttributeSpecifierSequence(SpecifierListAST *&attribute_list)
  3328. {
  3329. bool didRead = false;
  3330. while (parseAttributeSpecifier(attribute_list))
  3331. didRead = true;
  3332. return didRead;
  3333. }
  3334. bool Parser::parseAttributeSpecifier(SpecifierListAST *&attribute_list)
  3335. {
  3336. SpecifierListAST **attr_ptr = &attribute_list;
  3337. switch (LA()) {
  3338. case T_ALIGNAS: {
  3339. AlignmentSpecifierAST *ast = new (_pool) AlignmentSpecifierAST;
  3340. ast->align_token = consumeToken();
  3341. match(T_LPAREN, &ast->lparen_token);
  3342. const unsigned saved = cursor();
  3343. if (!parseTypeId(ast->typeIdExprOrAlignmentExpr) ||
  3344. (LA() != T_RPAREN &&
  3345. (LA(1) != T_DOT_DOT_DOT || LA(2) != T_RPAREN))) {
  3346. rewind(saved);
  3347. parseExpression(ast->typeIdExprOrAlignmentExpr);
  3348. }
  3349. if (LA() == T_DOT_DOT_DOT)
  3350. ast->ellipses_token = consumeToken();
  3351. match(T_RPAREN, &ast->rparen_token);
  3352. attribute_list = new (_pool) SpecifierListAST(ast);
  3353. return true;
  3354. }
  3355. //### TODO: C++11-style attributes
  3356. // case T_LBRACKET:
  3357. case T___ATTRIBUTE__:
  3358. while (LA() == T___ATTRIBUTE__) {
  3359. parseGnuAttributeSpecifier(*attr_ptr);
  3360. attr_ptr = &(*attr_ptr)->next;
  3361. }
  3362. return true;
  3363. default:
  3364. return false;
  3365. }
  3366. }
  3367. bool Parser::parseGnuAttributeSpecifier(SpecifierListAST *&node)
  3368. {
  3369. DEBUG_THIS_RULE();
  3370. if (LA() != T___ATTRIBUTE__)
  3371. return false;
  3372. GnuAttributeSpecifierAST *ast = new (_pool) GnuAttributeSpecifierAST;
  3373. ast->attribute_token = consumeToken();
  3374. match(T_LPAREN, &ast->first_lparen_token);
  3375. match(T_LPAREN, &ast->second_lparen_token);
  3376. parseGnuAttributeList(ast->attribute_list);
  3377. match(T_RPAREN, &ast->first_rparen_token);
  3378. match(T_RPAREN, &ast->second_rparen_token);
  3379. node = new (_pool) SpecifierListAST(ast);
  3380. return true;
  3381. }
  3382. bool Parser::parseGnuAttributeList(GnuAttributeListAST *&node)
  3383. {
  3384. DEBUG_THIS_RULE();
  3385. GnuAttributeListAST **iter = &node;
  3386. while (LA() == T_CONST || LA() == T_IDENTIFIER) {
  3387. *iter = new (_pool) GnuAttributeListAST;
  3388. if (LA() == T_CONST) {
  3389. GnuAttributeAST *attr = new (_pool) GnuAttributeAST;
  3390. attr->identifier_token = consumeToken();
  3391. (*iter)->value = attr;
  3392. iter = &(*iter)->next;
  3393. } else if (LA() == T_IDENTIFIER) {
  3394. GnuAttributeAST *attr = new (_pool) GnuAttributeAST;
  3395. attr->identifier_token = consumeToken();
  3396. if (LA() == T_LPAREN) {
  3397. attr->lparen_token = consumeToken();
  3398. parseExpressionList(attr->expression_list);
  3399. match(T_RPAREN, &attr->rparen_token);
  3400. }
  3401. (*iter)->value = attr;
  3402. iter = &(*iter)->next;
  3403. }
  3404. if (LA() != T_COMMA)
  3405. break;
  3406. consumeToken(); // skip T_COMMA
  3407. }
  3408. return true;
  3409. }
  3410. bool Parser::parseBuiltinTypeSpecifier(SpecifierListAST *&node)
  3411. {
  3412. DEBUG_THIS_RULE();
  3413. if (LA() == T___ATTRIBUTE__) {
  3414. return parseGnuAttributeSpecifier(node);
  3415. } else if (LA() == T___TYPEOF__) {
  3416. TypeofSpecifierAST *ast = new (_pool) TypeofSpecifierAST;
  3417. ast->typeof_token = consumeToken();
  3418. if (LA() == T_LPAREN) {
  3419. unsigned lparen_token = consumeToken();
  3420. if (parseTypeId(ast->expression) && LA() == T_RPAREN) {
  3421. ast->lparen_token = lparen_token;
  3422. ast->rparen_token = consumeToken();
  3423. node = new (_pool) SpecifierListAST(ast);
  3424. return true;
  3425. }
  3426. rewind(lparen_token);
  3427. }
  3428. parseUnaryExpression(ast->expression);
  3429. node = new (_pool) SpecifierListAST(ast);
  3430. return true;
  3431. } else if (LA() == T_DECLTYPE) {
  3432. DecltypeSpecifierAST *ast = new (_pool) DecltypeSpecifierAST;
  3433. ast->decltype_token = consumeToken();
  3434. match(T_LPAREN, &ast->lparen_token);
  3435. if (parseExpression(ast->expression))
  3436. match(T_RPAREN, &ast->rparen_token);
  3437. node = new (_pool) SpecifierListAST(ast);
  3438. return true;
  3439. } else if (lookAtBuiltinTypeSpecifier()) {
  3440. SimpleSpecifierAST *ast = new (_pool) SimpleSpecifierAST;
  3441. ast->specifier_token = consumeToken();
  3442. node = new (_pool) SpecifierListAST(ast);
  3443. return true;
  3444. }
  3445. return false;
  3446. }
  3447. bool Parser::parseSimpleDeclaration(DeclarationAST *&node, ClassSpecifierAST *declaringClass)
  3448. {
  3449. DEBUG_THIS_RULE();
  3450. unsigned qt_invokable_token = 0;
  3451. if (declaringClass && (LA() == T_Q_SIGNAL || LA() == T_Q_SLOT || LA() == T_Q_INVOKABLE))
  3452. qt_invokable_token = consumeToken();
  3453. // parse a simple declaration, a function definition,
  3454. // or a contructor declaration.
  3455. bool has_type_specifier = false;
  3456. bool has_complex_type_specifier = false;
  3457. unsigned startOfNamedTypeSpecifier = 0;
  3458. NameAST *named_type_specifier = 0;
  3459. SpecifierListAST *decl_specifier_seq = 0,
  3460. **decl_specifier_seq_ptr = &decl_specifier_seq;
  3461. for (;;) {
  3462. if (lookAtCVQualifier() || lookAtFunctionSpecifier()
  3463. || lookAtStorageClassSpecifier()) {
  3464. SimpleSpecifierAST *spec = new (_pool) SimpleSpecifierAST;
  3465. spec->specifier_token = consumeToken();
  3466. *decl_specifier_seq_ptr = new (_pool) SpecifierListAST(spec);
  3467. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3468. } else if (parseAttributeSpecifier(*decl_specifier_seq_ptr)) {
  3469. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3470. } else if (! named_type_specifier && ! has_complex_type_specifier && lookAtBuiltinTypeSpecifier()) {
  3471. parseBuiltinTypeSpecifier(*decl_specifier_seq_ptr);
  3472. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3473. has_type_specifier = true;
  3474. } else if (! has_type_specifier && (LA() == T_COLON_COLON ||
  3475. LA() == T_IDENTIFIER)) {
  3476. startOfNamedTypeSpecifier = cursor();
  3477. if (parseName(named_type_specifier)) {
  3478. const Identifier *classIdentifier = className(declaringClass);
  3479. if (QualifiedNameAST *qn = named_type_specifier->asQualifiedName())
  3480. if (NestedNameSpecifierListAST *namesList = qn->nested_name_specifier_list)
  3481. if (NestedNameSpecifierAST *lastName = namesList->lastValue())
  3482. classIdentifier = identifier(lastName->class_or_namespace_name);
  3483. if (LA() == T_LPAREN && identifier(named_type_specifier) == classIdentifier) {
  3484. // looks like a constructor declaration
  3485. rewind(startOfNamedTypeSpecifier);
  3486. break;
  3487. }
  3488. NamedTypeSpecifierAST *spec = new (_pool) NamedTypeSpecifierAST;
  3489. spec->name = named_type_specifier;
  3490. *decl_specifier_seq_ptr = new (_pool) SpecifierListAST(spec);
  3491. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3492. has_type_specifier = true;
  3493. } else {
  3494. rewind(startOfNamedTypeSpecifier);
  3495. break;
  3496. }
  3497. } else if (! has_type_specifier && LA() == T_ENUM) {
  3498. unsigned startOfTypeSpecifier = cursor();
  3499. if (! parseElaboratedTypeSpecifier(*decl_specifier_seq_ptr)
  3500. || LA() == T_LBRACE
  3501. || (_languageFeatures.cxx11Enabled && LA() == T_COLON)) {
  3502. rewind(startOfTypeSpecifier);
  3503. if (! parseEnumSpecifier(*decl_specifier_seq_ptr)) {
  3504. error(startOfTypeSpecifier, "expected an enum specifier");
  3505. break;
  3506. }
  3507. has_complex_type_specifier = true;
  3508. }
  3509. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3510. has_type_specifier = true;
  3511. } else if (! has_type_specifier && LA() == T_TYPENAME) {
  3512. unsigned startOfElaboratedTypeSpecifier = cursor();
  3513. if (! parseElaboratedTypeSpecifier(*decl_specifier_seq_ptr)) {
  3514. error(startOfElaboratedTypeSpecifier, "expected an elaborated type specifier");
  3515. break;
  3516. }
  3517. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3518. has_type_specifier = true;
  3519. } else if (! has_type_specifier && lookAtClassKey()) {
  3520. unsigned startOfTypeSpecifier = cursor();
  3521. if (! parseElaboratedTypeSpecifier(*decl_specifier_seq_ptr) ||
  3522. (LA() == T_COLON || LA() == T_LBRACE
  3523. || (LA(0) == T_IDENTIFIER && LA(1) == T_IDENTIFIER // MACRO Name followed by : or {
  3524. && (LA(2) == T_COLON || LA(2) == T_LBRACE))
  3525. || (LA(0) == T_IDENTIFIER && LA(1) == T_IDENTIFIER && LA(2) == T_IDENTIFIER && // MACRO Name final followed by : or {
  3526. (LA(3) == T_COLON || LA(3) == T_LBRACE)))) {
  3527. rewind(startOfTypeSpecifier);
  3528. if (! parseClassSpecifier(*decl_specifier_seq_ptr)) {
  3529. error(startOfTypeSpecifier, "wrong type specifier");
  3530. break;
  3531. }
  3532. has_complex_type_specifier = true;
  3533. }
  3534. decl_specifier_seq_ptr = &(*decl_specifier_seq_ptr)->next;
  3535. has_type_specifier = true;
  3536. } else
  3537. break;
  3538. }
  3539. DeclaratorListAST *declarator_list = 0,
  3540. **declarator_ptr = &declarator_list;
  3541. DeclaratorAST *declarator = 0;
  3542. if (LA() != T_SEMICOLON) {
  3543. const bool maybeCtor = (LA() == T_LPAREN && named_type_specifier);
  3544. bool didParseInitDeclarator = parseInitDeclarator(declarator, decl_specifier_seq, declaringClass);
  3545. if ((! didParseInitDeclarator && maybeCtor) || (didParseInitDeclarator && maybeCtor && LA() == T_COLON)){
  3546. rewind(startOfNamedTypeSpecifier);
  3547. named_type_specifier = 0;
  3548. // pop the named type specifier from the decl-specifier-seq
  3549. SpecifierListAST **spec_ptr = &decl_specifier_seq;
  3550. for (; *spec_ptr; spec_ptr = &(*spec_ptr)->next) {
  3551. if (! (*spec_ptr)->next) {
  3552. *spec_ptr = 0;
  3553. break;
  3554. }
  3555. }
  3556. if (! parseInitDeclarator(declarator, decl_specifier_seq, declaringClass))
  3557. return false;
  3558. }
  3559. }
  3560. // if there is no valid declarator
  3561. // and it doesn't look like a fwd or a class declaration
  3562. // then it's not a declarations
  3563. if (! declarator && ! maybeForwardOrClassDeclaration(decl_specifier_seq))
  3564. return false;
  3565. DeclaratorAST *firstDeclarator = declarator;
  3566. if (declarator) {
  3567. *declarator_ptr = new (_pool) DeclaratorListAST;
  3568. (*declarator_ptr)->value = declarator;
  3569. declarator_ptr = &(*declarator_ptr)->next;
  3570. }
  3571. if (LA() == T_COMMA || LA() == T_SEMICOLON || has_complex_type_specifier) {
  3572. while (LA() == T_COMMA) {
  3573. consumeToken(); // consume T_COMMA
  3574. declarator = 0;
  3575. if (parseInitDeclarator(declarator, decl_specifier_seq, declaringClass)) {
  3576. *declarator_ptr = new (_pool) DeclaratorListAST;
  3577. (*declarator_ptr)->value = declarator;
  3578. declarator_ptr = &(*declarator_ptr)->next;
  3579. }
  3580. }
  3581. SimpleDeclarationAST *ast = new (_pool) SimpleDeclarationAST;
  3582. ast->qt_invokable_token = qt_invokable_token;
  3583. ast->decl_specifier_list = decl_specifier_seq;
  3584. ast->declarator_list = declarator_list;
  3585. match(T_SEMICOLON, &ast->semicolon_token);
  3586. node = ast;
  3587. return true;
  3588. } else if (! _inFunctionBody && declarator && (LA() == T_COLON || LA() == T_LBRACE || LA() == T_TRY)) {
  3589. if (LA() == T_TRY) {
  3590. FunctionDefinitionAST *ast = new (_pool) FunctionDefinitionAST;
  3591. ast->qt_invokable_token = qt_invokable_token;
  3592. ast->decl_specifier_list = decl_specifier_seq;
  3593. ast->declarator = firstDeclarator;
  3594. parseTryBlockStatement(ast->function_body, &ast->ctor_initializer);
  3595. node = ast;
  3596. return true; // recognized a function definition.
  3597. } else {
  3598. CtorInitializerAST *ctor_initializer = 0;
  3599. bool hasCtorInitializer = false;
  3600. if (LA() == T_COLON) {
  3601. hasCtorInitializer = true;
  3602. parseCtorInitializer(ctor_initializer);
  3603. if (LA() != T_LBRACE) {
  3604. const unsigned pos = cursor();
  3605. for (int n = 0; n < 3 && LA(); consumeToken(), ++n)
  3606. if (LA() == T_LBRACE)
  3607. break;
  3608. if (LA() != T_LBRACE) {
  3609. error(pos, "unexpected token `%s'", _translationUnit->spell(pos));
  3610. rewind(pos);
  3611. }
  3612. }
  3613. }
  3614. if (LA() == T_LBRACE || hasCtorInitializer) {
  3615. FunctionDefinitionAST *ast = new (_pool) FunctionDefinitionAST;
  3616. ast->qt_invokable_token = qt_invokable_token;
  3617. ast->decl_specifier_list = decl_specifier_seq;
  3618. ast->declarator = firstDeclarator;
  3619. ast->ctor_initializer = ctor_initializer;
  3620. parseFunctionBody(ast->function_body);
  3621. node = ast;
  3622. return true; // recognized a function definition.
  3623. }
  3624. }
  3625. }
  3626. error(cursor(), "unexpected token `%s'", tok().spell());
  3627. return false;
  3628. }
  3629. bool Parser::maybeForwardOrClassDeclaration(SpecifierListAST *decl_specifier_seq) const
  3630. {
  3631. // look at the decl_specifier for possible fwd or class declarations.
  3632. if (SpecifierListAST *it = decl_specifier_seq) {
  3633. while (it) {
  3634. SimpleSpecifierAST *spec = it->value->asSimpleSpecifier();
  3635. if (spec && _translationUnit->tokenKind(spec->specifier_token) == T_FRIEND)
  3636. it = it->next;
  3637. else
  3638. break;
  3639. }
  3640. if (it) {
  3641. SpecifierAST *spec = it->value;
  3642. if (spec->asElaboratedTypeSpecifier() ||
  3643. spec->asEnumSpecifier() ||
  3644. spec->asClassSpecifier()) {
  3645. for (it = it->next; it; it = it->next)
  3646. if (it->value->asAttributeSpecifier() == 0)
  3647. return false;
  3648. return true;
  3649. }
  3650. }
  3651. }
  3652. return false;
  3653. }
  3654. bool Parser::parseFunctionBody(StatementAST *&node)
  3655. {
  3656. DEBUG_THIS_RULE();
  3657. if (_translationUnit->skipFunctionBody()) {
  3658. unsigned token_lbrace = 0;
  3659. match(T_LBRACE, &token_lbrace);
  3660. if (! token_lbrace)
  3661. return false;
  3662. const Token &tk = _translationUnit->tokenAt(token_lbrace);
  3663. if (tk.close_brace)
  3664. rewind(tk.close_brace);
  3665. unsigned token_rbrace = 0;
  3666. match(T_RBRACE, &token_rbrace);
  3667. return true;
  3668. }
  3669. _inFunctionBody = true;
  3670. const bool parsed = parseCompoundStatement(node);
  3671. _inFunctionBody = false;
  3672. return parsed;
  3673. }
  3674. /**
  3675. * Parses both try-block and function-try-block
  3676. * @param placeholder Non-null for function-try-block in around constructor
  3677. *
  3678. * try-block:
  3679. * try compound-statement handler-seq
  3680. * function-try-block:
  3681. * try [ctor-initializer] compound-statement handler-seq
  3682. */
  3683. bool Parser::parseTryBlockStatement(StatementAST *&node, CtorInitializerAST **placeholder)
  3684. {
  3685. DEBUG_THIS_RULE();
  3686. if (LA() == T_TRY) {
  3687. TryBlockStatementAST *ast = new (_pool) TryBlockStatementAST;
  3688. // try
  3689. ast->try_token = consumeToken();
  3690. // [ctor-initializer]
  3691. if (LA() == T_COLON) {
  3692. const unsigned colonPos = cursor();
  3693. CtorInitializerAST *ctor_initializer = 0;
  3694. parseCtorInitializer(ctor_initializer);
  3695. if (LA() != T_LBRACE) {
  3696. const unsigned pos = cursor();
  3697. for (int n = 0; n < 3 && LA(); consumeToken(), ++n)
  3698. if (LA() == T_LBRACE)
  3699. break;
  3700. if (LA() != T_LBRACE) {
  3701. error(pos, "unexpected token `%s'", _translationUnit->spell(pos));
  3702. rewind(pos);
  3703. }
  3704. }
  3705. if (placeholder)
  3706. *placeholder = ctor_initializer;
  3707. else
  3708. error(colonPos, "constructor initializer not allowed inside function body");
  3709. }
  3710. // compound-statement
  3711. parseCompoundStatement(ast->statement);
  3712. // handler-seq
  3713. CatchClauseListAST **catch_clause_ptr = &ast->catch_clause_list;
  3714. while (parseCatchClause(*catch_clause_ptr))
  3715. catch_clause_ptr = &(*catch_clause_ptr)->next;
  3716. node = ast;
  3717. return true;
  3718. }
  3719. return false;
  3720. }
  3721. bool Parser::parseCatchClause(CatchClauseListAST *&node)
  3722. {
  3723. DEBUG_THIS_RULE();
  3724. if (LA() == T_CATCH) {
  3725. CatchClauseAST *ast = new (_pool) CatchClauseAST;
  3726. ast->catch_token = consumeToken();
  3727. match(T_LPAREN, &ast->lparen_token);
  3728. parseExceptionDeclaration(ast->exception_declaration);
  3729. match(T_RPAREN, &ast->rparen_token);
  3730. parseCompoundStatement(ast->statement);
  3731. node = new (_pool) CatchClauseListAST(ast);
  3732. return true;
  3733. }
  3734. return false;
  3735. }
  3736. bool Parser::parseExceptionDeclaration(ExceptionDeclarationAST *&node)
  3737. {
  3738. DEBUG_THIS_RULE();
  3739. if (LA() == T_DOT_DOT_DOT) {
  3740. ExceptionDeclarationAST *ast = new (_pool) ExceptionDeclarationAST;
  3741. ast->dot_dot_dot_token = consumeToken();
  3742. node = ast;
  3743. return true;
  3744. }
  3745. SpecifierListAST *type_specifier = 0;
  3746. if (parseTypeSpecifier(type_specifier)) {
  3747. ExceptionDeclarationAST *ast = new (_pool) ExceptionDeclarationAST;
  3748. ast->type_specifier_list = type_specifier;
  3749. parseDeclaratorOrAbstractDeclarator(ast->declarator, type_specifier);
  3750. node = ast;
  3751. return true;
  3752. }
  3753. return false;
  3754. }
  3755. bool Parser::parseBoolLiteral(ExpressionAST *&node)
  3756. {
  3757. DEBUG_THIS_RULE();
  3758. if (LA() == T_TRUE || LA() == T_FALSE) {
  3759. BoolLiteralAST *ast = new (_pool) BoolLiteralAST;
  3760. ast->literal_token = consumeToken();
  3761. node = ast;
  3762. return true;
  3763. }
  3764. return false;
  3765. }
  3766. bool Parser::parseNumericLiteral(ExpressionAST *&node)
  3767. {
  3768. DEBUG_THIS_RULE();
  3769. if (LA() == T_NUMERIC_LITERAL ||
  3770. LA() == T_CHAR_LITERAL ||
  3771. LA() == T_WIDE_CHAR_LITERAL ||
  3772. LA() == T_UTF16_CHAR_LITERAL ||
  3773. LA() == T_UTF32_CHAR_LITERAL) {
  3774. NumericLiteralAST *ast = new (_pool) NumericLiteralAST;
  3775. ast->literal_token = consumeToken();
  3776. node = ast;
  3777. return true;
  3778. }
  3779. return false;
  3780. }
  3781. bool Parser::parsePointerLiteral(ExpressionAST *&node)
  3782. {
  3783. DEBUG_THIS_RULE();
  3784. if (LA() == T_NULLPTR) {
  3785. PointerLiteralAST *ast = new (_pool) PointerLiteralAST;
  3786. ast->literal_token = consumeToken();
  3787. node = ast;
  3788. return true;
  3789. }
  3790. return false;
  3791. }
  3792. bool Parser::parseThisExpression(ExpressionAST *&node)
  3793. {
  3794. DEBUG_THIS_RULE();
  3795. if (LA() == T_THIS) {
  3796. ThisExpressionAST *ast = new (_pool) ThisExpressionAST;
  3797. ast->this_token = consumeToken();
  3798. node = ast;
  3799. return true;
  3800. }
  3801. return false;
  3802. }
  3803. bool Parser::parsePrimaryExpression(ExpressionAST *&node)
  3804. {
  3805. DEBUG_THIS_RULE();
  3806. switch (LA()) {
  3807. case T_STRING_LITERAL:
  3808. case T_WIDE_STRING_LITERAL:
  3809. case T_UTF8_STRING_LITERAL:
  3810. case T_UTF16_STRING_LITERAL:
  3811. case T_UTF32_STRING_LITERAL:
  3812. case T_RAW_STRING_LITERAL:
  3813. case T_RAW_WIDE_STRING_LITERAL:
  3814. case T_RAW_UTF8_STRING_LITERAL:
  3815. case T_RAW_UTF16_STRING_LITERAL:
  3816. case T_RAW_UTF32_STRING_LITERAL:
  3817. return parseStringLiteral(node);
  3818. case T_NULLPTR:
  3819. if (_languageFeatures.cxx11Enabled)
  3820. return parsePointerLiteral(node);
  3821. // fall-through
  3822. case T_CHAR_LITERAL: // ### FIXME don't use NumericLiteral for chars
  3823. case T_WIDE_CHAR_LITERAL:
  3824. case T_UTF16_CHAR_LITERAL:
  3825. case T_UTF32_CHAR_LITERAL:
  3826. case T_NUMERIC_LITERAL:
  3827. return parseNumericLiteral(node);
  3828. case T_TRUE:
  3829. case T_FALSE:
  3830. return parseBoolLiteral(node);
  3831. case T_THIS:
  3832. return parseThisExpression(node);
  3833. case T_LPAREN:
  3834. if (LA(2) == T_LBRACE) {
  3835. // GNU extension: '(' '{' statement-list '}' ')'
  3836. CompoundExpressionAST *ast = new (_pool) CompoundExpressionAST;
  3837. ast->lparen_token = consumeToken();
  3838. StatementAST *statement = 0;
  3839. parseCompoundStatement(statement);
  3840. ast->statement = statement->asCompoundStatement();
  3841. match(T_RPAREN, &ast->rparen_token);
  3842. node = ast;
  3843. return true;
  3844. } else {
  3845. return parseNestedExpression(node);
  3846. }
  3847. case T_SIGNAL:
  3848. case T_SLOT:
  3849. return parseQtMethod(node);
  3850. case T_LBRACKET: {
  3851. const unsigned lbracket_token = cursor();
  3852. if (_languageFeatures.cxx11Enabled) {
  3853. if (parseLambdaExpression(node))
  3854. return true;
  3855. }
  3856. if (_languageFeatures.objCEnabled) {
  3857. rewind(lbracket_token);
  3858. return parseObjCExpression(node);
  3859. }
  3860. } break;
  3861. case T_AT_STRING_LITERAL:
  3862. case T_AT_ENCODE:
  3863. case T_AT_PROTOCOL:
  3864. case T_AT_SELECTOR:
  3865. return parseObjCExpression(node);
  3866. default: {
  3867. NameAST *name = 0;
  3868. if (parseNameId(name)) {
  3869. IdExpressionAST *ast = new (_pool) IdExpressionAST;
  3870. ast->name = name;
  3871. node = ast;
  3872. return true;
  3873. }
  3874. break;
  3875. } // default
  3876. } // switch
  3877. return false;
  3878. }
  3879. bool Parser::parseObjCExpression(ExpressionAST *&node)
  3880. {
  3881. DEBUG_THIS_RULE();
  3882. switch (LA()) {
  3883. case T_AT_ENCODE:
  3884. return parseObjCEncodeExpression(node);
  3885. case T_AT_PROTOCOL:
  3886. return parseObjCProtocolExpression(node);
  3887. case T_AT_SELECTOR:
  3888. return parseObjCSelectorExpression(node);
  3889. case T_LBRACKET:
  3890. return parseObjCMessageExpression(node);
  3891. case T_AT_STRING_LITERAL:
  3892. return parseObjCStringLiteral(node);
  3893. default:
  3894. break;
  3895. } // switch
  3896. return false;
  3897. }
  3898. bool Parser::parseObjCStringLiteral(ExpressionAST *&node)
  3899. {
  3900. DEBUG_THIS_RULE();
  3901. if (LA() != T_AT_STRING_LITERAL)
  3902. return false;
  3903. StringLiteralAST **ast = reinterpret_cast<StringLiteralAST **> (&node);
  3904. while (LA() == T_AT_STRING_LITERAL) {
  3905. *ast = new (_pool) StringLiteralAST;
  3906. (*ast)->literal_token = consumeToken();
  3907. ast = &(*ast)->next;
  3908. }
  3909. return true;
  3910. }
  3911. /// objc-try-catch-statement:
  3912. /// @try compound-statement objc-catch-list[opt]
  3913. /// @try compound-statement objc-catch-list[opt] @finally compound-statement
  3914. ///
  3915. /// objc-catch-list:
  3916. /// @catch ( parameter-declaration ) compound-statement
  3917. /// objc-catch-list @catch ( catch-parameter-declaration ) compound-statement
  3918. /// catch-parameter-declaration:
  3919. /// parameter-declaration
  3920. /// '...' [OBJC2]
  3921. ///
  3922. bool Parser::parseObjCTryStatement(StatementAST *& /*node*/)
  3923. {
  3924. DEBUG_THIS_RULE();
  3925. if (LA() != T_AT_TRY)
  3926. return false;
  3927. /*try_token =*/ consumeToken();
  3928. StatementAST *body_statment;
  3929. parseCompoundStatement(body_statment);
  3930. while (LA() == T_AT_CATCH) {
  3931. /*catch_token =*/ consumeToken();
  3932. unsigned lparen_token;
  3933. match(T_LPAREN, &lparen_token);
  3934. if (LA() == T_DOT_DOT_DOT) {
  3935. /*unsigned ellipsis_token =*/ consumeToken();
  3936. } else {
  3937. ParameterDeclarationAST *exception_decl;
  3938. parseParameterDeclaration(exception_decl);
  3939. }
  3940. unsigned rparen_token;
  3941. match(T_RPAREN, &rparen_token);
  3942. StatementAST *catch_statement;
  3943. parseCompoundStatement(catch_statement);
  3944. }
  3945. if (LA() == T_AT_FINALLY) {
  3946. StatementAST *finally_statement;
  3947. parseCompoundStatement(finally_statement);
  3948. }
  3949. return true;
  3950. }
  3951. /// objc-synchronized-statement:
  3952. /// @synchronized expression ;
  3953. bool Parser::parseObjCSynchronizedStatement(StatementAST *&node)
  3954. {
  3955. DEBUG_THIS_RULE();
  3956. if (LA() != T_AT_SYNCHRONIZED)
  3957. return false;
  3958. ObjCSynchronizedStatementAST *ast = new (_pool) ObjCSynchronizedStatementAST;
  3959. ast->synchronized_token = consumeToken();
  3960. match(T_LPAREN, &ast->lparen_token);
  3961. parseExpression(ast->synchronized_object);
  3962. match(T_RPAREN, &ast->rparen_token);
  3963. parseStatement(ast->statement);
  3964. node = ast;
  3965. return true;
  3966. }
  3967. /// objc-throw-statement:
  3968. /// @ throw expression ;
  3969. bool Parser::parseObjCThrowStatement(StatementAST *&/*node*/)
  3970. {
  3971. DEBUG_THIS_RULE();
  3972. if (LA() != T_AT_THROW)
  3973. return false;
  3974. /*throw_token =*/ consumeToken();
  3975. ExpressionAST *thrown_expression;
  3976. parseExpression(thrown_expression);
  3977. unsigned semicolon_token;
  3978. match(T_SEMICOLON, &semicolon_token);
  3979. return true;
  3980. }
  3981. bool Parser::parseObjCEncodeExpression(ExpressionAST *&node)
  3982. {
  3983. DEBUG_THIS_RULE();
  3984. if (LA() != T_AT_ENCODE)
  3985. return false;
  3986. ObjCEncodeExpressionAST *ast = new (_pool) ObjCEncodeExpressionAST;
  3987. ast->encode_token = consumeToken();
  3988. parseObjCTypeName(ast->type_name);
  3989. node = ast;
  3990. return true;
  3991. }
  3992. bool Parser::parseObjCProtocolExpression(ExpressionAST *&node)
  3993. {
  3994. DEBUG_THIS_RULE();
  3995. if (LA() != T_AT_PROTOCOL)
  3996. return false;
  3997. ObjCProtocolExpressionAST *ast = new (_pool) ObjCProtocolExpressionAST;
  3998. ast->protocol_token = consumeToken();
  3999. match(T_LPAREN, &ast->lparen_token);
  4000. match(T_IDENTIFIER, &ast->identifier_token);
  4001. match(T_RPAREN, &ast->rparen_token);
  4002. node = ast;
  4003. return true;
  4004. }
  4005. bool Parser::parseObjCSelectorExpression(ExpressionAST *&node)
  4006. {
  4007. DEBUG_THIS_RULE();
  4008. if (LA() != T_AT_SELECTOR)
  4009. return false;
  4010. ObjCSelectorExpressionAST *ast = new (_pool) ObjCSelectorExpressionAST;
  4011. ast->selector_token = consumeToken();
  4012. match(T_LPAREN, &ast->lparen_token);
  4013. unsigned identifier_token = 0;
  4014. match(T_IDENTIFIER, &identifier_token);
  4015. if (LA() == T_COLON) {
  4016. ObjCSelectorAST *args = new (_pool) ObjCSelectorAST;
  4017. ast->selector = args;
  4018. ObjCSelectorArgumentListAST *last = new (_pool) ObjCSelectorArgumentListAST;
  4019. args->selector_argument_list = last;
  4020. last->value = new (_pool) ObjCSelectorArgumentAST;
  4021. last->value->name_token = identifier_token;
  4022. last->value->colon_token = consumeToken();
  4023. while (LA(1) == T_IDENTIFIER && LA(2) == T_COLON) {
  4024. last->next = new (_pool) ObjCSelectorArgumentListAST;
  4025. last = last->next;
  4026. last->value = new (_pool) ObjCSelectorArgumentAST;
  4027. last->value->name_token = consumeToken();
  4028. last->value->colon_token = consumeToken();
  4029. }
  4030. } else {
  4031. ObjCSelectorAST *args = new (_pool) ObjCSelectorAST;
  4032. ast->selector = args;
  4033. args->selector_argument_list = new (_pool) ObjCSelectorArgumentListAST;
  4034. args->selector_argument_list->value = new (_pool) ObjCSelectorArgumentAST;
  4035. args->selector_argument_list->value->name_token = identifier_token;
  4036. }
  4037. if (LA(1) == T_IDENTIFIER && LA(2) == T_RPAREN) {
  4038. const char *txt = tok(1).spell();
  4039. consumeToken();
  4040. error(cursor(), "missing ':' after '%s'", txt);
  4041. }
  4042. match(T_RPAREN, &ast->rparen_token);
  4043. node = ast;
  4044. return true;
  4045. }
  4046. bool Parser::parseObjCMessageExpression(ExpressionAST *&node)
  4047. {
  4048. DEBUG_THIS_RULE();
  4049. if (LA() != T_LBRACKET)
  4050. return false;
  4051. unsigned start = cursor();
  4052. unsigned lbracket_token = consumeToken();
  4053. ExpressionAST *receiver_expression = 0;
  4054. ObjCSelectorAST *selector = 0;
  4055. ObjCMessageArgumentListAST *argument_list = 0;
  4056. if (parseObjCMessageReceiver(receiver_expression) &&
  4057. parseObjCMessageArguments(selector, argument_list)) {
  4058. ObjCMessageExpressionAST *ast = new (_pool) ObjCMessageExpressionAST;
  4059. ast->lbracket_token = lbracket_token;
  4060. ast->receiver_expression = receiver_expression;
  4061. ast->selector = selector;
  4062. ast->argument_list = argument_list;
  4063. match(T_RBRACKET, &ast->rbracket_token);
  4064. node = ast;
  4065. return true;
  4066. }
  4067. rewind(start);
  4068. return false;
  4069. }
  4070. bool Parser::parseObjCMessageReceiver(ExpressionAST *&node)
  4071. {
  4072. DEBUG_THIS_RULE();
  4073. return parseExpression(node);
  4074. }
  4075. bool Parser::parseObjCMessageArguments(ObjCSelectorAST *&selNode, ObjCMessageArgumentListAST *& argNode)
  4076. {
  4077. DEBUG_THIS_RULE();
  4078. if (LA() == T_RBRACKET)
  4079. return false; // nothing to do.
  4080. unsigned start = cursor();
  4081. ObjCSelectorArgumentAST *selectorArgument = 0;
  4082. ObjCMessageArgumentAST *messageArgument = 0;
  4083. if (parseObjCSelectorArg(selectorArgument, messageArgument)) {
  4084. ObjCSelectorArgumentListAST *selAst = new (_pool) ObjCSelectorArgumentListAST;
  4085. selAst->value = selectorArgument;
  4086. ObjCSelectorArgumentListAST *lastSelector = selAst;
  4087. ObjCMessageArgumentListAST *argAst = new (_pool) ObjCMessageArgumentListAST;
  4088. argAst->value = messageArgument;
  4089. ObjCMessageArgumentListAST *lastArgument = argAst;
  4090. while (parseObjCSelectorArg(selectorArgument, messageArgument)) {
  4091. // accept the selector args.
  4092. lastSelector->next = new (_pool) ObjCSelectorArgumentListAST;
  4093. lastSelector = lastSelector->next;
  4094. lastSelector->value = selectorArgument;
  4095. lastArgument->next = new (_pool) ObjCMessageArgumentListAST;
  4096. lastArgument = lastArgument->next;
  4097. lastArgument->value = messageArgument;
  4098. }
  4099. if (LA() == T_COMMA) {
  4100. ExpressionAST **lastExpression = &lastArgument->value->parameter_value_expression;
  4101. while (LA() == T_COMMA) {
  4102. BinaryExpressionAST *binaryExpression = new (_pool) BinaryExpressionAST;
  4103. binaryExpression->left_expression = *lastExpression;
  4104. binaryExpression->binary_op_token = consumeToken(); // T_COMMA
  4105. parseAssignmentExpression(binaryExpression->right_expression);
  4106. lastExpression = &binaryExpression->right_expression;
  4107. }
  4108. }
  4109. ObjCSelectorAST *selWithArgs = new (_pool) ObjCSelectorAST;
  4110. selWithArgs->selector_argument_list = selAst;
  4111. selNode = selWithArgs;
  4112. argNode = argAst;
  4113. return true;
  4114. } else {
  4115. rewind(start);
  4116. unsigned name_token = 0;
  4117. if (!parseObjCSelector(name_token))
  4118. return false;
  4119. ObjCSelectorAST *sel = new (_pool) ObjCSelectorAST;
  4120. sel->selector_argument_list = new (_pool) ObjCSelectorArgumentListAST;
  4121. sel->selector_argument_list->value = new (_pool) ObjCSelectorArgumentAST;
  4122. sel->selector_argument_list->value->name_token = name_token;
  4123. selNode = sel;
  4124. argNode = 0;
  4125. return true;
  4126. }
  4127. return false;
  4128. }
  4129. bool Parser::parseObjCSelectorArg(ObjCSelectorArgumentAST *&selNode, ObjCMessageArgumentAST *&argNode)
  4130. {
  4131. DEBUG_THIS_RULE();
  4132. unsigned selector_token = 0;
  4133. if (!parseObjCSelector(selector_token))
  4134. return false;
  4135. if (LA() != T_COLON)
  4136. return false;
  4137. selNode = new (_pool) ObjCSelectorArgumentAST;
  4138. selNode->name_token = selector_token;
  4139. selNode->colon_token = consumeToken();
  4140. argNode = new (_pool) ObjCMessageArgumentAST;
  4141. ExpressionAST **expr = &argNode->parameter_value_expression;
  4142. unsigned expressionStart = cursor();
  4143. if (parseAssignmentExpression(*expr) && LA() == T_COLON && (*expr)->asCastExpression()) {
  4144. rewind(expressionStart);
  4145. parseUnaryExpression(*expr);
  4146. //
  4147. }
  4148. return true;
  4149. }
  4150. bool Parser::parseNameId(NameAST *&name)
  4151. {
  4152. DEBUG_THIS_RULE();
  4153. unsigned start = cursor();
  4154. if (! parseName(name))
  4155. return false;
  4156. if (LA() == T_RPAREN || LA() == T_COMMA)
  4157. return true;
  4158. QualifiedNameAST *qualified_name_id = name->asQualifiedName();
  4159. TemplateIdAST *template_id = 0;
  4160. if (qualified_name_id) {
  4161. if (NameAST *unqualified_name = qualified_name_id->unqualified_name)
  4162. template_id = unqualified_name->asTemplateId();
  4163. } else {
  4164. template_id = name->asTemplateId();
  4165. }
  4166. if (! template_id)
  4167. return true; // it's not a template-id, there's nothing to rewind.
  4168. else if (LA() == T_LPAREN) {
  4169. // a template-id followed by a T_LPAREN
  4170. if (ExpressionListAST *template_arguments = template_id->template_argument_list) {
  4171. if (! template_arguments->next && template_arguments->value &&
  4172. template_arguments->value->asBinaryExpression()) {
  4173. unsigned saved = cursor();
  4174. ExpressionAST *expr = 0;
  4175. bool blocked = blockErrors(true);
  4176. bool lookAtCastExpression = parseCastExpression(expr);
  4177. (void) blockErrors(blocked);
  4178. if (lookAtCastExpression) {
  4179. if (CastExpressionAST *cast_expression = expr->asCastExpression()) {
  4180. if (cast_expression->lparen_token && cast_expression->rparen_token
  4181. && cast_expression->type_id && cast_expression->expression) {
  4182. rewind(start);
  4183. name = 0;
  4184. return parseName(name, false);
  4185. }
  4186. }
  4187. }
  4188. rewind(saved);
  4189. }
  4190. }
  4191. }
  4192. switch (LA()) {
  4193. case T_COMMA:
  4194. case T_SEMICOLON:
  4195. case T_LBRACKET:
  4196. case T_LPAREN:
  4197. case T_LBRACE:
  4198. return true;
  4199. case T_THIS:
  4200. case T_IDENTIFIER:
  4201. case T_STATIC_CAST:
  4202. case T_DYNAMIC_CAST:
  4203. case T_REINTERPRET_CAST:
  4204. case T_CONST_CAST:
  4205. rewind(start);
  4206. return parseName(name, false);
  4207. default:
  4208. if (tok().isLiteral() || tok().isOperator()) {
  4209. rewind(start);
  4210. return parseName(name, false);
  4211. }
  4212. } // switch
  4213. return true;
  4214. }
  4215. bool Parser::parseNestedExpression(ExpressionAST *&node)
  4216. {
  4217. DEBUG_THIS_RULE();
  4218. if (LA() == T_LPAREN) {
  4219. unsigned lparen_token = consumeToken();
  4220. bool previousTemplateArguments = switchTemplateArguments(false);
  4221. ExpressionAST *expression = 0;
  4222. if (parseExpression(expression) && LA() == T_RPAREN) {
  4223. NestedExpressionAST *ast = new (_pool) NestedExpressionAST;
  4224. ast->lparen_token = lparen_token;
  4225. ast->expression = expression;
  4226. ast->rparen_token = consumeToken();
  4227. node = ast;
  4228. (void) switchTemplateArguments(previousTemplateArguments);
  4229. return true;
  4230. }
  4231. (void) switchTemplateArguments(previousTemplateArguments);
  4232. }
  4233. return false;
  4234. }
  4235. bool Parser::parseCppCastExpression(ExpressionAST *&node)
  4236. {
  4237. DEBUG_THIS_RULE();
  4238. if (LA() == T_DYNAMIC_CAST || LA() == T_STATIC_CAST ||
  4239. LA() == T_REINTERPRET_CAST || LA() == T_CONST_CAST) {
  4240. CppCastExpressionAST *ast = new (_pool) CppCastExpressionAST;
  4241. ast->cast_token = consumeToken();
  4242. match(T_LESS, &ast->less_token);
  4243. parseTypeId(ast->type_id);
  4244. match(T_GREATER, &ast->greater_token);
  4245. match(T_LPAREN, &ast->lparen_token);
  4246. parseExpression(ast->expression);
  4247. match(T_RPAREN, &ast->rparen_token);
  4248. node = ast;
  4249. return true;
  4250. }
  4251. return false;
  4252. }
  4253. // typename ::opt nested-name-specifier identifier ( expression-listopt )
  4254. // typename ::opt nested-name-specifier templateopt template-id ( expression-listopt )
  4255. bool Parser::parseTypenameCallExpression(ExpressionAST *&node)
  4256. {
  4257. DEBUG_THIS_RULE();
  4258. if (LA() == T_TYPENAME) {
  4259. unsigned typename_token = consumeToken();
  4260. NameAST *name = 0;
  4261. if (parseName(name)
  4262. && (LA() == T_LPAREN || (_languageFeatures.cxx11Enabled && LA() == T_LBRACE))) {
  4263. TypenameCallExpressionAST *ast = new (_pool) TypenameCallExpressionAST;
  4264. ast->typename_token = typename_token;
  4265. ast->name = name;
  4266. if (LA() == T_LPAREN) {
  4267. parseExpressionListParen(ast->expression);
  4268. } else { // T_LBRACE
  4269. parseBracedInitList0x(ast->expression);
  4270. }
  4271. node = ast;
  4272. return true;
  4273. }
  4274. }
  4275. return false;
  4276. }
  4277. // typeid ( expression )
  4278. // typeid ( type-id )
  4279. bool Parser::parseTypeidExpression(ExpressionAST *&node)
  4280. {
  4281. DEBUG_THIS_RULE();
  4282. if (LA() == T_TYPEID) {
  4283. TypeidExpressionAST *ast = new (_pool) TypeidExpressionAST;
  4284. ast->typeid_token = consumeToken();
  4285. if (LA() == T_LPAREN)
  4286. ast->lparen_token = consumeToken();
  4287. unsigned saved = cursor();
  4288. if (! (parseTypeId(ast->expression) && LA() == T_RPAREN)) {
  4289. rewind(saved);
  4290. parseExpression(ast->expression);
  4291. }
  4292. match(T_RPAREN, &ast->rparen_token);
  4293. node = ast;
  4294. return true;
  4295. }
  4296. return false;
  4297. }
  4298. bool Parser::parseCorePostfixExpression(ExpressionAST *&node)
  4299. {
  4300. DEBUG_THIS_RULE();
  4301. switch (LA()) {
  4302. case T_DYNAMIC_CAST:
  4303. case T_STATIC_CAST:
  4304. case T_REINTERPRET_CAST:
  4305. case T_CONST_CAST:
  4306. return parseCppCastExpression(node);
  4307. case T_TYPENAME:
  4308. return parseTypenameCallExpression(node);
  4309. case T_TYPEID:
  4310. return parseTypeidExpression(node);
  4311. default: {
  4312. unsigned start = cursor();
  4313. SpecifierListAST *type_specifier = 0;
  4314. bool blocked = blockErrors(true);
  4315. if (lookAtBuiltinTypeSpecifier() &&
  4316. parseSimpleTypeSpecifier(type_specifier) &&
  4317. (LA() == T_LPAREN || (_languageFeatures.cxx11Enabled && LA() == T_LBRACE))) {
  4318. ExpressionAST *expr = 0;
  4319. if (LA() == T_LPAREN) {
  4320. parseExpressionListParen(expr);
  4321. } else { // T_LBRACE
  4322. parseBracedInitList0x(expr);
  4323. }
  4324. TypeConstructorCallAST *ast = new (_pool) TypeConstructorCallAST;
  4325. ast->type_specifier_list = type_specifier;
  4326. ast->expression = expr;
  4327. node = ast;
  4328. blockErrors(blocked);
  4329. return true;
  4330. }
  4331. rewind(start);
  4332. // look for compound literals
  4333. if (LA() == T_LPAREN) {
  4334. unsigned lparen_token = consumeToken();
  4335. ExpressionAST *type_id = 0;
  4336. if (parseTypeId(type_id) && LA() == T_RPAREN) {
  4337. unsigned rparen_token = consumeToken();
  4338. if (LA() == T_LBRACE) {
  4339. blockErrors(blocked);
  4340. CompoundLiteralAST *ast = new (_pool) CompoundLiteralAST;
  4341. ast->lparen_token = lparen_token;
  4342. ast->type_id = type_id;
  4343. ast->rparen_token = rparen_token;
  4344. parseInitializerClause(ast->initializer);
  4345. node = ast;
  4346. return true;
  4347. }
  4348. }
  4349. rewind(start);
  4350. }
  4351. blockErrors(blocked);
  4352. return parsePrimaryExpression(node);
  4353. } // default
  4354. } // switch
  4355. }
  4356. bool Parser::parsePostfixExpression(ExpressionAST *&node)
  4357. {
  4358. DEBUG_THIS_RULE();
  4359. if (parseCorePostfixExpression(node)) {
  4360. while (LA()) {
  4361. if (LA() == T_LPAREN) {
  4362. CallAST *ast = new (_pool) CallAST;
  4363. ast->lparen_token = consumeToken();
  4364. parseExpressionList(ast->expression_list);
  4365. match(T_RPAREN, &ast->rparen_token);
  4366. ast->base_expression = node;
  4367. node = ast;
  4368. } else if (LA() == T_LBRACKET) {
  4369. ArrayAccessAST *ast = new (_pool) ArrayAccessAST;
  4370. ast->lbracket_token = consumeToken();
  4371. parseExpression(ast->expression);
  4372. match(T_RBRACKET, &ast->rbracket_token);
  4373. ast->base_expression = node;
  4374. node = ast;
  4375. } else if (_languageFeatures.cxx11Enabled && LA() == T_LBRACE && node->asIdExpression()) {
  4376. // this is slightly inconsistent: simple-type-specifier '(' expression-list ')'
  4377. // gets parsed as a CallAST while simple-type-specifier brace-init-list
  4378. // is a TypenameCallExpressionAST
  4379. TypenameCallExpressionAST *ast = new (_pool) TypenameCallExpressionAST;
  4380. ast->name = node->asIdExpression()->name;
  4381. parseBracedInitList0x(ast->expression);
  4382. node = ast;
  4383. } else if (LA() == T_PLUS_PLUS || LA() == T_MINUS_MINUS) {
  4384. PostIncrDecrAST *ast = new (_pool) PostIncrDecrAST;
  4385. ast->incr_decr_token = consumeToken();
  4386. ast->base_expression = node;
  4387. node = ast;
  4388. } else if (LA() == T_DOT || LA() == T_ARROW) {
  4389. MemberAccessAST *ast = new (_pool) MemberAccessAST;
  4390. ast->access_token = consumeToken();
  4391. if (LA() == T_TEMPLATE)
  4392. ast->template_token = consumeToken();
  4393. if (! parseNameId(ast->member_name))
  4394. error(cursor(), "expected unqualified-id before token `%s'", tok().spell());
  4395. ast->base_expression = node;
  4396. node = ast;
  4397. } else break;
  4398. } // while
  4399. return true;
  4400. }
  4401. return false;
  4402. }
  4403. bool Parser::parseUnaryExpression(ExpressionAST *&node)
  4404. {
  4405. DEBUG_THIS_RULE();
  4406. switch (LA()) {
  4407. case T_PLUS_PLUS:
  4408. case T_MINUS_MINUS:
  4409. case T_STAR:
  4410. case T_AMPER:
  4411. case T_PLUS:
  4412. case T_MINUS:
  4413. case T_EXCLAIM: {
  4414. unsigned op = cursor();
  4415. UnaryExpressionAST *ast = new (_pool) UnaryExpressionAST;
  4416. ast->unary_op_token = consumeToken();
  4417. if (! parseCastExpression(ast->expression))
  4418. error(op, "expected expression after token `%s'", _translationUnit->spell(op));
  4419. node = ast;
  4420. return true;
  4421. }
  4422. case T_TILDE: {
  4423. if (LA(2) == T_IDENTIFIER && LA(3) == T_LPAREN)
  4424. break; // prefer destructor names
  4425. UnaryExpressionAST *ast = new (_pool) UnaryExpressionAST;
  4426. ast->unary_op_token = consumeToken();
  4427. (void) parseCastExpression(ast->expression);
  4428. node = ast;
  4429. return true;
  4430. }
  4431. case T_SIZEOF: {
  4432. SizeofExpressionAST *ast = new (_pool) SizeofExpressionAST;
  4433. ast->sizeof_token = consumeToken();
  4434. // sizeof...(Args)
  4435. if (_languageFeatures.cxx11Enabled && LA() == T_DOT_DOT_DOT && (LA(2) == T_IDENTIFIER || (LA(2) == T_LPAREN && LA(3) == T_IDENTIFIER
  4436. && LA(4) == T_RPAREN)))
  4437. ast->dot_dot_dot_token = consumeToken();
  4438. if (LA() == T_LPAREN) {
  4439. unsigned lparen_token = consumeToken();
  4440. const bool blocked = blockErrors(true);
  4441. const bool hasTypeId = parseTypeId(ast->expression);
  4442. (void) blockErrors(blocked);
  4443. if (hasTypeId && LA() == T_RPAREN) {
  4444. ast->lparen_token = lparen_token;
  4445. ast->rparen_token = consumeToken();
  4446. node = ast;
  4447. return true;
  4448. } else {
  4449. rewind(lparen_token);
  4450. }
  4451. }
  4452. parseUnaryExpression(ast->expression);
  4453. node = ast;
  4454. return true;
  4455. }
  4456. case T_ALIGNOF: {
  4457. if (!_languageFeatures.cxx11Enabled)
  4458. break;
  4459. AlignofExpressionAST *ast = new (_pool) AlignofExpressionAST;
  4460. ast->alignof_token = consumeToken();
  4461. match(T_LPAREN, &ast->lparen_token);
  4462. ExpressionAST *temp = 0;
  4463. parseTypeId(temp);
  4464. if (temp)
  4465. ast->typeId = temp->asTypeId();
  4466. match(T_RPAREN, &ast->rparen_token);
  4467. node = ast;
  4468. return true;
  4469. }
  4470. default:
  4471. break;
  4472. } // switch
  4473. if (LA() == T_NEW || (LA(1) == T_COLON_COLON &&
  4474. LA(2) == T_NEW))
  4475. return parseNewExpression(node);
  4476. else if (LA() == T_DELETE || (LA(1) == T_COLON_COLON &&
  4477. LA(2) == T_DELETE))
  4478. return parseDeleteExpression(node);
  4479. else
  4480. return parsePostfixExpression(node);
  4481. }
  4482. // new-placement ::= T_LPAREN expression-list T_RPAREN
  4483. bool Parser::parseExpressionListParen(ExpressionAST *&node)
  4484. {
  4485. DEBUG_THIS_RULE();
  4486. if (LA() == T_LPAREN) {
  4487. unsigned lparen_token = consumeToken();
  4488. ExpressionListAST *expression_list = 0;
  4489. if (parseExpressionList(expression_list) && LA() == T_RPAREN) {
  4490. unsigned rparen_token = consumeToken();
  4491. ExpressionListParenAST *ast = new (_pool) ExpressionListParenAST;
  4492. ast->lparen_token = lparen_token;
  4493. ast->expression_list = expression_list;
  4494. ast->rparen_token = rparen_token;
  4495. node = ast;
  4496. return true;
  4497. }
  4498. }
  4499. return false;
  4500. }
  4501. // new-expression ::= T_COLON_COLON? T_NEW new-placement.opt
  4502. // new-type-id new-initializer.opt
  4503. // new-expression ::= T_COLON_COLON? T_NEW new-placement.opt
  4504. // T_LPAREN type-id T_RPAREN new-initializer.opt
  4505. bool Parser::parseNewExpression(ExpressionAST *&node)
  4506. {
  4507. DEBUG_THIS_RULE();
  4508. if (! (LA() == T_NEW || (LA() == T_COLON_COLON && LA(2) == T_NEW)))
  4509. return false;
  4510. NewExpressionAST *ast = new (_pool) NewExpressionAST;
  4511. if (LA() == T_COLON_COLON)
  4512. ast->scope_token = consumeToken();
  4513. ast->new_token = consumeToken();
  4514. ExpressionAST *parenExpressionList = 0;
  4515. if (parseExpressionListParen(parenExpressionList)) {
  4516. unsigned after_new_placement = cursor();
  4517. NewTypeIdAST *new_type_id = 0;
  4518. if (parseNewTypeId(new_type_id)) {
  4519. ast->new_placement = parenExpressionList->asExpressionListParen();
  4520. ast->new_type_id = new_type_id;
  4521. parseNewInitializer(ast->new_initializer);
  4522. // recognized new-placement.opt new-type-id new-initializer.opt
  4523. node = ast;
  4524. return true;
  4525. }
  4526. rewind(after_new_placement);
  4527. if (LA() == T_LPAREN) {
  4528. unsigned lparen_token = consumeToken();
  4529. ExpressionAST *type_id = 0;
  4530. if (parseTypeId(type_id) && LA() == T_RPAREN) {
  4531. ast->new_placement = parenExpressionList->asExpressionListParen();
  4532. ast->lparen_token = lparen_token;
  4533. ast->type_id = type_id;
  4534. ast->rparen_token = consumeToken();
  4535. parseNewInitializer(ast->new_initializer);
  4536. node = ast;
  4537. return true;
  4538. }
  4539. }
  4540. }
  4541. rewind(ast->new_token + 1);
  4542. if (LA() == T_LPAREN) {
  4543. unsigned lparen_token = consumeToken();
  4544. ExpressionAST *type_id = 0;
  4545. if (parseTypeId(type_id) && LA() == T_RPAREN) {
  4546. ast->lparen_token = lparen_token;
  4547. ast->type_id = type_id;
  4548. ast->rparen_token = consumeToken();
  4549. parseNewInitializer(ast->new_initializer);
  4550. node = ast;
  4551. return true;
  4552. }
  4553. }
  4554. parseNewTypeId(ast->new_type_id);
  4555. parseNewInitializer(ast->new_initializer);
  4556. node = ast;
  4557. return true;
  4558. }
  4559. bool Parser::parseNewTypeId(NewTypeIdAST *&node)
  4560. {
  4561. DEBUG_THIS_RULE();
  4562. SpecifierListAST *typeSpec = 0;
  4563. if (! parseTypeSpecifier(typeSpec))
  4564. return false;
  4565. NewTypeIdAST *ast = new (_pool) NewTypeIdAST;
  4566. ast->type_specifier_list = typeSpec;
  4567. PtrOperatorListAST **ptrop_it = &ast->ptr_operator_list;
  4568. while (parsePtrOperator(*ptrop_it))
  4569. ptrop_it = &(*ptrop_it)->next;
  4570. NewArrayDeclaratorListAST **it = &ast->new_array_declarator_list;
  4571. while (parseNewArrayDeclarator(*it))
  4572. it = &(*it)->next;
  4573. node = ast;
  4574. return true;
  4575. }
  4576. bool Parser::parseNewArrayDeclarator(NewArrayDeclaratorListAST *&node)
  4577. {
  4578. DEBUG_THIS_RULE();
  4579. if (LA() != T_LBRACKET)
  4580. return false;
  4581. NewArrayDeclaratorAST *ast = new (_pool) NewArrayDeclaratorAST;
  4582. ast->lbracket_token = consumeToken();
  4583. parseExpression(ast->expression);
  4584. match(T_RBRACKET, &ast->rbracket_token);
  4585. node = new (_pool) NewArrayDeclaratorListAST;
  4586. node->value = ast;
  4587. return true;
  4588. }
  4589. bool Parser::parseNewInitializer(ExpressionAST *&node)
  4590. {
  4591. DEBUG_THIS_RULE();
  4592. if (LA() == T_LPAREN)
  4593. return parseExpressionListParen(node);
  4594. else if (_languageFeatures.cxx11Enabled && LA() == T_LBRACE)
  4595. return parseBracedInitList0x(node);
  4596. return false;
  4597. }
  4598. bool Parser::parseDeleteExpression(ExpressionAST *&node)
  4599. {
  4600. DEBUG_THIS_RULE();
  4601. if (LA() == T_DELETE || (LA() == T_COLON_COLON && LA(2) == T_DELETE)) {
  4602. DeleteExpressionAST *ast = new (_pool) DeleteExpressionAST;
  4603. if (LA() == T_COLON_COLON)
  4604. ast->scope_token = consumeToken();
  4605. ast->delete_token = consumeToken();
  4606. if (LA() == T_LBRACKET) {
  4607. ast->lbracket_token = consumeToken();
  4608. match(T_RBRACKET, &ast->rbracket_token);
  4609. }
  4610. (void) parseCastExpression(ast->expression);
  4611. node = ast;
  4612. return true;
  4613. }
  4614. return false;
  4615. }
  4616. bool Parser::parseCastExpression(ExpressionAST *&node)
  4617. {
  4618. DEBUG_THIS_RULE();
  4619. if (LA() == T_LPAREN) {
  4620. unsigned lparen_token = consumeToken();
  4621. unsigned initialCursor = cursor();
  4622. ExpressionAST *type_id = 0;
  4623. if (parseTypeId(type_id) && LA() == T_RPAREN) {
  4624. if (TypeIdAST *tid = type_id->asTypeId()) {
  4625. if (tid->type_specifier_list && ! tid->type_specifier_list->next) {
  4626. if (tid->type_specifier_list->value->asNamedTypeSpecifier()) {
  4627. switch (LA(2)) {
  4628. case T_LBRACKET: // ... it's definitely a unary expression followed by an array access.
  4629. goto parse_as_unary_expression;
  4630. case T_PLUS_PLUS:
  4631. case T_MINUS_MINUS: {
  4632. const unsigned rparen_token = consumeToken();
  4633. const bool blocked = blockErrors(true);
  4634. ExpressionAST *unary = 0;
  4635. bool followedByUnaryExpression = parseUnaryExpression(unary);
  4636. blockErrors(blocked);
  4637. rewind(rparen_token);
  4638. if (followedByUnaryExpression) {
  4639. if (! unary)
  4640. followedByUnaryExpression = false;
  4641. else if (UnaryExpressionAST *u = unary->asUnaryExpression())
  4642. followedByUnaryExpression = u->expression != 0;
  4643. }
  4644. if (! followedByUnaryExpression)
  4645. goto parse_as_unary_expression;
  4646. } break;
  4647. case T_LPAREN: // .. it can be parsed as a function call.
  4648. // ### TODO: check if it is followed by a parenthesized expression list.
  4649. break;
  4650. }
  4651. }
  4652. }
  4653. }
  4654. unsigned rparen_token = consumeToken();
  4655. ExpressionAST *expression = 0;
  4656. if (parseCastExpression(expression)) {
  4657. CastExpressionAST *ast = new (_pool) CastExpressionAST;
  4658. ast->lparen_token = lparen_token;
  4659. ast->type_id = type_id;
  4660. ast->rparen_token = rparen_token;
  4661. ast->expression = expression;
  4662. node = ast;
  4663. return true;
  4664. }
  4665. }
  4666. parse_as_unary_expression:
  4667. _astCache->insert(ASTCache::TypeId, initialCursor, 0, cursor(), false);
  4668. rewind(lparen_token);
  4669. }
  4670. return parseUnaryExpression(node);
  4671. }
  4672. bool Parser::parsePmExpression(ExpressionAST *&node)
  4673. {
  4674. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::PointerToMember)
  4675. }
  4676. bool Parser::parseMultiplicativeExpression(ExpressionAST *&node)
  4677. {
  4678. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Multiplicative)
  4679. }
  4680. bool Parser::parseAdditiveExpression(ExpressionAST *&node)
  4681. {
  4682. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Additive)
  4683. }
  4684. bool Parser::parseShiftExpression(ExpressionAST *&node)
  4685. {
  4686. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Shift)
  4687. }
  4688. bool Parser::parseRelationalExpression(ExpressionAST *&node)
  4689. {
  4690. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Relational)
  4691. }
  4692. bool Parser::parseEqualityExpression(ExpressionAST *&node)
  4693. {
  4694. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Equality)
  4695. }
  4696. bool Parser::parseAndExpression(ExpressionAST *&node)
  4697. {
  4698. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::And)
  4699. }
  4700. bool Parser::parseExclusiveOrExpression(ExpressionAST *&node)
  4701. {
  4702. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::ExclusiveOr)
  4703. }
  4704. bool Parser::parseInclusiveOrExpression(ExpressionAST *&node)
  4705. {
  4706. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::InclusiveOr)
  4707. }
  4708. bool Parser::parseLogicalAndExpression(ExpressionAST *&node)
  4709. {
  4710. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::LogicalAnd)
  4711. }
  4712. bool Parser::parseLogicalOrExpression(ExpressionAST *&node)
  4713. {
  4714. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::LogicalOr)
  4715. }
  4716. bool Parser::parseConditionalExpression(ExpressionAST *&node)
  4717. {
  4718. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Conditional)
  4719. }
  4720. bool Parser::parseAssignmentExpression(ExpressionAST *&node)
  4721. {
  4722. DEBUG_THIS_RULE();
  4723. if (LA() == T_THROW)
  4724. return parseThrowExpression(node);
  4725. else
  4726. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Assignment)
  4727. }
  4728. bool Parser::parseQtMethod(ExpressionAST *&node)
  4729. {
  4730. DEBUG_THIS_RULE();
  4731. if (LA() == T_SIGNAL || LA() == T_SLOT) {
  4732. QtMethodAST *ast = new (_pool) QtMethodAST;
  4733. ast->method_token = consumeToken();
  4734. match(T_LPAREN, &ast->lparen_token);
  4735. if (! parseDeclarator(ast->declarator, /*decl_specifier_seq =*/ 0))
  4736. error(cursor(), "expected a function declarator before token `%s'", tok().spell());
  4737. match(T_RPAREN, &ast->rparen_token);
  4738. node = ast;
  4739. return true;
  4740. }
  4741. return false;
  4742. }
  4743. bool Parser::parseConstantExpression(ExpressionAST *&node)
  4744. {
  4745. DEBUG_THIS_RULE();
  4746. return parseConditionalExpression(node);
  4747. }
  4748. bool Parser::parseExpression(ExpressionAST *&node)
  4749. {
  4750. DEBUG_THIS_RULE();
  4751. CHECK_CACHE(ASTCache::Expression, ExpressionAST);
  4752. unsigned initialCursor = cursor();
  4753. if (_expressionDepth > MAX_EXPRESSION_DEPTH)
  4754. return false;
  4755. ++_expressionDepth;
  4756. bool success = parseCommaExpression(node);
  4757. --_expressionDepth;
  4758. _astCache->insert(ASTCache::Expression, initialCursor, node, cursor(), success);
  4759. return success;
  4760. }
  4761. void Parser::parseExpressionWithOperatorPrecedence(ExpressionAST *&lhs, int minPrecedence)
  4762. {
  4763. DEBUG_THIS_RULE();
  4764. while (precedence(tok().kind(), _templateArguments) >= minPrecedence) {
  4765. const int operPrecedence = precedence(tok().kind(), _templateArguments);
  4766. const int oper = consumeToken();
  4767. ConditionalExpressionAST *condExpr = 0;
  4768. if (operPrecedence == Prec::Conditional) {
  4769. condExpr = new (_pool) ConditionalExpressionAST;
  4770. condExpr->question_token = oper;
  4771. if (tok().kind() == T_COLON) {
  4772. // GNU extension:
  4773. // logical-or-expression '?' ':' conditional-expression
  4774. condExpr->left_expression = 0;
  4775. } else {
  4776. parseExpression(condExpr->left_expression);
  4777. }
  4778. match(T_COLON, &condExpr->colon_token);
  4779. }
  4780. ExpressionAST *rhs = 0;
  4781. const bool isCPlusPlus = true;
  4782. if (operPrecedence <= Prec::Conditional && isCPlusPlus) {
  4783. // in C++ you can put a throw in the right-most expression of a conditional expression,
  4784. // or an assignment, so some special handling:
  4785. if (_languageFeatures.cxx11Enabled) {
  4786. if (!parseInitializerClause0x(rhs))
  4787. return;
  4788. } else {
  4789. if (!parseAssignmentExpression(rhs))
  4790. return;
  4791. }
  4792. } else {
  4793. // for C & all other expressions:
  4794. if (!parseCastExpression(rhs))
  4795. return;
  4796. }
  4797. for (int tokenKindAhead = tok().kind(), precedenceAhead = precedence(tokenKindAhead, _templateArguments);
  4798. (precedenceAhead > operPrecedence && isBinaryOperator(tokenKindAhead))
  4799. || (precedenceAhead == operPrecedence && isRightAssociative(tokenKindAhead));
  4800. tokenKindAhead = tok().kind(), precedenceAhead = precedence(tokenKindAhead, _templateArguments)) {
  4801. parseExpressionWithOperatorPrecedence(rhs, precedenceAhead);
  4802. }
  4803. if (condExpr) { // we were parsing a ternairy conditional expression
  4804. condExpr->condition = lhs;
  4805. condExpr->right_expression = rhs;
  4806. lhs = condExpr;
  4807. } else {
  4808. BinaryExpressionAST *expr = new (_pool) BinaryExpressionAST;
  4809. expr->left_expression = lhs;
  4810. expr->binary_op_token = oper;
  4811. expr->right_expression = rhs;
  4812. lhs = expr;
  4813. }
  4814. }
  4815. }
  4816. bool Parser::parseCommaExpression(ExpressionAST *&node)
  4817. {
  4818. PARSE_EXPRESSION_WITH_OPERATOR_PRECEDENCE(node, Prec::Comma)
  4819. }
  4820. bool Parser::parseThrowExpression(ExpressionAST *&node)
  4821. {
  4822. DEBUG_THIS_RULE();
  4823. if (LA() == T_THROW) {
  4824. ThrowExpressionAST *ast = new (_pool) ThrowExpressionAST;
  4825. ast->throw_token = consumeToken();
  4826. parseAssignmentExpression(ast->expression);
  4827. node = ast;
  4828. return true;
  4829. }
  4830. return false;
  4831. }
  4832. bool Parser::lookAtObjCSelector() const
  4833. {
  4834. switch (LA()) {
  4835. case T_IDENTIFIER:
  4836. case T_OR:
  4837. case T_AND:
  4838. case T_NOT:
  4839. case T_XOR:
  4840. case T_BITOR:
  4841. case T_COMPL:
  4842. case T_OR_EQ:
  4843. case T_AND_EQ:
  4844. case T_BITAND:
  4845. case T_NOT_EQ:
  4846. case T_XOR_EQ:
  4847. return true;
  4848. default:
  4849. if (tok().isKeyword())
  4850. return true;
  4851. } // switch
  4852. return false;
  4853. }
  4854. // designated-initializer ::= designator* T_EQUAL initializer-clause
  4855. //
  4856. bool Parser::parseDesignatedInitializer(ExpressionAST *&node)
  4857. {
  4858. DEBUG_THIS_RULE();
  4859. if (!_languageFeatures.c99Enabled || (LA() != T_DOT && LA() != T_LBRACKET))
  4860. return false;
  4861. DesignatedInitializerAST *ast = new (_pool) DesignatedInitializerAST;
  4862. DesignatorListAST **designator_list_ptr = &ast->designator_list;
  4863. DesignatorAST *designator = 0;
  4864. const unsigned start = cursor();
  4865. while (parseDesignator(designator)) {
  4866. *designator_list_ptr = new (_pool) DesignatorListAST;
  4867. (*designator_list_ptr)->value = designator;
  4868. designator_list_ptr = &(*designator_list_ptr)->next;
  4869. }
  4870. if (start == cursor())
  4871. return false;
  4872. if (LA() == T_EQUAL) {
  4873. ast->equal_token = consumeToken();
  4874. if (parseAssignmentExpression(ast->initializer)) {
  4875. node = ast;
  4876. return true;
  4877. }
  4878. }
  4879. rewind(start);
  4880. return false;
  4881. }
  4882. // designator ::= T_DOT T_IDENTIFIER
  4883. // T_LBRACKET constant-expression T_BRACKET
  4884. //
  4885. bool Parser::parseDesignator(DesignatorAST *&node)
  4886. {
  4887. DEBUG_THIS_RULE();
  4888. const unsigned start = cursor();
  4889. if (LA() == T_DOT) {
  4890. DotDesignatorAST *ast = new (_pool) DotDesignatorAST;
  4891. ast->dot_token = consumeToken();
  4892. match(T_IDENTIFIER, &ast->identifier_token);
  4893. node = ast;
  4894. return true;
  4895. } else if (LA() == T_LBRACKET) {
  4896. BracketDesignatorAST *ast = new (_pool) BracketDesignatorAST;
  4897. ast->lbracket_token = consumeToken();
  4898. if (parseConditionalExpression(ast->expression)) {
  4899. match(T_RBRACKET, &ast->rbracket_token);
  4900. node = ast;
  4901. return true;
  4902. }
  4903. }
  4904. rewind(start);
  4905. return false;
  4906. }
  4907. // objc-class-declaraton ::= T_AT_CLASS (T_IDENTIFIER @ T_COMMA) T_SEMICOLON
  4908. //
  4909. bool Parser::parseObjCClassForwardDeclaration(DeclarationAST *&node)
  4910. {
  4911. DEBUG_THIS_RULE();
  4912. if (LA() != T_AT_CLASS)
  4913. return false;
  4914. ObjCClassForwardDeclarationAST *ast = new (_pool) ObjCClassForwardDeclarationAST;
  4915. ast->class_token = consumeToken();
  4916. unsigned identifier_token = 0;
  4917. match(T_IDENTIFIER, &identifier_token);
  4918. ast->identifier_list = new (_pool) NameListAST;
  4919. SimpleNameAST *name = new (_pool) SimpleNameAST;
  4920. name->identifier_token = identifier_token;
  4921. ast->identifier_list->value = name;
  4922. NameListAST **nextId = &ast->identifier_list->next;
  4923. while (LA() == T_COMMA) {
  4924. consumeToken(); // consume T_COMMA
  4925. match(T_IDENTIFIER, &identifier_token);
  4926. *nextId = new (_pool) NameListAST;
  4927. name = new (_pool) SimpleNameAST;
  4928. name->identifier_token = identifier_token;
  4929. (*nextId)->value = name;
  4930. nextId = &(*nextId)->next;
  4931. }
  4932. match(T_SEMICOLON, &ast->semicolon_token);
  4933. node = ast;
  4934. return true;
  4935. }
  4936. // objc-interface ::= attribute-specifier-list-opt objc-class-interface
  4937. // objc-interface ::= objc-category-interface
  4938. //
  4939. // objc-class-interface ::= T_AT_INTERFACE T_IDENTIFIER (T_COLON T_IDENTIFIER)?
  4940. // objc-protocol-refs-opt
  4941. // objc-class-instance-variables-opt
  4942. // objc-interface-declaration-list
  4943. // T_AT_END
  4944. //
  4945. // objc-category-interface ::= T_AT_INTERFACE T_IDENTIFIER
  4946. // T_LPAREN T_IDENTIFIER? T_RPAREN
  4947. // objc-protocol-refs-opt
  4948. // objc-interface-declaration-list
  4949. // T_AT_END
  4950. //
  4951. bool Parser::parseObjCInterface(DeclarationAST *&node,
  4952. SpecifierListAST *attributes)
  4953. {
  4954. DEBUG_THIS_RULE();
  4955. if (! attributes && LA() == T___ATTRIBUTE__) {
  4956. SpecifierListAST **attr = &attributes;
  4957. while (parseGnuAttributeSpecifier(*attr))
  4958. attr = &(*attr)->next;
  4959. }
  4960. if (LA() != T_AT_INTERFACE)
  4961. return false;
  4962. unsigned objc_interface_token = consumeToken();
  4963. unsigned identifier_token = 0;
  4964. match(T_IDENTIFIER, &identifier_token);
  4965. if (LA() == T_LPAREN) {
  4966. // a category interface
  4967. if (attributes)
  4968. error(attributes->firstToken(), "invalid attributes for category interface declaration");
  4969. ObjCClassDeclarationAST *ast = new (_pool) ObjCClassDeclarationAST;
  4970. ast->attribute_list = attributes;
  4971. ast->interface_token = objc_interface_token;
  4972. SimpleNameAST *class_name = new (_pool) SimpleNameAST;
  4973. class_name->identifier_token= identifier_token;
  4974. ast->class_name = class_name;
  4975. match(T_LPAREN, &ast->lparen_token);
  4976. if (LA() == T_IDENTIFIER) {
  4977. SimpleNameAST *category_name = new (_pool) SimpleNameAST;
  4978. category_name->identifier_token = consumeToken();
  4979. ast->category_name = category_name;
  4980. }
  4981. match(T_RPAREN, &ast->rparen_token);
  4982. parseObjCProtocolRefs(ast->protocol_refs);
  4983. DeclarationListAST **nextMembers = &ast->member_declaration_list;
  4984. DeclarationAST *declaration = 0;
  4985. while (parseObjCInterfaceMemberDeclaration(declaration)) {
  4986. *nextMembers = new (_pool) DeclarationListAST;
  4987. (*nextMembers)->value = declaration;
  4988. nextMembers = &(*nextMembers)->next;
  4989. }
  4990. match(T_AT_END, &ast->end_token);
  4991. node = ast;
  4992. return true;
  4993. } else {
  4994. // a class interface declaration
  4995. ObjCClassDeclarationAST *ast = new (_pool) ObjCClassDeclarationAST;
  4996. ast->attribute_list = attributes;
  4997. ast->interface_token = objc_interface_token;
  4998. SimpleNameAST* class_name = new (_pool) SimpleNameAST;
  4999. class_name->identifier_token = identifier_token;
  5000. ast->class_name = class_name;
  5001. if (LA() == T_COLON) {
  5002. ast->colon_token = consumeToken();
  5003. SimpleNameAST *superclass = new (_pool) SimpleNameAST;
  5004. match(T_IDENTIFIER, &superclass->identifier_token);
  5005. ast->superclass = superclass;
  5006. }
  5007. parseObjCProtocolRefs(ast->protocol_refs);
  5008. parseObjClassInstanceVariables(ast->inst_vars_decl);
  5009. DeclarationListAST **nextMembers = &ast->member_declaration_list;
  5010. DeclarationAST *declaration = 0;
  5011. while (parseObjCInterfaceMemberDeclaration(declaration)) {
  5012. *nextMembers = new (_pool) DeclarationListAST;
  5013. (*nextMembers)->value = declaration;
  5014. nextMembers = &(*nextMembers)->next;
  5015. }
  5016. match(T_AT_END, &ast->end_token);
  5017. node = ast;
  5018. return true;
  5019. }
  5020. }
  5021. // objc-protocol ::= T_AT_PROTOCOL (T_IDENTIFIER @ T_COMMA) T_SEMICOLON
  5022. //
  5023. bool Parser::parseObjCProtocol(DeclarationAST *&node,
  5024. SpecifierListAST *attributes)
  5025. {
  5026. DEBUG_THIS_RULE();
  5027. if (! attributes && LA() == T___ATTRIBUTE__) {
  5028. SpecifierListAST **attr = &attributes;
  5029. while (parseGnuAttributeSpecifier(*attr))
  5030. attr = &(*attr)->next;
  5031. }
  5032. if (LA() != T_AT_PROTOCOL)
  5033. return false;
  5034. unsigned protocol_token = consumeToken();
  5035. unsigned identifier_token = 0;
  5036. match(T_IDENTIFIER, &identifier_token);
  5037. if (LA() == T_COMMA || LA() == T_SEMICOLON) {
  5038. // a protocol forward declaration
  5039. ObjCProtocolForwardDeclarationAST *ast = new (_pool) ObjCProtocolForwardDeclarationAST;
  5040. ast->attribute_list = attributes;
  5041. ast->protocol_token = protocol_token;
  5042. ast->identifier_list = new (_pool) NameListAST;
  5043. SimpleNameAST *name = new (_pool) SimpleNameAST;
  5044. name->identifier_token = identifier_token;
  5045. ast->identifier_list->value = name;
  5046. NameListAST **nextId = &ast->identifier_list->next;
  5047. while (LA() == T_COMMA) {
  5048. consumeToken(); // consume T_COMMA
  5049. match(T_IDENTIFIER, &identifier_token);
  5050. *nextId = new (_pool) NameListAST;
  5051. name = new (_pool) SimpleNameAST;
  5052. name->identifier_token = identifier_token;
  5053. (*nextId)->value = name;
  5054. nextId = &(*nextId)->next;
  5055. }
  5056. match(T_SEMICOLON, &ast->semicolon_token);
  5057. node = ast;
  5058. return true;
  5059. } else {
  5060. // a protocol definition
  5061. ObjCProtocolDeclarationAST *ast = new (_pool) ObjCProtocolDeclarationAST;
  5062. ast->attribute_list = attributes;
  5063. ast->protocol_token = protocol_token;
  5064. SimpleNameAST *name = new (_pool) SimpleNameAST;
  5065. name->identifier_token = identifier_token;
  5066. ast->name = name;
  5067. parseObjCProtocolRefs(ast->protocol_refs);
  5068. DeclarationListAST **nextMembers = &ast->member_declaration_list;
  5069. DeclarationAST *declaration = 0;
  5070. while (parseObjCInterfaceMemberDeclaration(declaration)) {
  5071. *nextMembers = new (_pool) DeclarationListAST;
  5072. (*nextMembers)->value = declaration;
  5073. nextMembers = &(*nextMembers)->next;
  5074. }
  5075. match(T_AT_END, &ast->end_token);
  5076. node = ast;
  5077. return true;
  5078. }
  5079. }
  5080. // objc-implementation ::= T_AT_IMPLEMENTAION T_IDENTIFIER (T_COLON T_IDENTIFIER)?
  5081. // objc-class-instance-variables-opt
  5082. // objc-implementation ::= T_AT_IMPLEMENTAION T_IDENTIFIER T_LPAREN T_IDENTIFIER T_RPAREN
  5083. //
  5084. bool Parser::parseObjCImplementation(DeclarationAST *&node)
  5085. {
  5086. DEBUG_THIS_RULE();
  5087. if (LA() != T_AT_IMPLEMENTATION)
  5088. return false;
  5089. unsigned implementation_token = consumeToken();
  5090. unsigned identifier_token = 0;
  5091. match(T_IDENTIFIER, &identifier_token);
  5092. if (LA() == T_LPAREN) {
  5093. // a category implementation
  5094. ObjCClassDeclarationAST *ast = new (_pool) ObjCClassDeclarationAST;
  5095. ast->implementation_token = implementation_token;
  5096. SimpleNameAST *class_name = new (_pool) SimpleNameAST;
  5097. class_name->identifier_token = identifier_token;
  5098. ast->class_name = class_name;
  5099. match(T_LPAREN, &ast->lparen_token);
  5100. SimpleNameAST *category_name = new (_pool) SimpleNameAST;
  5101. match(T_IDENTIFIER, &category_name->identifier_token);
  5102. ast->category_name = category_name;
  5103. match(T_RPAREN, &ast->rparen_token);
  5104. parseObjCMethodDefinitionList(ast->member_declaration_list);
  5105. match(T_AT_END, &ast->end_token);
  5106. node = ast;
  5107. } else {
  5108. // a class implementation
  5109. ObjCClassDeclarationAST *ast = new (_pool) ObjCClassDeclarationAST;
  5110. ast->implementation_token = implementation_token;
  5111. SimpleNameAST *class_name = new (_pool) SimpleNameAST;
  5112. class_name->identifier_token = identifier_token;
  5113. ast->class_name = class_name;
  5114. if (LA() == T_COLON) {
  5115. ast->colon_token = consumeToken();
  5116. SimpleNameAST *superclass = new (_pool) SimpleNameAST;
  5117. match(T_IDENTIFIER, &superclass->identifier_token);
  5118. ast->superclass = superclass;
  5119. }
  5120. parseObjClassInstanceVariables(ast->inst_vars_decl);
  5121. parseObjCMethodDefinitionList(ast->member_declaration_list);
  5122. match(T_AT_END, &ast->end_token);
  5123. node = ast;
  5124. }
  5125. return true;
  5126. }
  5127. bool Parser::parseObjCMethodDefinitionList(DeclarationListAST *&node)
  5128. {
  5129. DEBUG_THIS_RULE();
  5130. DeclarationListAST **next = &node;
  5131. while (LA() && LA() != T_AT_END) {
  5132. unsigned start = cursor();
  5133. DeclarationAST *declaration = 0;
  5134. switch (LA()) {
  5135. case T_PLUS:
  5136. case T_MINUS:
  5137. parseObjCMethodDefinition(declaration);
  5138. if (start == cursor())
  5139. consumeToken();
  5140. break;
  5141. case T_SEMICOLON:
  5142. consumeToken();
  5143. break;
  5144. case T_AT_SYNTHESIZE: {
  5145. ObjCSynthesizedPropertiesDeclarationAST *ast = new (_pool) ObjCSynthesizedPropertiesDeclarationAST;
  5146. ast->synthesized_token = consumeToken();
  5147. ObjCSynthesizedPropertyListAST *last = new (_pool) ObjCSynthesizedPropertyListAST;
  5148. ast->property_identifier_list = last;
  5149. last->value = new (_pool) ObjCSynthesizedPropertyAST;
  5150. match(T_IDENTIFIER, &last->value->property_identifier_token);
  5151. if (LA() == T_EQUAL) {
  5152. last->value->equals_token = consumeToken();
  5153. match(T_IDENTIFIER, &last->value->alias_identifier_token);
  5154. }
  5155. while (LA() == T_COMMA) {
  5156. consumeToken(); // consume T_COMMA
  5157. last->next = new (_pool) ObjCSynthesizedPropertyListAST;
  5158. last = last->next;
  5159. last->value = new (_pool) ObjCSynthesizedPropertyAST;
  5160. match(T_IDENTIFIER, &last->value->property_identifier_token);
  5161. if (LA() == T_EQUAL) {
  5162. last->value->equals_token = consumeToken();
  5163. match(T_IDENTIFIER, &last->value->alias_identifier_token);
  5164. }
  5165. }
  5166. match(T_SEMICOLON, &ast->semicolon_token);
  5167. declaration = ast;
  5168. break;
  5169. }
  5170. case T_AT_DYNAMIC: {
  5171. ObjCDynamicPropertiesDeclarationAST *ast = new (_pool) ObjCDynamicPropertiesDeclarationAST;
  5172. ast->dynamic_token = consumeToken();
  5173. ast->property_identifier_list = new (_pool) NameListAST;
  5174. SimpleNameAST *name = new (_pool) SimpleNameAST;
  5175. match(T_IDENTIFIER, &name->identifier_token);
  5176. ast->property_identifier_list->value = name;
  5177. NameListAST *last = ast->property_identifier_list;
  5178. while (LA() == T_COMMA) {
  5179. consumeToken(); // consume T_COMMA
  5180. last->next = new (_pool) NameListAST;
  5181. last = last->next;
  5182. name = new (_pool) SimpleNameAST;
  5183. match(T_IDENTIFIER, &name->identifier_token);
  5184. last->value = name;
  5185. }
  5186. match(T_SEMICOLON, &ast->semicolon_token);
  5187. declaration = ast;
  5188. break;
  5189. }
  5190. default:
  5191. if (LA() == T_EXTERN && LA(2) == T_STRING_LITERAL) {
  5192. parseDeclaration(declaration);
  5193. } else {
  5194. if (! parseBlockDeclaration(declaration)) {
  5195. rewind(start);
  5196. error(cursor(), "skip token `%s'", tok().spell());
  5197. consumeToken();
  5198. }
  5199. }
  5200. break;
  5201. } // switch
  5202. if (declaration) {
  5203. *next = new (_pool) DeclarationListAST;
  5204. (*next)->value = declaration;
  5205. next = &(*next)->next;
  5206. }
  5207. }
  5208. return true;
  5209. }
  5210. bool Parser::parseObjCMethodDefinition(DeclarationAST *&node)
  5211. {
  5212. DEBUG_THIS_RULE();
  5213. ObjCMethodPrototypeAST *method_prototype = 0;
  5214. if (! parseObjCMethodPrototype(method_prototype))
  5215. return false;
  5216. ObjCMethodDeclarationAST *ast = new (_pool) ObjCMethodDeclarationAST;
  5217. ast->method_prototype = method_prototype;
  5218. // Objective-C allows you to write:
  5219. // - (void) foo; { body; }
  5220. // so a method is a forward declaration when it doesn't have a _body_.
  5221. // However, we still need to read the semicolon.
  5222. if (LA() == T_SEMICOLON)
  5223. ast->semicolon_token = consumeToken();
  5224. parseFunctionBody(ast->function_body);
  5225. node = ast;
  5226. return true;
  5227. }
  5228. // objc-protocol-refs ::= T_LESS (T_IDENTIFIER @ T_COMMA) T_GREATER
  5229. //
  5230. bool Parser::parseObjCProtocolRefs(ObjCProtocolRefsAST *&node)
  5231. {
  5232. DEBUG_THIS_RULE();
  5233. if (LA() != T_LESS)
  5234. return false;
  5235. ObjCProtocolRefsAST *ast = new (_pool) ObjCProtocolRefsAST;
  5236. match(T_LESS, &ast->less_token);
  5237. unsigned identifier_token = 0;
  5238. match(T_IDENTIFIER, &identifier_token);
  5239. ast->identifier_list = new (_pool) NameListAST;
  5240. SimpleNameAST *name = new (_pool) SimpleNameAST;
  5241. name->identifier_token = identifier_token;
  5242. ast->identifier_list->value = name;
  5243. NameListAST **nextId = &ast->identifier_list->next;
  5244. while (LA() == T_COMMA) {
  5245. consumeToken(); // consume T_COMMA
  5246. match(T_IDENTIFIER, &identifier_token);
  5247. *nextId = new (_pool) NameListAST;
  5248. name = new (_pool) SimpleNameAST;
  5249. name->identifier_token = identifier_token;
  5250. (*nextId)->value = name;
  5251. nextId = &(*nextId)->next;
  5252. }
  5253. match(T_GREATER, &ast->greater_token);
  5254. node = ast;
  5255. return true;
  5256. }
  5257. // objc-class-instance-variables ::= T_LBRACE
  5258. // objc-instance-variable-decl-list-opt
  5259. // T_RBRACE
  5260. //
  5261. bool Parser::parseObjClassInstanceVariables(ObjCInstanceVariablesDeclarationAST *&node)
  5262. {
  5263. DEBUG_THIS_RULE();
  5264. if (LA() != T_LBRACE)
  5265. return false;
  5266. ObjCInstanceVariablesDeclarationAST *ast = new (_pool) ObjCInstanceVariablesDeclarationAST;
  5267. match(T_LBRACE, &ast->lbrace_token);
  5268. for (DeclarationListAST **next = &ast->instance_variable_list; LA(); next = &(*next)->next) {
  5269. if (LA() == T_RBRACE)
  5270. break;
  5271. const unsigned start = cursor();
  5272. *next = new (_pool) DeclarationListAST;
  5273. parseObjCInstanceVariableDeclaration((*next)->value);
  5274. if (start == cursor()) {
  5275. // skip stray token.
  5276. error(cursor(), "skip stray token `%s'", tok().spell());
  5277. consumeToken();
  5278. }
  5279. }
  5280. match(T_RBRACE, &ast->rbrace_token);
  5281. node = ast;
  5282. return true;
  5283. }
  5284. // objc-interface-declaration ::= T_AT_REQUIRED
  5285. // objc-interface-declaration ::= T_AT_OPTIONAL
  5286. // objc-interface-declaration ::= T_SEMICOLON
  5287. // objc-interface-declaration ::= objc-property-declaration
  5288. // objc-interface-declaration ::= objc-method-prototype
  5289. bool Parser::parseObjCInterfaceMemberDeclaration(DeclarationAST *&node)
  5290. {
  5291. DEBUG_THIS_RULE();
  5292. switch (LA()) {
  5293. case T_AT_END:
  5294. return false;
  5295. case T_AT_REQUIRED:
  5296. case T_AT_OPTIONAL:
  5297. consumeToken();
  5298. return true;
  5299. case T_SEMICOLON:
  5300. consumeToken();
  5301. return true;
  5302. case T_AT_PROPERTY: {
  5303. return parseObjCPropertyDeclaration(node);
  5304. }
  5305. case T_PLUS:
  5306. case T_MINUS: {
  5307. ObjCMethodDeclarationAST *ast = new (_pool) ObjCMethodDeclarationAST;
  5308. if (parseObjCMethodPrototype(ast->method_prototype)) {
  5309. match(T_SEMICOLON, &ast->semicolon_token);
  5310. node = ast;
  5311. return true;
  5312. } else {
  5313. return false;
  5314. }
  5315. }
  5316. case T_ENUM:
  5317. case T_CLASS:
  5318. case T_STRUCT:
  5319. case T_UNION: {
  5320. return parseSimpleDeclaration(node);
  5321. }
  5322. default: {
  5323. return parseSimpleDeclaration(node);
  5324. } // default
  5325. } // switch
  5326. }
  5327. // objc-instance-variable-declaration ::= objc-visibility-specifier
  5328. // objc-instance-variable-declaration ::= block-declaration
  5329. //
  5330. bool Parser::parseObjCInstanceVariableDeclaration(DeclarationAST *&node)
  5331. {
  5332. DEBUG_THIS_RULE();
  5333. switch (LA()) {
  5334. case T_AT_PRIVATE:
  5335. case T_AT_PROTECTED:
  5336. case T_AT_PUBLIC:
  5337. case T_AT_PACKAGE: {
  5338. ObjCVisibilityDeclarationAST *ast = new (_pool) ObjCVisibilityDeclarationAST;
  5339. ast->visibility_token = consumeToken();
  5340. node = ast;
  5341. return true;
  5342. }
  5343. default:
  5344. return parseSimpleDeclaration(node);
  5345. }
  5346. }
  5347. // objc-property-declaration ::=
  5348. // T_AT_PROPERTY T_LPAREN (property-attribute @ T_COMMA) T_RPAREN simple-declaration
  5349. //
  5350. bool Parser::parseObjCPropertyDeclaration(DeclarationAST *&node, SpecifierListAST *attributes)
  5351. {
  5352. DEBUG_THIS_RULE();
  5353. if (LA() != T_AT_PROPERTY)
  5354. return false;
  5355. ObjCPropertyDeclarationAST *ast = new (_pool) ObjCPropertyDeclarationAST;
  5356. ast->attribute_list = attributes;
  5357. ast->property_token = consumeToken();
  5358. if (LA() == T_LPAREN) {
  5359. match(T_LPAREN, &ast->lparen_token);
  5360. ObjCPropertyAttributeAST *property_attribute = 0;
  5361. if (parseObjCPropertyAttribute(property_attribute)) {
  5362. ast->property_attribute_list = new (_pool) ObjCPropertyAttributeListAST;
  5363. ast->property_attribute_list->value = property_attribute;
  5364. ObjCPropertyAttributeListAST *last = ast->property_attribute_list;
  5365. while (LA() == T_COMMA) {
  5366. consumeToken(); // consume T_COMMA
  5367. last->next = new (_pool) ObjCPropertyAttributeListAST;
  5368. last = last->next;
  5369. if (!parseObjCPropertyAttribute(last->value)) {
  5370. error(_tokenIndex, "expected token `%s' got `%s'",
  5371. Token::name(T_IDENTIFIER), tok().spell());
  5372. break;
  5373. }
  5374. }
  5375. }
  5376. match(T_RPAREN, &ast->rparen_token);
  5377. }
  5378. if (parseSimpleDeclaration(ast->simple_declaration))
  5379. node = ast;
  5380. else
  5381. error(_tokenIndex, "expected a simple declaration");
  5382. return true;
  5383. }
  5384. // objc-method-prototype ::= (T_PLUS | T_MINUS) objc-method-decl objc-method-attrs-opt
  5385. //
  5386. // objc-method-decl ::= objc-type-name? objc-selector
  5387. // objc-method-decl ::= objc-type-name? objc-keyword-decl-list objc-parmlist-opt
  5388. //
  5389. bool Parser::parseObjCMethodPrototype(ObjCMethodPrototypeAST *&node)
  5390. {
  5391. DEBUG_THIS_RULE();
  5392. if (LA() != T_PLUS && LA() != T_MINUS)
  5393. return false;
  5394. ObjCMethodPrototypeAST *ast = new (_pool) ObjCMethodPrototypeAST;
  5395. ast->method_type_token = consumeToken();
  5396. parseObjCTypeName(ast->type_name);
  5397. if ((lookAtObjCSelector() && LA(2) == T_COLON) || LA() == T_COLON) {
  5398. ObjCSelectorArgumentAST *argument = 0;
  5399. ObjCMessageArgumentDeclarationAST *declaration = 0;
  5400. parseObjCKeywordDeclaration(argument, declaration);
  5401. ObjCSelectorAST *sel = new (_pool) ObjCSelectorAST;
  5402. ast->selector = sel;
  5403. ObjCSelectorArgumentListAST *lastSel = new (_pool) ObjCSelectorArgumentListAST;
  5404. sel->selector_argument_list = lastSel;
  5405. sel->selector_argument_list->value = argument;
  5406. ast->argument_list = new (_pool) ObjCMessageArgumentDeclarationListAST;
  5407. ast->argument_list->value = declaration;
  5408. ObjCMessageArgumentDeclarationListAST *lastArg = ast->argument_list;
  5409. while (parseObjCKeywordDeclaration(argument, declaration)) {
  5410. lastSel->next = new (_pool) ObjCSelectorArgumentListAST;
  5411. lastSel = lastSel->next;
  5412. lastSel->value = argument;
  5413. lastArg->next = new (_pool) ObjCMessageArgumentDeclarationListAST;
  5414. lastArg = lastArg->next;
  5415. lastArg->value = declaration;
  5416. }
  5417. while (LA() == T_COMMA) {
  5418. consumeToken();
  5419. if (LA() == T_DOT_DOT_DOT) {
  5420. ast->dot_dot_dot_token = consumeToken();
  5421. break;
  5422. }
  5423. // TODO: Is this still valid, and if so, should it be stored in the AST? (EV)
  5424. ParameterDeclarationAST *parameter_declaration = 0;
  5425. parseParameterDeclaration(parameter_declaration);
  5426. }
  5427. } else if (lookAtObjCSelector()) {
  5428. ObjCSelectorAST *sel = new (_pool) ObjCSelectorAST;
  5429. sel->selector_argument_list = new (_pool) ObjCSelectorArgumentListAST;
  5430. sel->selector_argument_list->value = new (_pool) ObjCSelectorArgumentAST;
  5431. parseObjCSelector(sel->selector_argument_list->value->name_token);
  5432. ast->selector = sel;
  5433. } else {
  5434. error(cursor(), "expected a selector");
  5435. }
  5436. SpecifierListAST **attr = &ast->attribute_list;
  5437. while (parseGnuAttributeSpecifier(*attr))
  5438. attr = &(*attr)->next;
  5439. node = ast;
  5440. return true;
  5441. }
  5442. // objc-property-attribute ::= getter '=' identifier
  5443. // objc-property-attribute ::= setter '=' identifier ':'
  5444. // objc-property-attribute ::= readonly
  5445. // objc-property-attribute ::= readwrite
  5446. // objc-property-attribute ::= assign
  5447. // objc-property-attribute ::= retain
  5448. // objc-property-attribute ::= copy
  5449. // objc-property-attribute ::= nonatomic
  5450. bool Parser::parseObjCPropertyAttribute(ObjCPropertyAttributeAST *&node)
  5451. {
  5452. DEBUG_THIS_RULE();
  5453. if (LA() != T_IDENTIFIER)
  5454. return false;
  5455. node = new (_pool) ObjCPropertyAttributeAST;
  5456. const Identifier *id = tok().identifier;
  5457. const int k = classifyObjectiveCContextKeyword(id->chars(), id->size());
  5458. switch (k) {
  5459. case Token_copy:
  5460. case Token_assign:
  5461. case Token_retain:
  5462. case Token_readonly:
  5463. case Token_readwrite:
  5464. case Token_nonatomic:
  5465. node->attribute_identifier_token = consumeToken();
  5466. return true;
  5467. case Token_getter: {
  5468. node->attribute_identifier_token = consumeToken();
  5469. match(T_EQUAL, &node->equals_token);
  5470. ObjCSelectorAST *sel = new (_pool) ObjCSelectorAST;
  5471. sel->selector_argument_list = new (_pool) ObjCSelectorArgumentListAST;
  5472. sel->selector_argument_list->value = new (_pool) ObjCSelectorArgumentAST;
  5473. match(T_IDENTIFIER, &sel->selector_argument_list->value->name_token);
  5474. node->method_selector = sel;
  5475. return true;
  5476. }
  5477. case Token_setter: {
  5478. node->attribute_identifier_token = consumeToken();
  5479. match(T_EQUAL, &node->equals_token);
  5480. ObjCSelectorAST *sel = new (_pool) ObjCSelectorAST;
  5481. sel->selector_argument_list = new (_pool) ObjCSelectorArgumentListAST;
  5482. sel->selector_argument_list->value = new (_pool) ObjCSelectorArgumentAST;
  5483. match(T_IDENTIFIER, &sel->selector_argument_list->value->name_token);
  5484. match(T_COLON, &sel->selector_argument_list->value->colon_token);
  5485. node->method_selector = sel;
  5486. return true;
  5487. }
  5488. default:
  5489. return false;
  5490. }
  5491. }
  5492. // objc-type-name ::= T_LPAREN objc-type-qualifiers-opt type-id T_RPAREN
  5493. //
  5494. bool Parser::parseObjCTypeName(ObjCTypeNameAST *&node)
  5495. {
  5496. DEBUG_THIS_RULE();
  5497. if (LA() != T_LPAREN)
  5498. return false;
  5499. ObjCTypeNameAST *ast = new (_pool) ObjCTypeNameAST;
  5500. match(T_LPAREN, &ast->lparen_token);
  5501. parseObjCTypeQualifiers(ast->type_qualifier_token);
  5502. parseTypeId(ast->type_id);
  5503. match(T_RPAREN, &ast->rparen_token);
  5504. node = ast;
  5505. return true;
  5506. }
  5507. // objc-selector ::= T_IDENTIFIER | keyword
  5508. //
  5509. bool Parser::parseObjCSelector(unsigned &selector_token)
  5510. {
  5511. DEBUG_THIS_RULE();
  5512. if (! lookAtObjCSelector())
  5513. return false;
  5514. selector_token = consumeToken();
  5515. return true;
  5516. }
  5517. // objc-keyword-decl ::= objc-selector? T_COLON objc-type-name? objc-keyword-attributes-opt T_IDENTIFIER
  5518. //
  5519. bool Parser::parseObjCKeywordDeclaration(ObjCSelectorArgumentAST *&argument, ObjCMessageArgumentDeclarationAST *&node)
  5520. {
  5521. DEBUG_THIS_RULE();
  5522. if (! (LA() == T_COLON || (lookAtObjCSelector() && LA(2) == T_COLON)))
  5523. return false;
  5524. node = new (_pool) ObjCMessageArgumentDeclarationAST;
  5525. argument = new (_pool) ObjCSelectorArgumentAST;
  5526. parseObjCSelector(argument->name_token);
  5527. match(T_COLON, &argument->colon_token);
  5528. parseObjCTypeName(node->type_name);
  5529. SpecifierListAST **attr = &node->attribute_list;
  5530. while (parseGnuAttributeSpecifier(*attr))
  5531. attr = &(*attr)->next;
  5532. SimpleNameAST *param_name = new (_pool) SimpleNameAST;
  5533. match(T_IDENTIFIER, &param_name->identifier_token);
  5534. node->param_name = param_name;
  5535. return true;
  5536. }
  5537. bool Parser::parseObjCTypeQualifiers(unsigned &type_qualifier)
  5538. {
  5539. DEBUG_THIS_RULE();
  5540. if (LA() != T_IDENTIFIER)
  5541. return false;
  5542. const Identifier *id = tok().identifier;
  5543. switch (classifyObjectiveCContextKeyword(id->chars(), id->size())) {
  5544. case Token_bycopy:
  5545. case Token_byref:
  5546. case Token_in:
  5547. case Token_inout:
  5548. case Token_oneway:
  5549. case Token_out:
  5550. type_qualifier = consumeToken();
  5551. return true;
  5552. default:
  5553. return false;
  5554. }
  5555. }
  5556. bool Parser::peekAtObjCContextKeyword(int kind)
  5557. {
  5558. if (LA() != T_IDENTIFIER)
  5559. return false;
  5560. const Identifier *id = tok().identifier;
  5561. const int k = classifyObjectiveCContextKeyword(id->chars(), id->size());
  5562. return k == kind;
  5563. }
  5564. bool Parser::parseObjCContextKeyword(int kind, unsigned &in_token)
  5565. {
  5566. DEBUG_THIS_RULE();
  5567. if (!peekAtObjCContextKeyword(kind))
  5568. return false;
  5569. in_token = consumeToken();
  5570. return true;
  5571. }
  5572. int Parser::peekAtQtContextKeyword() const
  5573. {
  5574. DEBUG_THIS_RULE();
  5575. if (LA() != T_IDENTIFIER)
  5576. return false;
  5577. const Identifier *id = tok().identifier;
  5578. return classifyQtContextKeyword(id->chars(), id->size());
  5579. }
  5580. bool Parser::parseLambdaExpression(ExpressionAST *&node)
  5581. {
  5582. DEBUG_THIS_RULE();
  5583. LambdaIntroducerAST *lambda_introducer = 0;
  5584. if (parseLambdaIntroducer(lambda_introducer)) {
  5585. LambdaExpressionAST *ast = new (_pool) LambdaExpressionAST;
  5586. ast->lambda_introducer = lambda_introducer;
  5587. parseLambdaDeclarator(ast->lambda_declarator);
  5588. parseCompoundStatement(ast->statement);
  5589. node = ast;
  5590. return true;
  5591. }
  5592. return false;
  5593. }
  5594. bool Parser::parseLambdaIntroducer(LambdaIntroducerAST *&node)
  5595. {
  5596. DEBUG_THIS_RULE();
  5597. if (LA() != T_LBRACKET)
  5598. return false;
  5599. LambdaIntroducerAST *ast = new (_pool) LambdaIntroducerAST;
  5600. ast->lbracket_token = consumeToken();
  5601. if (LA() != T_RBRACKET)
  5602. parseLambdaCapture(ast->lambda_capture);
  5603. if (LA() == T_RBRACKET) {
  5604. ast->rbracket_token = consumeToken();
  5605. if (LA() == T_LPAREN || LA() == T_LBRACE) {
  5606. node = ast;
  5607. return true;
  5608. }
  5609. }
  5610. return false;
  5611. }
  5612. bool Parser::parseLambdaCapture(LambdaCaptureAST *&node)
  5613. {
  5614. DEBUG_THIS_RULE();
  5615. bool startsWithDefaultCapture = false;
  5616. unsigned default_capture = 0;
  5617. CaptureListAST *capture_list = 0;
  5618. if (LA() == T_AMPER || LA() == T_EQUAL) {
  5619. if (LA(2) == T_COMMA || LA(2) == T_RBRACKET) {
  5620. startsWithDefaultCapture = true;
  5621. default_capture = consumeToken(); // consume capture-default
  5622. }
  5623. }
  5624. if (startsWithDefaultCapture && LA() == T_COMMA) {
  5625. consumeToken(); // consume ','
  5626. parseCaptureList(capture_list); // required
  5627. } else if (LA() != T_RBRACKET) {
  5628. parseCaptureList(capture_list); // optional
  5629. }
  5630. LambdaCaptureAST *ast = new (_pool) LambdaCaptureAST;
  5631. ast->default_capture_token = default_capture;
  5632. ast->capture_list = capture_list;
  5633. node = ast;
  5634. return true;
  5635. }
  5636. bool Parser::parseCapture(CaptureAST *&node)
  5637. {
  5638. DEBUG_THIS_RULE();
  5639. if (LA() == T_THIS) {
  5640. consumeToken();
  5641. return true;
  5642. }
  5643. if (LA() == T_AMPER)
  5644. consumeToken();
  5645. if (LA() == T_IDENTIFIER) {
  5646. SimpleNameAST *ast = new (_pool) SimpleNameAST;
  5647. ast->identifier_token = consumeToken();
  5648. node = new (_pool) CaptureAST;
  5649. node->identifier = ast;
  5650. return true;
  5651. }
  5652. return false;
  5653. }
  5654. bool Parser::parseCaptureList(CaptureListAST *&node)
  5655. {
  5656. DEBUG_THIS_RULE();
  5657. CaptureAST *capture = 0;
  5658. if (parseCapture(capture)) {
  5659. node = new (_pool) CaptureListAST;
  5660. node->value = capture;
  5661. CaptureListAST **l = &node->next;
  5662. while (LA() == T_COMMA) {
  5663. consumeToken(); // consume `,'
  5664. CaptureAST *capture = 0;
  5665. parseCapture(capture);
  5666. if (capture) {
  5667. *l = new (_pool) CaptureListAST;
  5668. (*l)->value = capture;
  5669. l = &(*l)->next;
  5670. }
  5671. }
  5672. return true;
  5673. }
  5674. return false;
  5675. }
  5676. bool Parser::parseLambdaDeclarator(LambdaDeclaratorAST *&node)
  5677. {
  5678. DEBUG_THIS_RULE();
  5679. if (LA() != T_LPAREN)
  5680. return false;
  5681. LambdaDeclaratorAST *ast = new (_pool) LambdaDeclaratorAST;
  5682. ast->lparen_token = consumeToken(); // consume `('
  5683. parseParameterDeclarationClause(ast->parameter_declaration_clause);
  5684. match(T_RPAREN, &ast->rparen_token);
  5685. SpecifierListAST **attr = &ast->attributes;
  5686. while (parseGnuAttributeSpecifier(*attr))
  5687. attr = &(*attr)->next;
  5688. if (LA() == T_MUTABLE)
  5689. ast->mutable_token = consumeToken();
  5690. parseExceptionSpecification(ast->exception_specification);
  5691. parseTrailingReturnType(ast->trailing_return_type);
  5692. node = ast;
  5693. return true;
  5694. }
  5695. bool Parser::parseTrailingReturnType(TrailingReturnTypeAST *&node)
  5696. {
  5697. DEBUG_THIS_RULE();
  5698. if (LA() != T_ARROW)
  5699. return false;
  5700. TrailingReturnTypeAST *ast = new (_pool) TrailingReturnTypeAST;
  5701. ast->arrow_token = consumeToken();
  5702. SpecifierListAST **attr = &ast->attributes;
  5703. while (parseGnuAttributeSpecifier(*attr))
  5704. attr = &(*attr)->next;
  5705. parseTrailingTypeSpecifierSeq(ast->type_specifier_list);
  5706. parseAbstractDeclarator(ast->declarator, ast->type_specifier_list);
  5707. node = ast;
  5708. return true;
  5709. }
  5710. void Parser::rewind(unsigned cursor)
  5711. {
  5712. #ifndef CPLUSPLUS_NO_DEBUG_RULE
  5713. if (cursor != _tokenIndex)
  5714. fprintf(stderr, "! rewinding from token %d to token %d\n", _tokenIndex, cursor);
  5715. #endif
  5716. const unsigned n = _translationUnit->tokenCount();
  5717. if (cursor < n)
  5718. _tokenIndex = cursor;
  5719. else
  5720. _tokenIndex = n - 1;
  5721. }
  5722. void Parser::warning(unsigned index, const char *format, ...)
  5723. {
  5724. va_list args, ap;
  5725. va_start(args, format);
  5726. va_copy(ap, args);
  5727. _translationUnit->message(DiagnosticClient::Warning, index, format, ap);
  5728. va_end(ap);
  5729. va_end(args);
  5730. }
  5731. void Parser::error(unsigned index, const char *format, ...)
  5732. {
  5733. va_list args, ap;
  5734. va_start(args, format);
  5735. va_copy(ap, args);
  5736. _translationUnit->message(DiagnosticClient::Error, index, format, ap);
  5737. va_end(ap);
  5738. va_end(args);
  5739. }
  5740. void Parser::fatal(unsigned index, const char *format, ...)
  5741. {
  5742. va_list args, ap;
  5743. va_start(args, format);
  5744. va_copy(ap, args);
  5745. _translationUnit->message(DiagnosticClient::Fatal, index, format, ap);
  5746. va_end(ap);
  5747. va_end(args);
  5748. }