12/3/2008. Schedule. Target Code Generation. Target Code Generation. Gap: machine code. Tasks of Code Generator. These tasks interact
|
|
- Emory Stephens
- 5 years ago
- Views:
Transcription
1 Shul Trgt Co Gnrtion Dvi Notkin Autumn 2008 Projt D: intrmit o gnrtion Du: Dmr 3 Du Dmr 10, 5PM (vill Mony 11/17) Projt E: trgt o gnrtion [MiniJv++] Writtn ssignmnt [MiniJv--] Finl on Dmr 11 (on hour, kn ous) CSE401 Au08 2 Trgt Co Gnrtion Input: intrmit lngug (IL) Output: trgt lngug progrm Trgt lngugs inlu solut inry (mhin) o rlotl inry o ssmly o C Using th gnrt intrmit o, onvrt to instrutions n mmory hrtristis o th trgt mhin Trgt o gnrtion must rig th gp Gp: mhin o glol vrils IL unoun numr o intrhngl lol vrils uilt-in prmtr pssing & rsult rturning sttmnts sttmnts n hv ritrry suxprssion trs onitionl rnhs s on intgrs rprsnting Booln vlus glol stti mmory Mhin Co ix numr o rgistrs, o vrious inomptil kins, plus unoun numr o stk lotions lling onvntions ining whr rgumnts & rsults r stor n whih rgistrs my ovrwrittn y ll mhin instrutions instrutions hv rstrit oprn rssing onitionl rnhs s on onition os (my) Tsks o Co Gnrtor Rgistr llotion or h IL vril, slt rgistr/stk lotion/glol mmory lotion(s) to hol it s on it s typ n litim Stk rm lyout Instrution sltion or h IL instrution (squn), slt trgt lngug instrution (squn); must onsir oprn rssing mo sltion Ths tsks intrt Instrution sltion pns on whr oprns r llot Som IL vrils my not n rgistr, pning on th instrutions & rssing mos tht r slt Stk rm lyout my pn on instrution st CSE401 Au08 6 1
2 Rgistr Allotion Intrmit lngug uss unlimit tmporry vrils this intntionlly mks ICG sy Trgt mhin hs ix rsours or rprsnting lols plus othr intrnl things suh s stk pointr MIPS, SPARC: 31 rgistrs + 1 lwys-zro rgistr 68k: 16 rgistrs, ivi into t n rss x86: 8 wor-siz intgr rgistrs (with instrution-spii rstritions on us) plus stk o loting-point t Rgistrs r muh str thn mmory Must us rgistrs in lo/stor RISC mhins Consquns Shoul try to kp vlus in rgistrs i possil Must rus rgistrs, implis r rgistrs tr us Must hnl mor vrils thn rgistrs, implis spill Intrts with instrution sltion on CISC, implis it s rl pin CSE401 Au08 8 Clsss o Rgistrs Clsss o Vrils Fix/it rgistrs Stk pointr, rm pointr, rturn rss,... Clim y mhin rhittur, lling onvntion, or intrnl onvntion or spil purpos Som rgistrs my ovrwrittn y ll prours so llr must sv thm ross lls, i llot llr-sv rgistrs vs. ll-sv rgistrs Srth rgistrs rgistrs kpt roun or tmps (.g., loing spill vlu rom mmory to oprt on it) Fr rgistrs rmining rgistrs r or rgistr llotor to us Wht vrils n th llotor put in rgistrs? Tmporry vrils: sy to llot Din n us xtly on, uring xprssion vlution, implis llotor n r up rgistr whn on Usully not too mny in us t on tim implis lss likly to run out o rgistrs Lol vrils: hr, ut ol n to trmin lst us o vril to r rgistr n sily run out o rgistrs so must mk ision out whih vrils gt rgistr llotion wht out ssignmnts to lol through pointr? wht out uggr? Glol vrils: rlly hr, ut ol s rsrh projt Rgistr Allotion in MiniJv Allot ll lol vrils to stk lotions No n or nlysis to in lst us o lol vrils Eh r o th lol vril trnslt into lo rom stk Eh ssignmnt to lol trnslt to stor into its stk lotion Rgistr Allotion in MiniJv Eh IL xprssion hs xtly on us so n llot rsult vlu o IL xprssion to rgistr Mintin st o llot rgistrs Allot n unllot rgistr or h xprssion rsult Fr rgistr whn on with xprssion rsult Not too mny IL xprssions "tiv" t tim implis unlikly to run out o rgistrs, vn on x86 MiniJv ompilr is i it runs out o rgistrs or IL xprssions CSE401 Au
3 Rgistr Allotion in MiniJv Stk Frm Lyout X86 rgistr llotor x, x, x, x: llotl, llr-sv rgistrs si, i: srth rgistrs sp: stk pointr; p: rm pointr loting-point stk, or oul vlus CSE401 Au08 13 N sp or ormls lol vrils rturn rss (my) ynmi link (ptr to lling stk rm) (my) stti link (ptr to lxilly-nlosing stk rm) othr run-tim t (.g. llr-sv rgistrs) Assign it rgistr(s) to support ss to stk rms FP: ptr to ginning o stk rm (ix) SP: ptr to n o stk (n mov) All t in stk rm is t ix, sttilly omput ost rom FP Comput ll osts solly rom symol tls MiniJv/X86 stk rm lyout Frm pointr Stk pointr..llr s rm.. orml N orml N-1 orml 1 rturn rss llr s rm ptr llr-sv rgistrs lol M lol M-1 lol 1 rg K rg K-1 rg 1 high rsss stk grows own low rsss Clling Convntions N to in rsponsiilitis o llr n ll in stting up, tring own stk rm Only llr n o som things Only ll n o othr things Som things oul on y oth So, n protool just lik in th IL X86 Clling Squn Frm pointr Cllr: vluts tul rgumnts, pushs thm on stk in right-to-lt orr, to support C vrrgs ltrntiv: 1st k rgumnts in rgistrs svs llr-sv rgistrs in llr s stk xuts ll instrution rturn rss push onto th stk y hrwr Cll: pushs llr s rm pointr on stk th ynmi link sts up ll s rm pointr llots sp or lols, llr-sv rgistrs orr osn t mttr to lling onvntion strts running ll s o... Stk pointr..llr s rm.. orml N orml N-1 orml 1 rturn rss llr s rm ptr llr-sv rgistrs lol M lol M-1 lol 1 rg K rg K-1 rg 1 X86 rturn squn Frm pointr Cll: puts rturn vlu in right pl (x or lotingpoint stk) llots sp or lols, llr-sv rgs pops llr s rm pointr rom stk pops rturn rss rom stk n jumps to it Cllr: llots sp or rgs rstors llr-sv rgistrs rom llr s stk ontinus xution in llr tr ll... Stk pointr..llr s rm.. orml N orml N-1 orml 1 rturn rss llr s rm ptr llr-sv rgistrs lol M lol M-1 lol 1 rg K rg K-1 rg 1 3
4 Instrution Sltion Cogn iiulty pns on trgt Givn on or mor IL instrutions, pik st squn o trgt mhin instrutions with sm smntis st = stst, shortst, lowst powr,... Corrtnss ig issu, prtiulrly i ogn is omplx RISC: sy usully only on wy to o somthing losly rsmls IL instrutions CISC: hr to o wll lots o ltrntiv instrutions with similr smntis lots o possil oprn rssing mos lots o tros mong sp, siz simpl RISC-lik trnsltion my not vry iint C: sy, s long s C pproprit or sir smntis n lv optimiztions to C ompilr CSE401 Au08 20 Exmpl IL o: t3 = t1 + t2; Trgt o (MIPS): $3,$1,$2 Trgt o (SPARC): %1,%2,%3 Trgt o (68k): mov.l 1,3.l 2,3 Trgt o (x86): movl %x,%x l %x,%x On IL instrution my xpn to svrl trgt instrutions Anothr Exmpl IL o: t1 = t1 + 1; Trgt o (MIPS): $1,$1,1 Trgt o (SPARC): %1,1,%1 Trgt o (68k):.l #1,1 or in.l 1 Trgt o (x86): l $1,%x or inl %x Cn hv hois: rquirs mking isions Yt nothr xmpl IL o: // push x onto stk sp = sp - 4; *sp = t1; Trgt o (MIPS): su $sp,$sp,4 sw $1,0($sp) Trgt o (SPARC): su %sp,4,%sp st %1,[%sp+0] Trgt o (68k): mov.l 1,-(sp) Trgt o (x86): pushl %x Svrl IL instrutions n omin to on trgt instrution Instrution Sltion in MiniJv Expn h IL sttmnt into som numr o trgt mhin instrutions on t ttmpt to omin IL sttmnts togthr In Trgt suirtory: strt lsss Trgt n Lotion in strt mthos or mitting mhin o or sttmnts n t ss: mitvrassign, mitfilassign, mitbrnhtru, mitvrr, mitfilr, mitintmul, rturn Lotion rprsnting whr rsult is llot IL sttmnt n xprssion lsss invok ths oprtions to gnrt thir mhin o h IL sttmnt n xprssion hs orrsponing mit oprtion on th Trgt lss Dtils o trgt mhins r hin rom IL n th rst o th ompilr hin th Trgt n Lotion intrs 4
5 Implmnting Trgt n Lotion A prtiulr trgt mhin provis onrt sulss o Trgt, plus onrt sulsss o Lotion s n For xmpl, in Trgt/X86 suirtory: lss X86Trgt xtns Trgt lss X86Rgistr xtns Lotion or xprssions whos rsults r in (intgr) rgistrs lss X86FlotingPointStk xtns Lotion or xprssions whos rsults r push on th lotingpoint stk lss X86ComprisonRsult xtns Lotion or ooln xprssions whos rsults r in onition os Coul in Trgt/MIPS,Trgt/C, t. An Exmpl X86 mit mtho Lotion mitintconstnt(int vlu) { Lotion rsult_lotion = llotrg(iltyp.intiltyp()); mitop("movl", intoprn(vlu), rgoprn(rsult_lotion)); rturn rsult_lotion; Lotion llotrg(iltyp): llot nw rgistr to hol vlu o th givn typ voi mitop(string opnm, String rg1,...): mit ssmly o String intoprn(int): rturn th sm syntx or n int onstnt oprn String rgoprn(lotion): rturn th sm syntx or rrn to rgistr An Exmpl X86 Trgt mit mtho Wht x86 o to gnrt or rg1 +.int rg2? x86 int instrution: l %rg, %st smntis: %st = %st + %rg; mit rg1 into rgistr%rg1 mit rg2 into rgistr%rg2 thn? An Exmpl X86 Trgt mit mtho Lotion mit IntA(ILExprrg1,ILExprrg2) { Lotion rg1_lotion=rg1.ogn(this); Lotion rg2_lotion=rg2.ogn(this); mitop("l", rgoprn(rg2_lotion), rgoprn(rg1_lotion)); llotrg(rg2_lotion); rturn rg1_lotion; voi llotrg(lotion): llot rgistr, mk vill or us y ltr instrutions An Exmpl X86 Trgt mit mtho Wht x86 o to gnrt or vr r or ssignmnt? N to ss vr s hom stk lotion x86 stk rrn oprn: %p(ost) smntis: *(%p + ost); %p = rm pointr An Exmpl X86 Trgt mit mtho Lotion mitvrr(ilvrdl vr) { int vr_ost = vr.gtbytost(this); ILTyp vr_typ = vr.gttyp(); Lotion rsult_lotion = llotrg(vr_typ); mitop("movl", ptrostoprn(fp, vr_ost), rgoprn(rsult_lotion)); rturn rsult_lotion; 5
6 Continu An Exmpl X86 Trgt mit mtho voi mitvrassign(ilvrdl vr, Lotion rhs_lotion) { int vr_ost = vr.gtbytost(this); mitop("movl", rgoprn(rhs_lotion), ptrostoprn(fp, vr_ost)); String ptrostoprn(lotion, int): rturn th sm syntx or rrn to "ptr + ost" mmory lotion voi mitassign(ilassignlexpr lhs, ILExpr rhs) { Lotion rhs_lotion = rhs.ogn(this); lhs.ognassign(rhs_lotion, this); llotrg(rhs_lotion); Eh ILAssignlExpr implmnts ognassign invoks pproprit mitassign oprtion,.g. mitvrassign CSE401 Au08 31 Gnrtion or Comprisons Wht o to gnrt or rg1 <.int rg2 MIPS: us n slt instrution to omput oolnvlu int rsult into rgistr x86 (n most othr mhins): no irt instrution Hv omprison instrutions, whih st onition os.g. mpl %rg2, %rg1 Ltr onitionl rnh instrutions n tst onition os.g. jl, jl, jg, jg, j, jn ll Wht instrutions to gnrt? Gnrtion or Comprs Lotion mitintlssthnvlu(ilexpr rg1,ilexpr rg2) { Lotion rg1_lotion=rg1.ogn(this); Lotion rg2_lotion=rg2.ogn(this); mitop("mpl",rgoprn(rg2_lotion),); llotrg(rg1_lotion); Lotion rsult_lotion = llotrg(iltyp.intiltyp()); String tru_ll = gtnwll(); mitop("jl", tru_ll); mitop("movl", intoprn(0),rgoprn(rsult_lotion)); String on_ll = gtnwll(); mitop("jmp", on_ll); mitll(tru_ll); mitop("movl", intoprn(1),rgoprn(rsult_lotion)); mitll(on_ll); rturn rsult_lotion; Gnrtion or Brnh Gnrtion or Brnh Wht o to gnrt or itru tst goto ll voi mitconitionlbrnhtru(ilexpr tst,illltrgt){ Lotion tst_lotion=tst.ogn(this); mitop("mpl", intoprn(0), rgoprn(tst_lotion)); mitop("jn", trgt.gtnm()); Wht is gnrt or itru rg1 <.int rg2 goto ll <mit rg1 into %rg1> <mit rg2 into %rg2> mpl %rg2, %rg1 jl tru_ll movl $0, %rs jmp on_ll tru_ll: movl $1, %rs on_ll: mpl $0, %rs jn ll Cn w o ttr? 6
7 Optimiz Brnhs I: ooln-vlu IL xprssions n gnrt two wys, pning on thir onsuming ontxt or thir vlu or or thir onition o Existing o gn oprtion on IL xprssion prous its vlu Nw ogntst oprtion on IL xprssion prous its onition o X86ComprisonRsultLotion rprsnts this rsult Now onitionl rnhs n vlut thir tst xprssion in th "or onition o" styl Optimiz Brnhs voi mitconitionlbrnhtru(ilexpr tst, ILLltrgt){ Lotion tst_lotion=tst.ogn(this); X86ComprisonRsultLo = (X86ComprisonRsultLo) tst_lotion; mitop("j" +.rnhtruop(), trgt.gtnm()); IL ogntst Dult Bhvior lss ILExpr xtns ILExpr {... Lotion ogntst(trgt trgt) { rturn trgt.mittst(this); In X86Trgt lss: Lotion mittst(ilexpr rg) { Lotion rg_lotion = rg.ogn(this); mitop("mpl", intoprn(0), rgoprn(rg_lotion)); llotrg(rg_lotion); rturn nw X86ComprisonRsultLo("n"); IL ogntst Spiliz Bhvior lss ILIntLssThnExpr xtns ILExpr { Lotion ogntst(trgt trgt) { rturn trgt.mitintlssthntst(rg1, rg2); In X86Trgt lss: Lotion mitintlssthntst(ilexpr rg1,ilexpr rg2) { Lotion rg1_lotion=rg1.ogn(this); Lotion rg2_lotion=rg2.ogn(this); mitop("mpl",rgoprn(rg2_lotion), ); llotrg(rg1_lotion); rturn nw X86ComprisonRsultLo("l"); Rgistr Allotion: Cool Algorithm Bgin With Dt Flow Grph How to onvrt th ininit squn o tmporry t rrns, t1, t2, into init ssignmnt rgistr numrs $8, $9,, $25 Gol: Us vill rgistrs with minimum spilling Prolm: Minimizing th numr o rgistrs is NPomplt it is quivlnt to hromti numr-- minimum olors to olor nos o grph so no g onnts sm olor prour-wi rgistr llotion only liv vrils rquir rgistr storg tlow nlysis: vril is liv t no N i th vlu it hols is us on som pth urthr own th ontrol-low grph; othrwis it is two vrils(vlus) intrr whn thir liv rngs ovrlp 7
8 Liv Vril Anlysis Rgistr Intrrn Grph := +8; print(); := r(); := r(); := r(); := + *; < 10 print(); := 10; := + ; print(); := r(); := r(); := r(); := + *; i ( < 10 ) thn := +8; print(); ls := 10; := + ; print(); i print(); := +8; print(); := r(); := r(); := r(); := + *; < 10 print(); := 10; := + ; print(); Grph Coloring Apply Huristi NP omplt prolm Huristi: olor sy nos lst in no N with lowst gr rmov N rom th grph olor th simplii grph st olor o N to th irst olor tht is not us y ny o N s nighors Bsis u to Chitin (1982) Apply Huristi Apply Huristi 8
9 9 Continu Continu Continu Continu Continu Continu
10 Continu Finl Assignmnt := r(); := r(); := r(); := + *; i ( < 10 ) thn := +8; print(); ls := 10; := + ; print(); i print(); Wht is th O(running tim)? Aptl? Exmpl: or smll groups { int tmp_2 = 2**; int tmp_ = *; int tmp_ = *; x := tmp_ + tmp_2 + tmp_; y := tmp_ - tmp_2 + tmp_; givn tht n r liv on ntry n on xit, n tht x n y r liv on xit: () onstrut th rgistr intrrn grph () olor th grph; how mny rgistrs r n? CSE401 Au Rgistrs N Co Gnrtion Summry tmp_2 tmp_ x tmp_ y Co gnrtion is Mhin spii Error pron Lst lgnt o th ompiltion pross Co gnrtion is Pl whr ky trnsormtion tks pl in th ompilr Most visil impt on prormn 10
11 Gnrtion to Optimiztion: t-low Snsitivity Th t-low nlysis skth or rgistr llotion vi oloring givs l or mny o th thniqus t th sis o optimiztion Dt-low nlysis gthrs inormtion out th possil st o vlus lult t vrious points in progrm, using ontrollow grph (CFG) rprsnttion Dt-low nlysis usully works y stting up tlow qutions or th CFG no, solving ths qutions y rhing ixpoint Du to Killl (1973) UW CSE PhD #7 (1972) Dt-low nlysis is low-snsitiv th orr o sttmnt in th CFG mttrs But lmost lwys pth-insnsitiv osn t onsir th vlus o prits t onitionls Cn ontxt-snsitiv tht is, som nlyss r out whih lling ontxt ours CSE401 Au08 61 CSE401 Au08 62 Forwr t-low Th lssi xmpl o t-low nlysis is rhing initions whih initions my rh givn point in th o Dtlow qutions or h lok in CFG Rh in [S] = p pr(s) Rh out [p] Rh out [S] = Gn[S] (Rh in [S] Kill [S]) N Gn[: y is ssign] = { Kill[: y is ssign] = Ds[y] { Ds[y] is th st o initions tht ssign to y CSE401 Au08 63 Boring Exmpl (wikipi) 1: i ==4 thn 2: = 5; 3: ls 4: = 3; 5: ni 6: 7: i < 4 thn 8:... CSE401 Au08 64 Anothr xmpl: rom Stnor w B0 D0: y = 3 D1: x = 10 D2: y = 11 I D3: x = 1 D4: y = 2 B1 D5: z = x D6: x = 4 B2 For ll s Ssgn, s Sllo, s Sntry, i I : [JOIN] Rs( s) i = Fs pr(s) Rs(s ) i [TRANSF] Rs(s ) i = Fi I ([[s]](ρ, (i, Rs( s) i))) i [ALLOC] Rs(s ) i h, whr [[s]]gn(ρ) = (i, h) [ENTRY] Rs( s) i o i CSE401 Au08 65 CSE401 Au
12 CSE401 Au
Lecture Outline. Memory Hierarchy Management. Register Allocation. Register Allocation. Lecture 19. Cache Management. The Memory Hierarchy
Ltur Outlin Mmory Hirrhy Mngmnt Rgistr Allotion Ltur 19 Rgistr Allotion Rgistr intrrn grph Grph oloring huristis Spilling Ch Mngmnt Pro. Boik CS 164 Ltur 17 1 Pro. Boik CS 164 Ltur 17 2 Th Mmory Hirrhy
More informationGlobal Register Allocation
Ltur Outlin Glol Rgistr Allotion Mmory Hirrhy Mngmnt Rgistr Allotion vi Grph Coloring Rgistr intrrn grph Grph oloring huristis Spilling Ch Mngmnt 2 Th Mmory Hirrhy Rgistrs 1 yl 256-8000 yts Ch 3 yls 256k-16M
More informationHistory Rgistr Allotion Exmpl As ol s intrmit o Consir this progrm with six vrils: := + := + := - 1 Us in th originl FORTRAN ompilr (1950 s) Vry ru lg
Th Mmory Hirrhy Avn Compilrs CMPSCI 710 Spring 2003 Highr = smllr, str, losr to CPU A rl sktop mhin (min) Rgistr Allotion Emry Brgr rgistrs 8 intgr, 8 loting-point; 1-yl ltny L1 h 8K t & instrutions; 2-yl
More informationLecture Outline. Memory Hierarchy Management. Register Allocation. Register Allocation. Lecture 38. Cache Management. Managing the Memory Hierarchy
Ltur Outlin Mmory Hirrhy Mngmnt Rgistr Allotion Ltu8 (rom nots y G. Nul n R. Boik) Rgistr Allotion Rgistr intrrn grph Grph oloring huristis Spilling Ch Mngmnt 4/27/08 Pro. Hilingr CS164 Ltu8 1 4/27/08
More informationCSE P 501 Compilers. Register Allocation Hal Perkins Spring UW CSE P 501 Spring 2018 P-1
CSE P 501 Compilrs Rgistr Allotion Hl Prkins Spring 2018 UW CSE P 501 Spring 2018 P-1 Agn Rgistr llotion onstrints Lol mthos Fstr ompil, slowr o, ut goo nough or lots o things (JITs, ) Glol llotion rgistr
More informationReachability. Directed DFS. Strong Connectivity Algorithm. Strong Connectivity. DFS tree rooted at v: vertices reachable from v via directed paths
irt Grphs OR SFO FW LX JFK MI OS irph is rph whos s r ll irt Short or irt rph pplitions on-wy strts lihts tsk shulin irphs ( 12.) irt Grphs 1 irt Grphs 2 irph Proprtis rph G=(V,) suh tht h os in on irtion:
More informationCSE 401/M501 Compilers
CSE 401/M501 Compilrs Compilr Bckn Survy Hl Prkins Spring 2018 UW CSE 401/M501 Spring 2018 Q-1 Aministrivi Compilr projct: floting-point u tomorrow (plus lt ys if you hv thm); short rport u Stury night
More informationReview: Binary Trees. CSCI 262 Data Structures. Search Trees. In Order Traversal. Binary Search Trees 4/10/2018. Review: Binary Tree Implementation
Rviw: Binry Trs CSCI 262 Dt Struturs 21 Binry Srh Trs A inry tr is in rursivly: = or A inry tr is (mpty) root no with lt hil n riht hil, h o whih is inry tr. Rviw: Binry Tr Implmnttion Just ollow th rursiv
More informationLecture 39: Register Allocation. The Memory Hierarchy. The Register Allocation Problem. Managing the Memory Hierarchy
Ltur 39: Rgistr Alloation [Aapt rom nots y R. Boik an G. Nula] Topis: Mmory Hirarhy Managmnt Rgistr Alloation: Rgistr intrrn graph Graph oloring huristis Spilling Cah Managmnt Th Mmory Hirarhy Computrs
More informationFinding a Funicular Curve Through Two Points
This is th glss pyrmi t th Louvr Musum in Pris, sign y rhitt I.M. Pi. It is support from nth y stl ls. In signing strutur suh s this, it is oftn most usful to slt l of rtin siz n tnsil strngth, n thn to
More informationCS 331: Artificial Intelligence Bayesian Networks (Inference) Inference
S 331: rtificil Intllignc ysin Ntworks Infrnc 1 Infrnc Suppos you r givn ysin ntwork with th grph structur n th prmtrs ll figur out Now you woul lik to us it to o infrnc You n infrnc to mk prictions or
More informationCompiling: Examples and Sample Problems
REs for Kywors Compiling: Exmpls n mpl Prolms IC312 Mchin-Lvl n ystms Progrmming Hnri Csnov (hnric@hwii.u) It is sy to fin RE tht scris ll kywors Ky = if ls for whil int.. Ths cn split in groups if n Kywor
More informationOutline. Graphs Describing Precedence. Graphs Describing Precedence. Topological SorFng of DAGs. Graphs Describing Precedence 4/25/12. Part 10.
4// Outlin Prt. Grphs CS Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits Grphs Dsriing Prn Grphs Dsriing
More informationCS553 Lecture Introduction to Data-flow Analysis 1
! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow
More informationInterference graph. Register Allocation. A bigger example. Units of allocation
Rgistr Alloation Intrfrn graph Th prolm: assign mahin rsours (rgistrs, stak loations) to hol run-tim ata Constraint: simultanously liv ata alloat to iffrnt loations Goal: minimiz ovrha of stak loas & stors
More informationCS453 INTRODUCTION TO DATAFLOW ANALYSIS
CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register
More informationWORKSHOP 2 Solid Shell Composites Modeling
WORKSHOP 2 Soli Shll Composits Moling WS2-1 WS2-2 Workshop Ojtivs Bom fmilir with stting up soli omposit shll mol Softwr Vrsion Ptrn 2011 MD Nstrn 2011.1 Fils Rquir soli_shll. WS2-3 Prolm Dsription Simult
More informationCharacteristics of Fault Simulation. Fault Simulation Techniques. Parallel Fault Simulation. Parallel Fault Simulation
Chrtristis o Fult Simultion Fult tivity with rspt to ult-r iruit is otn sprs oth in tim n sp. For mpl F is not tivt y th givn pttrn, whil F2 ts only th lowr prt o this iruit. Fult Simultion Thniqus Prlll
More information1⅝" - 3¾" (40-95mm) FIXTURE BASE. 3/4" (19mm) 4" - 6¾" ( mm) ALLEN KEY (INCLUDED)
PG: 1 O 7 IMPORTNT - R RULLY OR INSTLLING IXTUR. RTIN THS INSTRUTIONS OR UTUR RRN. THIS PROUT MUST INSTLL IN ORN WITH TH NTIONL LTRIL O N LL PPLIL LOL OS, Y PRSON MILIR WITH TH ONSTRUTION N OPRTION O TH
More informationStore Tours Washington DC
Things To Look For: Th Customr Journy == Entrn == Cln n inviting? Opning hours post? Wht o you noti vn for you ntr? == First Imprssion == Lighting? Musi plying? Dos th stor fl wloming? Dos somon grt you
More informationRegister Allocation. Register Allocation
Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:
More informationWORKSHOP 17 BOX BEAM WITH TRANSIENT LOAD
WORKSHOP 17 BOX BEAM WITH TRANSIENT LOAD WS17-1 WS17-2 Workshop Ojtivs Prform mol nlysis for linr ynmi mol. Also, prform linr trnsint nlysis for th mol. Viw th shp of th mol ovr tim. Crt n X vs Y plot
More informationTiling the plane with equilateral convex pentagons
Prol Volum 52, Issu 3 (2016) Tiling th pln with quiltrl onvx pntgons Mri Fishr 1 Mthmtiins n non-mthmtiins hv n onrn with fining pntgonl tilings for lmost 100 yrs, yt tiling th pln with onvx pntgons rmins
More informationPortability, Scalability, and Numerical Stability in Accelerated Kernels
Portility, Slility, nd Numril Stility in Alrtd Krnls John Strtton Dotorl Cndidt: Univrsity of Illinois t Urn-Chmpign Snior Arhitt: MultiorWr In Outlin Prformn Portility Wht CPU progrmmrs nd to lrn from
More informationGreedy Algorithm. Algorithm Fall Semester
Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion
More informationALASKA RAILROAD CORPORATION
LSK RI LRO ORPORT ION LSK R I LRO ORPORT ION LSK RILRO ORPORTION NGINRING SRVIS P.O. OX 107500, NHORG, LSK 99510-7500 SPN RPLMNT PORTG, K PROJT : SPN RPLMNT TITL PG TL OF ONTNTS 1 14 U:\\eng-projects\ridges\R
More informationGraph Theory & Applications. Boundaries Using Graphs. Graph Search. Find the route that minimizes. cost
Graph Thory & Appliations Bounaris Using Graphs 3 4 3 4 5 Fin th rout that minimizs osts Fin th ritial path in a projt Fin th optimal borr aroun a rgion Fin loop an no quations or analog iruit analysis
More informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationCMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationSoftware Pipelining Can we decrease the latency? Goal of SP Lecture. Seth Copen Goldstein Software Pipelining
5-4 Ltur 5-745 Sotwr Piplinin Copyrit St Copn Goltin -8 Sotwr Piplinin Sotwr piplinin i n IS tniqu tt rorr t intrution in loop. Poily movin intrution rom on itrtion to t prviou or t nxt itrtion. Vry lr
More informationcisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:
cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles
More informationISO VIEW COVER, EXPRESS EXIT 4X4 FLIP COVER OPEN VIEW EXPRESS EXIT ON TROUGH VIEW
RV MO WN T 00899MO OVL 07-JN-5 0078MO HUH 7-SP-5 5.90 RF.87 RF.000 RF ISO VIW SL OVR, 0.50 OVR XTNSION X FLIP OVR FGS-MX-- (NOT INLU IN KIT).07 RF 7.7 RF FLIP OVR OPN VIW SL X STRIGHT STION RF RKT, XPRSS
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml
More informationS675, S750 Stretchair Parts List A D
Page of 7 F G PRTS LIST Number Part Number escription M675-038 STR, 6" NTRL LOKING, TOTL LK TWIN WHL M675-04 STR, 6" NTRL LOKING, IR LK, TWIN WHL S-HX-ZP-M6-0 SRW, HX H, M6 X 0 MM LG 4 W-LI-ZP-5-47-03
More informationVAT GX - IP VIDEO FIELD ADD-ON/RETROFIT SINGLE CHANNEL ENCODER
L00 LL -800-999-600 VT GX - IP VIDO ILD DD-ON/RTROIT SINGL HNNL NODR NTWORK ONNTORS SING: MTRIL: P + BS X7240 OLOR: DRK BLU SUSTINBILITY: MMORY: PV R 256 MB RM, 256 MB LSH BTTRY BKD- RL TIM LOK POWR: POWR
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
More informationOverview Linear Algebra Review Linear Algebra Review. What is a Matrix? Additional Resources. Basic Operations.
Oriw Ro Jnow Mon, Sptmr 2, 24 si mtri oprtions (, -, *) Cross n ot prouts Dtrminnts n inrss Homonous oorints Ortonorml sis itionl Rsours 8.6 Tt ook 6.837 Tt ook 6.837-stff@rpis.sil.mit.u Ck t ours wsit
More informationVAT GX - IP VIDEO FIELD ADD-ON/RETROFIT SPECIFICATIONS PERSPECTIVE SIDE VIEW MOUNTING CONNECTIONS CALL SINGLE CHANNEL ENCODER
VT GX - IP VIDO ILD DD-ON/RTROIT L00 LL -800-999-600 SINGL HNNL NODR SPIITIONS NTWORK ONNTORS SING: MTRIL: P + BS X7240 OLOR: DRK BLU DIMNSIONS IN MILLIMTRS (DIMNSIONS IN INHS) SUSTINBILITY: MMORY: PV
More informationMERGE-BASED SpMV PERFECT WORKLOAD BALANCE. GUARANTEED. Duane Merrill, NVIDIA Research
MERGE-BASED SpMV PERFECT WORKLOAD BALANCE. GUARANTEED. Dun Mrrill, NVIDIA Rsr SPARSE MATRIX-VECTOR MULTIPLICATION SpMV (Ax = y) -- -- -- -- -- -- -- -- * = 2.0 0.0 2.0 4.0 sprs mtrix A ns vtor x ns vtor
More informationDistance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
More informationGENG2140 Modelling and Computer Analysis for Engineers
GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points
More informationPartitioning a Polygon into Two Mirror Congruent Pieces
rtitioning olygon into Two Mirror Congrunt is Dni El-Khhn Thoms Fvns John Iono 1 Introution olygon omposition prolms r wll stui in th litrtur [6], yt mny vrints o ths prolms rmin opn. In this ppr, w r
More informationV = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
More informationMinimal Memory Abstractions
Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationCCD Color Camera. KP-HD20A/KP-HD1001/5 Series. Remote control protocol Specifications. (preliminary version)
olor amera KP-H20/KP-H01/5 Series Remote control protocol Specifications (preliminary version) Hitachi Kokusai lectric Inc. MOL SIGN HK - Sep.11.9 (first edition) Hirayama Hirayama SYMOL T SRIPTION (RWN)
More informationInternet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.
omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to
More informationType Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables
Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil
More informationBelow, are instructions about how to set each goal and report achievements in Your Club, Service, and Foundation Giving.
Rotry Clu Cntrl is n onlin tool to hlp lus st nd trk lu gols nd hivmnts. This rfrn guid outlins th stps you nd to tk to st nd dit gols s wll s rport hivmnts in Rotry Clu Cntrl. If ny dt is displyd inorrtly,
More informationAPPLICATION NOTE VACUUM FLUORESCENT DISPLAY MODULE GRAPHIC DISPLAY MODULE GP1157A01B
N--3225 PPLITION NOT VUUM LUORSNT ISPLY MOUL GRPHI ISPLY MOUL GP115701 GNRL SRIPTION UT GP115701 is a graphic display module using a UT 256 64 V. onsisting of a V, display drivers and a control circuit,
More informationLesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
More informationSJ QUINNEY COLLEGE OF LAW
W 1 2 3 4 5 MRGNY ISTRIUTION 1000X LV. MHIN 1000W 1000V RWY 1000U ORRIOR- 1000Y HIGH TMP VULT 1000T PNTRY 1530 XRIS 1520 XTRIOR IK (34) 1010L LG & GROUNS STG 1010K MHNIL 1010J MIN L 1010G RSSING /SHOWR
More informationTYPICAL RAISED POSITION
UPPR 1. TH LOTION OF RMP LOSUR GTS ND MOUNTING HIGHT OF PIVOT SHLL VRIFID Y TH NGINR.. HIGHT OF GUIDS MY VRID S RQUIRD FOR WRNING LIGHT LRN. 3. FIRGLSS/LUMINUM ND SHLL SUPPLID Y TH SM VNDOR. 4. TO MOUNTD
More informationQuadrilateral Decomposition by Two-Ear Property Resulting in CAD Segmentation
Quriltrl Domposition y wo-er Proprty Rsulting in CAD Sgmnttion Mhrvo Rnrinrivony Astrt W minly im t splitting simply onnt polygon into st o onvx quriltrls without insrting nw ounry nos. Our pproh is s
More informationEE 231 Fall EE 231 Homework 10 Due November 5, 2010
EE 23 Fall 2 EE 23 Homwork Du Novmbr 5, 2. Dsign a synhronous squntial iruit whih gnrats th following squn. (Th squn should rpat itslf.) (a) Draw a stat transition diagram for th iruit. This is a systm
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationEnterprise Digital Signage Create a New Sign
Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their
More informationCMST 220 PUBLIC SPEAKING
MST 220 PUBLI SPKING R G. MTZGR, INSTRUTOR OI: RINIR 213 PHON: 253-964-6659 fmetzger@pierce.ctc.edu O V R V I W PUBLI SPKING IS N OPPORTUNITY TO LOOK GOO IN RONT O POPL. LL YOUR LI YOUR SPH WILL HLP YOU
More informationCustomer documentation
SAP Printing: Customr oumnttion: Volum 1 pg 1 / 14 SAP Printing Customr oumnttion Volum 1 RM: Support y Rioh Vrsion: 1.49 Astrt: This oumnt ontins irst-stp inormtion out support y Rioh or printing rom
More informationVirtual Machine (Part I)
Hrvrd University CS Fll 2, Shimon Schocken Virtul Mchine (Prt I) Elements of Computing Systems Virtul Mchine I (Ch. 7) Motivtion clss clss Min Min sttic sttic x; x; function function void void min() min()
More informationCS 430 Spring Mike Lam, Professor. Parsing
CS 430 Spring 2015 Mike Lm, Professor Prsing Syntx Anlysis We cn now formlly descrie lnguge's syntx Using regulr expressions nd BNF grmmrs How does tht help us? Syntx Anlysis We cn now formlly descrie
More informationCS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08
CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008
More informationReading. K-D Trees and Quad Trees. Geometric Data Structures. k-d Trees. Range Queries. Nearest Neighbor Search. Chapter 12.6
Rn Cptr 12.6 K-D Trs n Qu Trs CSE 326 Dt Struturs Ltur 9 2/2/05 K-D Trs n Qu Trs - Ltur 9 2 Gomtr Dt Struturs Ornzton o ponts, lns, plns, to support str prossn Appltons Astropsl smulton voluton o ls Grps
More informationWORKSHOP 12 ANCHOR LOADS AND BOUNDARY CONDITIONS USING A FIELD
WORKSHOP 12 ANCHOR LOADS AND BOUNDARY CONDITIONS USING A FIELD WS12-1 WS12-2 Workshop Ojtivs Using fil for prssur loing, n rting onstrints t th lotions for wshrs Prolm Dsription Crt fil with th sin funtion,
More informationCS153: Compilers Lecture 20: Register Allocation I
CS153: Copilrs Ltur 20: Ristr Alloation I Stpn Con ttps://www.sas.arvar.u/ourss/s153 Pr-lass Puzzl Wat s t iniu nur o olors n to olor a ap o t USA? Evry stat is assin on olor Aant stats ust ivn irnt olors
More informationProduct Update Harsh Environment USB MUSB CONNECTOR SERIES
Product Update Harsh nvironment US MUS ONNTOR SRIS bout mphenol ommercial Products mphenol s ommercial onnector Products are used in a variety of end user applications including Networking, Telecom, Server
More informationHSHM-H110AX-5CPX HSHM-H105BX-5CPX TYPE B21, 105 SIGNAL CONTACTS HSHM-HXXXXXX-5CPX-XXXXX
M TM HSHM PRSS-FIT HR, -ROW, HSHM SRIS FOR HIGH SP HR MTRI PPLITIONS * UP TO Gb/s T RTS * LOW ROSSTLK T HIGH FRQUNIS * / (SINGL-N/IFFRNTIL) IMPN * MOULR/SLL FORMT I -- * MT LINS PR INH * SHIPS WITH PROTTIV
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationParadigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms
Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History
More informationClass Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414
Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationPerformance, Scalability, and Numerical Stability of Manycore. Wen-mei Hwu University of Illinois at Urbana-Champaign
Prformn, Slility, nd Numril Stility of Mnyor Algorithms Wn-mi Hwu Univrsity of Illinois t Urn-Chmpign Cry XE6 Nods Blu Wtrs ontins,64 Cry XE6 omput nods. Dul-sokt Nod Two AMD Intrlgos hips 6 or moduls,
More informationOutline. Tiling, formally. Expression tile as rule. Statement tiles as rules. Function calls. CS 412 Introduction to Compilers
CS 412 Introduction to Compilers Andrew Myers Cornell University Lectur8 Finishing genertion 9 Mr 01 Outline Tiling s syntx-directed trnsltion Implementing function clls Implementing functions Optimizing
More informationCS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
More informationOutline CS 412/413. Function calls. Stack layout. Tiling a call. Two translations
CS 412/413 Introduction to Compilers nd Trnsltors Cornell University Andrew Myers Outline Implementing function clls Implementing functions Optimizing wy the pointer Dynmiclly-llocted structures strings
More informationIn order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.
XML: Mnging with th Jv Pltform In ordr to lrn whih qustions hv n nswrd orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Snd this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationCONVEX POLYGONS FOR APERIODIC TILING
Rsrh n ommunitions in Mthmtis n Mthmtil Sins Vol. 8, Issu 1, 2017, Pgs 69-79 ISSN 2319-6939 Pulish Onlin on Sptmr 7, 2017 2017 Jyoti Ami Prss http://jyotimiprss.org ONVX POLYGONS FOR APRIOI TILING TRUHISA
More informationPrinciples of Programming Languages Topic: Formal Languages II
Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas
More informationCS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over
More informationModel Intelli-INCH. Miniature Stepper Motor Controllers/Drivers. Electrical Specifications. Models. Key Features. i/o connector, Intelli-inch-lr
Model Intelli-INH lectrical Specifications Supply Input 9V to 30V 1 xamples: igikey part 271-2446 or 62-1068 imensions 1 X 1 (254mm X 254mm) square Step Resolution 1/16 microstep Operating Modes Standalone
More informationToday. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.
CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationProduct Update Harsh Environment RJ45 MRJ CONNECTOR SERIES
Product Update Harsh nvironment RJ45 MRJ ONNTOR SRIS bout mphenol ommercial Products mphenol s ommercial onnector Products are used in a variety of end user applications including Networking, Telecom,
More informationLexical Analysis: Constructing a Scanner from Regular Expressions
Lexicl Anlysis: Constructing Scnner from Regulr Expressions Gol Show how to construct FA to recognize ny RE This Lecture Convert RE to n nondeterministic finite utomton (NFA) Use Thompson s construction
More informationWORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS
WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of
More informationET (mm/d), mean, SCEN-CTL
a T M (K), man, SCEN-CTL 8 7 6 4 - - - -4 - -6-7 -8 T M (K), stv, SCEN-CTL..8.6.4. -. -.4 -.6 -.8 - -. SM (mm), man, SCEN-CTL 7 - - -7 - - - - SM (mm), stv, SCEN-CTL - - - - - - P (mm/), man, SCEN-CTL...7..
More informationMath 227 Problem Set V Solutions. f ds =
Mth 7 Problem Set V Solutions If is urve with prmetriztion r(t), t b, then we define the line integrl f ds b f ( r(t) ) dr dt (t) dt. Evlute the line integrl f(x,y,z)ds for () f(x,y,z) xosz, the urve with
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More information8.3 INTEGRATION BY PARTS
8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
More informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationFEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.
Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationUNSIGNED HARDCOPY NOT CONTROLLED
UNSIN ROPY NOT ONTROLL ardware ngineering No. LMS -0 Subject: PPROV Y STTUS PURPOS Manager, ardware ngineering Maintenance Revision efines the requirements for electrical connector keying. Two areas are
More informationDemand-Driven Context-Sensitive Alias Analysis for Java
Demnd-Driven Context-Sensitive Alis Anlysis or Jv Dcong (Tony) Yn Guoqing (Hrry) Xu Atns Rountev Ohio Stte University PRESTO: Progrm Anlyses nd Sotwre Tools Reserch Group, Ohio Stte University Alis Anlysis
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationCOSC 6374 Parallel Computation. Dense Matrix Operations
COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More information