©) studocu Compiler design unit1[7 wv EVOKE eUdUYTUNUE UY et * Compiler nwt UNIT-|— tntroducHlon’ to Compiles PNIT=[ Indroduion oe Tebicss thases amd low , Bootstrapping , Finite stake machines 4 ‘egulooi exfresiont amd then abpliation rexiol analysis, hAimizalion of DEA- Based pabkorn’ Molchers implementaHion 4 lexteol ambyoow’ , lexical analyzer generates » LEX compiler» Formal qrwmmans and thein abpitcelion to syntax omabtvlls », BAF Notaion , ambiguity, YACC The syntace specifeaten Go bropaming languages CFG, deniyakien amd pane bus Gb ties Of Cre, *& Traniledor s- A translater dy a programe that-takes a Inpuk ss @ program weitten in one proyarminy language WMS Venguage) and pinduas a4 oitbut a prone fr Amerie language target (language). Source language —sfbranitater [> -trrigeh lamguage E> A Compiler Gs a programs kakes a program o+ ‘mbuk wrvitten in high -Jeval Lamgusge amd Conve it into equivaluat Jou Janet Jamguage &F machine language Like UUsembly language vay ovpput Pogvam. rae Compiler |—>-turgek frog Chigh level ) ~ Cow devel) (enn mugage ) Dunting Hy conversion Ff. deme erred ocuwud then Compiler Abb lays ewes memage. Properties 2 combiler Should be Following: Ss ao ane — Buy free = portable s eo _— must have Consistent opHimization. 4-H Sern ae ____dsmaisataiectonme GY studocu led by Aamit Shekhawat(asm4shethawat2823¢2gmail. com)r * thax &{ Compilex Www Sounce > Combiler—> Machine Invhudken n Froa q compilalion J Complex brown Ao therfore Fie Wide the whole prow qf combiler inte partitions Gr RU | subprterer caltud Phar g ,fompbilex. "Source Pangtam * Scanning Semantic AnabyAv Thtoimedice ode] [Oereed s] ane Generator handiey jah} Code ObH mization — Code Tanget Program D Lerdeal Anadis s~ 1 fs ao tallid Scamming. In his fink hme . Of Compilation the Combiele ounce Propo q “4 stamned amd scanner Sthanode china det o} sounce X langusge into qroubs er token. % Wal token ane Kiywords , identifieu ,dperators, punduation & NX Output oj this phoxe dy Sbeumo} tokens urhich pawed fo Next x Phase. : Downloaded by Asmit Shekhawat(asmshethawat2828@@amail.com) PDA ARMAAA MARA RD Re eS Q a9 yy Syntax Analyst 1s a cabled feting tne nis the token, gnurated by lexioh analyzer one euPel Loyether to form a gyntacke struchune, This syn T5 Colles Ponie tee y gyntax free. jackie Shucune 3) Semantic Analysis t Semantic analyits d elemines the sounce Syntax for semantic enor +In the expssion making ©} pantanthers , matching Hf ee amd ete 4) Intenmediakt code Generator §- The intermediak tode gemeroher taker Syntax tree ot inpuk from Semantic Phoke amd gemerakes Intemedts code as three adden code (It consists of instruc’ each which her odmost three Oberands ) a 5) Code obtimizadion & This dsan opHona phase «tn this Phase the Infrmediak ade, improuu 40 that Code takes le Space amd runs fasten te In thin phase the target code get generated , The intermediate code inghucherA ane homlated nto gequence of machine inshuction. Symbol table & The data Studune uted to weord the ementiag Tnfermakien Amd contaims a reterd thet alfous UA to Find detail fos each identifier quickty amd to store er merieve dofa from the record quickly. © code generation Exmoy homdtens- The evrer handler weborts when an errex ocaed in amy Port of sowne a a ea VUVUVUUUDKOUEVEUYYUYUUUEY program. "Wis coeur i velabeo chrg on @ studocu Downloaded by Asmit Shekhawat(asmAshethawat282%@amal.com)Ce Given aH Sa shoring Jenin ge Position z= Tniat 4 made 60 Aint Aexteot an 7 Tales tar 4 faa #60 symbol Table aymbel Table Eee TT iat \ Jy bh 6 No far ar wR Ww ht ‘feral intemmedioh code 7a ‘emp | 4s inttortal (60) stem? $= ida temp} row F ida 22 Mul F 4¥ 60-0) PL Move (da, Bt Anok Be AL Mor RA sid] Downloaded by Asmit Shekhawat (asmshethawat2828@@amail.com) ifHy Ruse of Complou- Portion @] one or more phases ae errr 50r~reeo Combined info a module coded a pay, Thent at coo tyb@h g§ haws ef ompiler ane Following: (1) Aingle Pas mbile1 2 LH scan the Souda progrem ty one Hine He meams single pax Compiler contour olf the phates 8} Compiler. 2) Multi paws Combiler-2 Ht Seam the Sounce program md produc ni, os (F modified form then Siam amd produce 2 motitied fem am 480 on mill the torget coches is Tench - Such o combiler is Colled mutibas compiler. * Ceobshat hing * Gootshrabbing Lu a dechnique @ writing Gmbiler jr the Sounce Pryramming language that gt indemd to com bile « The languages BASIC, C, JAVA, PYTHON He bhooistobbed. A Compilen du chanacknized in thre Jamguages Sowne , target and imbentation languages i 7 Niagra z = { Sowne ang-—>toryet lang. [el 3 Impleted fn K Cioss Combiler s- A capgs compiler dy & combilen which is Ltn tamer Cohable for creating exeuutable Code which mey MUD EN then plakferms alo as well om Ighichthe combilen dy fanning « E42 Window 1” compiler Produces code that runs on amdariel : allio.; that can't .be., Token & Mis basfealy 0 sequanes of han umit 4 an : Vavken feutther « Smatlat Iindividuod Program is cated Token. In, C. (rogremening feungy Hey Tendifiens» oberodon , pinckuaters aru tokens: Se Calcutade Jotul umber of tokens ‘In the following a as log osoert Total no 6) token: 5 nd heaton fanctustor Ww 8 oh fet OP nt maint) f es 17 POMEL CO Sendbithe sing inside quotation tp. “ J the Stamndara outbid Che diaploy) Print® ("Weltome to GeGIDs rekvin 6 5 “ a 5 Cif) maim (3° aay = ‘ { i Os b ttt tt $4 —~ Jy aay Pent t ("hel pol "sa, bd 5 Total no-of toxwns = 23 Lexeme it is @ sequence of chotade tn We Sounce code that ant matched by given preiefined Pakkean for every lexerne to be Specified at a yollid token S33 maim Js lexeme of type Identifier Crokeny Cs) ofr}. ane jexemer o tbe, punchotion (token) PORN Ub shecisig a Set Of mu thet a scanner follows to Create a token -a se Finite Automotat Linike Automoka da the Finite sine aching «te 1S. an abshact mathing Ht xd input trem jnput tape and afler recognizing ‘i AmB Gay “yes? gx Sy about each possible Tnbul siving thak the inpu isting ill be accabted by. giver long, or Nor. Finife Automata. 3 DEA NEA ' (Delenminigte Finite Aulomaly) — (von pekaminisHe Finike Automate) W Deloministe Finite Auborake (OFA) OFA dh detenminiske n an the sense that thene is only Ene path for shecitic ‘inbuk fom Curent stale fo next stake. DFA 4s one. in hich ead move 1s Umiquuly, deemined by the Guvient configuration. DeFinition:- A delenminishic Finike axtomada defined by 5 tubles- M= (QS, 8, 40,6) whew Q= A nike non embty set of Rlode S= A finike non empty get of input symboig Jo Jo is bled initial ste, YEG Fe Sk @f Final State or accepting state. § = Tramsitien funchion & Qxe SQ ey Sask: Conshuck a pF A ushich accept airings steading with @ over = (aib). at) O= (40,4) 408 One QAP sefany > ; doe Lh Fe {dt $3 Qx27Q ferences ots Mesias nthe on @ studocu ‘Downloaded by Asmit Shekhawat ([email protected])tliat _ ‘Troniittn ae fae) Qa Coupe 4 DgA hich accept al sings = ing (iy ending tha. xo Gotan i v a, aan, ba, ab, abby -» g & 7 (i) ei ‘wih’q Lz f'4, 44,200, 40, baba, aba, abaaba Ms abe Quien Seyign «Ff ch aces fl ching oer (0,1) rn labieh second Symbol is {Gand 4” Symbol ig 42 , , , , , , , 1 ’ , ' ’ Downloaded by Asmit Shekhawat (asmshethawat2828¢@gmall.com)Ow DEA ovtn = > fa,b} ter ending with abb? Gus DEA tn hfe ard symbel from ane eft avd dy abeomas & 7 -@O43@ ab é Ce A Bae 2; . teat ® Non- dutcaminisdic Finite Aufomada CuDEA) & NOFA Is din from OFA in that 2% in it the exack x h the machin, moves camtt be debmnmined Nenct TEAS CllRed hon: debeaminishe Hinik, auukemoda. Definition t- A NEA is dofing by,,5 tubles — Ms (G,S,%0,8,F) the-tange of 8 In WEA Ts in the poueuek She to wht ° hue, G = A Finite non embty set of States s = Adhile set g input symbols Yo= is coltcd initiol aint 5 dea Fe 8k ef final states $s Qxs + 28 Guss- Construct NA that secogniens the Lomgunge af equa exp: @ryt aby ovens fab} ? Qe $0) % 4, I oer “QO -*—B b> se fayay Qi ez Lob Fe {ash &% QxS-> 99 ‘Wis ocurent i vlabes o chrg on @ studocu es 1ded by Amit Shekhawat (asmshekhawa!2823¢@amailcom)Buss Comuck an nea tn whicn 9% symbal from “sight Side Is a7 Qa, =e a @2+ @ae ® Gust Vesign am neAmusbich studs aa er bb? POG" mea Quen. Qaste Design am mfAinwhich stings, “ends with.aa or bb! NFA o W binary Srings in which 2 Jagt bit is b overter!? sregutar exprusion > (© +*) (OH! Que < by Aamit Shekhawat (asmtshekhawat2823¢@amail com)& Difference bebineom DEA amd NEA & aCe DEA NEA, © MOEA muhpte choices au not] in weA muthble choiws ome rest + hamge the State | available -to chamge the state For & basdfuon onbut: | Fes a bantuilon Snbuk ® In OFA epsition is rst alved |in NEA ebillon 18 ollouel DFR not Acteht ebsillen . ' {NEA accepts ehaillon, ®@ & @xesg 63 Oxsa09 © Bening amd Undeurtamding | dextmning and umdunsterdiing oy. Conversion NEA tbh A S| on ° Bu Convert the following OFA to OFA ~ EL To convert an sth into OFA follow the gisin skba~ (i) Make +he 4rams\tion table ef given NFA. ° Gy conshuch the “hranition dable fer pf A Corres bonding 40 NEA tomgiHon table. "Wis ocurnt i velabeof chrg on @ studocu by Aamit Shekhawat (asmitshethaw :23¢8omail com) em RB ew ewe ee eeack [at | fet $e 194} Hen, a\(e0,3 4 , tramion (id Construct a eA Corretpondhy te He DFA.“NL uth eben Eu) Fe mage au) ey WE Bn Chamg Provided the E- move | men the Wuvunt she tothe cunothea stele without veel OM Snbuck. ty di Wt is Shown by ¢- Our Design NPA whieh qceepts all the ahrings Of 3 6 wrhich either. Atwiking with ab or ending ba uring € -hromsi Hon? € iO} © } ub it =e Teraeks chien moves aithnat ~€.) tro vemout § rama ~~~ From a. g-ne A fellow” the , Steps given pelour- to oon Bu Q—$~ HA] wen stn c 2M To remevt ebsilon mouvel Find adh producten 6} i &1 amd Bhow Same Produdien from %y 61+ Le js Hah moke %, Hrah 14 nial moke de init Qux. C9 6 NEA with & Ons, @ , @ : OQ -® Qa © t Or@ c ‘is document valde of charg on @ studocu own Cc y Aamit Shekhawat (asmtsheshawat2823¢@gmail com)“Ainimigption ef DEM ¢- Ce i ‘til 7 Dun Minimize the de Constiuded by the go tromion gble 24 Wwe can find - No=( {43}, {%, 41,41, tarts te) Ky eC {Ah [%0,%1, Isr%}, 12,24, yaa}) Rae ( 4%}, [40,44 14,88} Seated, Fo) Tye (4933° $e, $8.52}, Pr2as, 42h) es Mae Ay Step the pray 1 0 Leh fh fa, 4st Sto , Ue} Oo 540, 4h] fn ish §4154s4 | fortes $2, 24d | £23} # ful |. S033 {aad | fate%% Reg alan: Sxpremion Regalon expres lens’ axe uted to ape wert regulon Languagt in Te form of xbretion * i) Ke tho the mothmal cl expres en ; OH provide uteful amd Conierigmt natakion forrepreventiing token, Any ferrninat symbol C input symbol), € omd g ate vqube exbrevion . © 3 weet a 3 tefa} p a€e Gy ve & and Ry One op equlan expretsiont tein union, @nok- mhatton both oot alte segulan exbremions . . UL CBR) = LER Lee) CR, ay - UCR) Ley diy 1 Risa “regulosr exbrenien thon thet woHesah!on RF is A880 a regula exbrenion, « 3 ¥ L(t) = front Busey ; Cy) RE, ends with of, E=fo1} OH)*o} . x bare h Ud RE, sk and ends with b Gi) RE, Second stmbol is 0 amd — Guy o Con) | CoH ” u sgmbol Js 4. a OD RE, hos exactly 4 ones = OF L oF | OF] oF} of) # Fort mal Geammavs amd thes abptiotion fo Sprit amaly sis -8: ERR RF a i A lO A Geran s- pny crammar Gy js defined by + thet G= (VT, hs) hues © Ve Set ©} Vasuinble, oF non-Haminols T= Seto} Terminals ey input symbol ‘ ings of th Se ME 18 Calted the stort vanlable. (eerminal siting ‘ Jamguage ant alirays: dinived whem se Sent om Stexting Vostiatie) : : Pe Set of troduckiontules- Cfrodudion one abworys _ anda head ¢ body which Contain the equenee denr tt hon-teaminals but at Lok one Non eaminal Aho be thene in’ the nesd ) 1 : 4 Ge ( {5A}, farby, tS) San AzaAla Bo bei "pe Context Free Grammer (CEG) &- lt 1S dagined by 4 tuPlet G= Wy TPS) whee, Ve set of variables oy non fenminos-] ubpercart LSet Ghia symbols dow not abbeon fn the, vevmgusge) Te Sek} Hnminadd or Inbuk SpAbolA,| Power we Sabtnnt Ghe stings of the lamguage ara the acquamce @ teaming’). f= set of -Podudion wes - hott (The Production hes art obasays"in tht forme of fA & fn crm whee ACV F< cWouT) 3) $= Starting Symbol oF Variable iin i Coshene 7 tant the danivdion fom Kradting symbol only Hen Use Gsddh "gah dhe Akins 4} oun Sormpuage.) Jed by Asm Shekhawat(asm4shekhawat2823¢2gmail.com)Py Derlwakion tree o ane heen Fiderwation dree or fase fete eee an fora CEG (WT, PS) 18 & Pug Satisfying +e fetlowing- “y > Evuy node Ras a Jabel which is a vanitatle or teamirat er €- > The Yoot haa Label 5 > THE label of an interna node is a vanishe. UE the nods With: labels Xp Xa gunn Xp VE Me childown of & fede we ode with label A than @ produion Avy \y--Xie Shout Cxist in p, > A node ts a Leaf if THs label $5 a terminal ov ¢ . The hede is O's child of LY pownt Tf is label Tse. 4s Dvaw a Poe tree for id+idw id by E> Ete |exel id EsE+E| EXE] Id EF ay +E ,ocIEN id —€ FE | 1 id i wesw: T+ Td id d [ay left most derivalion-t A denvekion Abi is calted a Left woe [et most duslienen derivation TF we abbly q production eny te the left most variable ak envy Ate. eye EDEFELEXEL Id aesutk = id tid 8 “ES G4E 2 Tate: 2 Ide BFE . > tat id E whut = Tdalde id a idaid wid "Wis oeunt a velit of charg on @ studocu own y Asmit Shekhawa (asmisheshawat2823¢amail com)i 2 Fgh menrdenuetlon eA Mauchion “abo Te altad = GPE most danivation f+ weabply prodiuckion Only to We vight mosk variable ak every Alb: S22 Ew etElexelid rwwhs ida Idris 2 E> Exe (2 EX E+E > Ex E+ fa Ew ide Id 4 _ mau «ide iad Ta aid tid x Ambiguity © 2 : fen ; Ambiguity © p terminal string Wet Co) $5 amiibiguos HF oe ii ~ them -@xists “too es moe derivation +nes for O WAL eXISTS OO oF Mort left ost devivalion EY string w- CEG‘ Is ambiguous 14 Hue Rvishs some we L(t) which VS ambi guows- ge EDt+elewelid — requtts idvidy iA se Capabilities of Ch 4 e@ moat of PDYrarning jamguod- ed steu nes Kes > CF Ys -Wieht to dectib zeae and So > CF is capable of descibing ns ” polamted paranthows S phakening begin Lenduy if on. ; Fs probaly designed her a eseicient 1 the grarmen cm be conspulred aukomnoh oily. parser by Aamit Shekhawat (asmitshethawat2823¢gmail.com)+ bg FO F Buition exbleim feimol qrammacr amd ies abphi oki Syntax amalyzer 2 / be as WY The formal yraman rebreemty the specific of Programming lemguage with the wx of produdion TULL. > TRe syntax amazon basically chedy jhe Syntax aq language. > A syntax amabyzer takes the token, from lexical analyzer @nd qreups them in sud a woy thak Some prOTVarrming Shuduie Gm be recognized . . > Reker grouping the tokens Tt ab all amy syntax Canlt be *ecogni zed ton syrtaddc emer Wil be genutohed: > TRY cvenall prowy fs called syntax checking o language. > TRIS Syrtax Gun be checked fn the combtler by writing He Sheci-Htations. : — Shecifeetions kits Compiler how the syntax ef the pre qraming language should be’. ‘ % GNF Notation + Developed by John Backus amd feter Naun. Were ot Stands tox Backus-Naur Porm. dhe ONF 7s a hotedbten Technique for context free Grama TRY notation is Usetul ter Shecitying the syntax of lamguagze. The nF sheciti ution 7S ays | ese ~exPresion__ | exp . Feat 18 a non Leamfnat samd —exprenton_is ¢ s 4S Aenminals Gnd Non terminal. 7 FR means left.aide gek reblaced with aigh stde; ” 6 ezip [9H eAddien > So= << fullnamer “? | enumber> oe): [2|s---]35 * Imflementedion of lexical Analyzer +- lexical analyzer | ~~ _=rer17"cerrerereeeesofrem can be implemented 7 Following Akpss, ; Q> Lexiat Analyzer accept Sounce program cu Snpuk = 1 Sam the Sounce prvytam for gemeraion of tokens. GY We Know “regulan expreniens ane Wed to repre the input Pabean. (sero vules )’ UID Now bs Input pabtinn is Converted Tndo NEA by 08 “Finite ako mation’ machine. Regular exbrenion Finite Automoda | inp ___ [Teta dnabyzor . program twkemized output fle {Symbol table iw The NFA ove then converkd into DFA and DEA ane sninimized “by using dfewnk mathods of aint ni Zad10 n- d w The minimized OFA ose ued to reeognize . the fallen am brorenjinto lexemes. | . “a Paoqran ; ie | Jed by Aamit Shekhawat(asm4shekhawat2823¢2gmail. com) |{G) Each mintratged DEA fs amocbted ustth a. pak 4m. propia lampuage which uM evaluale the lexemes Hat mach vegulan exPreien. . |WITHCoo1 Hen Consinu.« Shie dable for the abbrobriate Sinike state machine und: cyeakes broqromm Code urhi’eh wntajns Ahetable 5 the ewabuoction phowe ond youline- He lexicak Analyzest Genevabor 5- For efficient duigen of ee ro Combilen, various toola ane Used & automate the Phas of compiler. The levical anobiys phase Gon be “axdornated Wing & -to0l called LEX. : > LEX Ts a unix untidy whih qemurates a Vexicoh amabynen ai 1 Bg (Brite automa) automalfttly coilh the hall & Teulon exprenivon. / > LEX Anker at Hts Inpuk a LEX sounet prope and producy lexfcat amalyzer as Hs outbul- 7H convert string entuad by Ur tro ckemt 03 Hs Oubbud Automatic gemerabion of lexfcol amalyzen — 3 > Audomedie generation of lexical Analyser Is done uaing LEX Programm ing lamguage- >The Lex shecisicodton Hie cam be demoed using the exleniten JS : X Lex Sounce pram ' 3 Jex-§—__y Aang. hse H——$> hex -yy.c ae lex-4§-c =o " object | Comps. [—? dou one ) 3 Stream [+> Sequence of LS ou% | ore , CdR, “Ihe osonents walone fae oT GOT Downloaded by Asmit Shekhawat (asmshethawat2823@@amail.com)>The hour disgrm shows creating & “a Saxioh amalyzer teat Lex. : the Lex An Input Fle , which’ we call Pex 4 is wetitten ih language and desertber the exited analyzer to be demented The lex combiler tamsform Ley.t to a c froyrr ine File that ts always normed Lex eyyee > Afterdhak tile 1s “compiled by Compiler amd nou lex-yy-¢ nto a fle called gout a alway. —> whim gene Inpuk sheum is given to arouk then seine ©} toKens gebh genuraked. tt mecums Q-0Uk ue working & lexteat analyzer, Steuctune of Lor Program © A Lex program coniots of frour following: parks ~ — Part | decanoti ens Yo Yo tramlottonad mules | 5 Goda Gefinition 8} % Yo To Kun auyil coy functions | > fant 3 exblanation—: The explanation of abou proyram 4 followiry— 1) Dechanakion fection 2- In dedanokion Sedien , decoration o} vasrinhley and tonstunts "Gam be done. Seme regular AefinHens cam alto weitten fn Hi Bechon. 2) tramsfohignal Tues Aedion ir > The tw seckfon Consists of regular exp: with axsocioted Actors each translodonal nue hove the formt PottennLAckion} of RE: {Action}FZ Each Pattewm is a vequlas exbrowion which may use rg lant dif inition from declaration section. > The ackoma ane fragment of code dzexuribing what action Is to be Aken toy Comesbonding ‘regulon exprenien. > The acon can be Apecied by Piece YC Code, 3) Auxiliany Fundions section \n Wi sechion alt the brudieuy er Sunchon Pitinad which aru regquined by action tn the TW kakZon. TRE Aection Consists of too funckigns + o main C) function GY w~b ©) Fundien "Tis coeur ia velit charg on @ studocu’ led by Aamit Shekhawat(asm‘shethawat2823¢2gmail.com) ownTe ~P4ACC (Yer finother fompiler- Lo mbiter)!S tha grandad faryey BeNemeket for Unix o bemotiy System: — An open Sounte Praqsom /YACL gems cashes He ce Procmnesming lang umge - D> bis aiook week Leyte Aight CALE) farser qmorader, FMwiahing a Pr, the Fark} & Compile” thok ny to Moka Syntactic sere ef He Source cole. Coy He RTA 1ded by Aamit Snekhawat (asmshekhawa!2823¢@amail com)