CMSC 430, Practice Problems 1 (Solutions)
|
|
- Brett Dean
- 6 years ago
- Views:
Transcription
1 CMC 430, Prtie Problems 1 olutios) 1. Cosider the followig grmmr: d or ) true flse. Compute First sets for eh produtio d otermil FIRTtrue) = { true } FIRTflse) = { flse } FIRT ) ) = { } FIRT d ) = FIRT or ) = FIRT ) = {, true, flse } b. Expli why the grmmr ot be prsed by LL1) prser First sets of produtios iterset, grmmr is left reursive 2. Cosider the followig grmmr: b. Compute First sets for eh produtio d otermil FIRTb) = { } FIRT) = { } FIRT) = { } FIRT) = {, } b. how why the grmmr ot be prsed by LL1) prser. First sets of produtios overlp FIRTb) FIRT) = { } { } = { }. Rewrite the grmmr so it be prsed by LL1) prser. L L b 3. Cosider the followig grmmr:. how why the grmmr ot be prsed by preditive prser. First sets of produtios iterset, grmmr is left reursive b. Rewrite the grmmr so it be prsed by preditive prser. L L L L ε. Usig FIRT d FOLLOW, build the LL1) tble for the ew grmmr FIRT L ε) = FOLLOWL) = {$} $ L L L L L L L ε d. Usig the LL1) tble, show how tble-drive prser prses the strig tk Iput tio [$, ] $ L, pop push L [$, L, ] $ ext iput pop [$, L] $ L L, pop L push L [$, L, ] $ ext iput pop [$, L] $ L L, pop L push L [$, L, ] $ ext iput pop [$, L] $ L L, pop L push L [$, L, ] $ ext iput pop [$, L] $ L ε, pop L [$] $ ept
2 4. Cosider the followig grmmr Gol Expr Expr Term Expr Term Expr Term Term Ftor Term Ftor / Term Ftor Ftor um id. pply left ftorig to rete LL1) grmmr b. Compute FIRT d FOLLOW for the modified grmmr Left Ftored Grmmr FIRT FOLLOW Produtios Notermils Gol Expr { um, id } Gol { um, id } { $ } Expr Term Expr { um, id } Expr { um, id } { $ } Expr Expr { } Expr {, -, ε } { $ } Expr { } Term { um, id } {, -, $ } ε { ε } Term {, /, ε } {, -, $ } Term Ftor Term { um, id } Ftor { um, id } {, /,, -, $ } Term Term { } / Term { / } ε { ε } Ftor um { um } id { id }. Usig FIRT d FOLLOW, build the LL1) tble for the ew grmmr um id - / $ Gol Expr Gol Expr Expr Term Expr Gol Expr Expr Term Expr Expr Expr Expr Expr - Expr Expr ε Term Term Ftor Term Term Ftor Term Term Term ε Term ε Term Term Term / Term Term ε Ftor Ftor um Ftor id
3 5. ottom up prsig. Desribe the differee betwee bottom-up d top-dow prsig with respet to grmmr produtio β ottom up prsers perform redutios of β to, while top-dow prsers perform expsios of to β. b. Defie hdle The right-hd side of the ext produtio to be redued i the rightmost derivtio, d its positio i the urret setetil form.. Expli why bottom-up prsers result i right-most derivtios i reverse. euse iput is proessed from left to right d uproessed iput is omposed oly of termils, right-most derivtio is used so the setetil form to the right of the hdle is omposed etirely of termils. d. Give the followig CTION/GOTO tble, perform prse of, ssumig 0 is the strt stte. how the otets of the stk, remiig iput, d tio performed t eh step of the shift-redue prse. 6. LR prsig. Wht is the oil set of LRk) items for grmmr? determiisti fiite utomto DF) for reogizig hdles right-hd sides of produtios) for the grmmr. b. Wht re CTION/GOTO tbles of LRk) prser for grmmr? Tbles eodig the DF for reogizig hdles for the grmmr.. Give LRk) item [ α γ, δ] from produtio β, desribe the role of, α, γ, δ is the otermil tht is potetilly the result of redutio. α is the portio of β tht the prser hs just see. γ is the portio of β the prser will eed to see before performig the redutio to. δ is k termils tht must be the k lookheds for the redutio to be performed.
4 d. Give LRk) item [ α γ, δ], wht lookhed llows shift to be performed igorig y other LRk) items dded to the stte by losure)? The termil t the begiig of γ. e. Give LRk) item [ α γ, δ], wht LRk) items must be dded to the losure? y produtio for the otermil t the begiig of γ, with t the begiig of the right-hd side of the produtio, d FIRTγ δ) s the lookhed toke, where γ is wht remis i γ fter removig the first. f. If the prser is i stte otiig LRk) item [ α γ, δ], wht must be t the top of the stk, d why? The top of the stk must be α, sie the prser just sw α. g. Desribe wht ostitutes shift/redue oflit DF stte otis both LR items llowig shift d redue for the sme lookhed. h. Give exmple of two LR1) items usig redue/redue oflit. [ α, δ] d [ α, δ] i. Expli why there re o shift/shift oflits euse o deisio eeds to be mde bout whih right-hd side of produtio is the hdle. 7. LLR prsig. Cosider the followig sets of LR1) items i the sttes of LR1) prser.. Fid ll shift/redue d redue/redue oflits. List the LR1) items d lookheds usig oflits. hift/redue oflit is used by [, ] d [, ] o lookhed i stte 2. b. Wht sttes would be merged i LLR1) prser? ttes 0 d 2.. re y ew redue/redue oflits itrodued i the LLR1) prser? /redue oflit is used by [, b] d [, b] o lookhed b i the merged stte. d. Expli why LLR1) prsers will ot itrodue ew shift/redue oflits. euse the ore of ll merged sttes must be idetil, the LR item for the shift must hve bee i ll of the sttes prior to the merge. y LR item usig redue must hve ome from some stte, d the sme shift/redue oflit would hve existed i tht stte.
5 e. Wht is the reltioship betwee LLR1) d LR1) prsers? LLR1) prsers re stritly more powerful th LR1) prsers, so y grmmr tht be prsed by LR1) prser my be prsed by LLR1) prser, but there re grmmrs tht be prsed by LLR1) prsers tht ot be prsed by LR1) prsers. 8. Cosider the followig grmmr: b. Compute FOLLOW) FOLLOW) = { $ } b. Compute the oil set of LR0) items for the grmmr tte 0 [ ] [ b] [ ] [ ] tte 1 [ ] tte 2 [ ] b tte 4 [ b ] [ b] [ ] [ ] tte 3 [ b] [ ] tte 6 [ b ] tte 5 [ ] [ b] [ ] [ ] tte 7 [ ]. uild the CTION/GOTO tble usig LR0) FOLLOW tio Goto tte b $ 0 hift 3 hift ept 2 3 hift 4 hift 5 4 hift 3 hift hift 3 hift b 7 d. Expli why the grmmr is or is ot LR1) It is LR1) sie the LR1) CTION/GOTO tble hs o oflits.
6 e. Use the CTION/GOTO tble to prse the strig b tk Remiig Iput tio Commet $ 0 b $ hift 3 $ 0 3 b $ hift 4 $ 0 3 b 4 $ hift 2 $ 0 3 b 4 2 $ $ 0 3 b 4 $ Goto 6 Itermedite tep $ 0 3 b 4 6 $ b $ 0 $ Goto 1 Itermedite tep $ 0 1 $ ept 9. Cosider the followig grmmr:. Compute the oil set of LR1) items for the grmmr tte 0 [, $ ] [, {$,,} ] [, {$,,} ] [, {$,,} ] tte 1 [, {$,,} ] tte 2 [, $ ] [, {$,,} ] [, {$,,} ] tte 3 tte 4 [, {$,,} ] [, {$,,} ] b. uild the CTION/GOTO tble for the grmmr tio Goto tte $ 0 hift hift 3 hift 4 ept 3 4. Expli why the grmmr is or is ot LR1) It is LR1) sie the LR1) CTION/GOTO tble hs o oflits.
7 d. Use the CTION/GOTO tble to prse the strig tk Remiig Iput tio Commet $ 0 $ hift 1 $ 0 1 $ $ 0 $ Goto 2 Itermedite tep $ 0 2 $ hift 3 $ $ $ 0 $ Goto 2 Itermedite tep $ 0 2 $ hift 4 $ $ $ 0 $ Goto 2 Itermedite tep $ 0 2 $ hift 3 $ $ $ 0 $ Goto 2 Itermedite tep $ 0 2 $ ept 10. Cosider the followig grmmr: ) um. Compute the oil set of LR1) items for the grmmr tte 3 [, $ ] [, {$,,} ] [, {$,,} ] tte 1 [, {$,,}] tte 14 [, {$,,} ] [, {$,,} ] [, {$,,} ] [ ), {$,,} ] [, {$,,} ] tte 15 [, {$,,} ] [, {$,,} ] [, {$,,} ] [ ), {$,,} ] [, {$,,} ] tte 16 [, {$,,} ] [, {$,,} ] [, {$,,} ] tte 17 [, {$,,} ] [, {$,,} ] [, {$,,} ] tte 8 [ ), { ),,} ] [, { ),,} ] [, { ),,} ] ) tte 9 [ ), { ),,} ] tte 0 [, $ ] [, {$,,} ] [, {$,,} ] [ ), {$,,} ] [, {$,,} ] tte 6 [ ), { ),,} ] [, { ),,} ] tte 2 [, { ),,} ] [ ), { $,,} ] [ ), { ),,} ] [, { ),,} ] [, { ),,} ] [, { ),,} ] [ ), { ),,} ] [, { ),,} ] tte 4 [, { ),,} ] tte 5 [ ), {$,,} ] [, { ),,} ] [, { ),,} ] ) tte 7 [ ), {$,,} ] tte 10 [, { ),,} ] [, { ),,} ] [, { ),,} ] [ ), { ),,} ] [, { ),,} ] tte 11 [, { ),,} ] [, { ),,} ] [, { ),,} ] [ ), { ),,} ] [, { ),,} ] tte 12 [, { ),,} ] [, { ),,} ] [, { ),,} ] tte 13 [, { ),,} ] [, { ),,} ] [, { ),,} ]
8 uild the CTION/GOTO tble for the grmmr tio Goto tte ) um $ 0 hift 2 hift um um um 2 hift 6 hift hift 14 hift 15 ept 4 um um um 5 hift 10 hift 11 hift 7 6 hift 6 hift ) ) ) 8 hift 10 hift 11 hift 9 9 ) ) ) 10 hift 6 hift hift 6 hift hift 10 hift hift 10 hift hift 2 hift hift 2 hift hift 14 hift hift 14 hift 15 b. Expli why the grmmr is or is ot LR1) It is ot LR1) beuse there re shift/redue oflits i sttes 16 & 17 d 12 & 13) for lookhed d.
9 . Expli how to use the CTION/GOTO tble so tht Lookhed tte o left or shift o right oto stk? Depeds o ssoitivity of shift if right sso, redue if left) 16 o stk 17 o stk o left or shift o right oto stk? Depeds o preedee of vs shift if >, redue if < ) o left or shift o right oto stk? Depeds o preedee of vs shift if >, redue if < ) o left or shift o right oto stk? Depeds o ssoitivity of shift if right sso, redue if left) i. hs higher preedee th d, re both left ssoitive Resolve the shift/redue oflits s follows sme for 12 & 13).. Lookhed tte 16 hift ii. hs higher preedee th, is left ssoitive, d is right ssoitive Resolve the shift/redue oflits s follows sme for 12 & 13).. Lookhed tte 16 hift 14 hift iii. hs higher preedee th d, re both right ssoitive Resolve the shift/redue oflits s follows sme for 12 & 13). Lookhed tte 16 hift hift 14 hift Cosider the followig grmmr: b. Compute the oil set of LR0) items for the grmmr b. uild the CTION/GOTO tble for the grmmr. Compute the oil set of LR1) items for the grmmr d. uild the CTION/GOTO tble for the grmmr ee solutio for problem 8 t
10 12. Cosider the followig grmmr: ;. how the grmmr is LR1) but ot LR1) LR1) prser? FOLLOW ) = { $ } FOLLOW) = { $, ; } Coil set of LR0) items = tte 0 [ ] [ ; ] [ ] tte 2 [ ] [ ; ] ; tte 1 [ ] tte 3 [ ; ] tte 4 [ ; ] tio Goto tte ; $ 0 hift hift 3 ept 3 hift 4 4 ; ; No oflits i y stte, grmmr is LR1) LR1) prser? Coil set of LR1) items = tte 0 [, $ ] [ ;, {$,;} ] [, {$,;} ] tte 2 [, $ ] [ ;, {$,;} ] ; tte 1 [, {$,;} ] tte 3 [ ;, {$,;} ] tte 4 [ ;, {$,;} ] No oflits i y stte, grmmr is LR1) ltertive proof: ie grmmr is LR1), it must be lso LR1) sie LR1) is superset of LR1).
11 13. Cosider the followig grmmr: d bd e be. how the grmmr is LR1) but ot LLR1) LR1) prser? Coil set of LR1) items = tte 0 [, $ ] [ d, $ ] [ bd, $ ] [ e, $ ] [ be, $ ] tte 1 [, $ ] tte 2 b [ b d, $ ] [ b e, $ ] [, e ] [, d ] tte 3 [ d, $ ] [ e, $ ] [, d ] [, e ] tte 4 d tte 5 [ b d, $ ] [ bd, $ ] tte 6 e tte 7 [ b e, $ ] [ be, $ ] tte 8 [, e ] [, d ] tte 9 d tte 10 [ d, $ ] [ d, $ ] tte 11 [ e, $ ] e tte 12 [ e, $ ] tte 13 [, d ] [, e ] No oflits i y stte, grmmr is LR1) LLR1) prser? ttes 8 & 13 merged sie they hve idetil ores, yieldig tte 0 [, $ ] [ d, $ ] [ bd, $ ] [ e, $ ] [ be, $ ] tte 1 [, $ ] b tte 2 [ b d, $ ] [ b e, $ ] [, e ] [, d ] tte 3 [ d, $ ] [ e, $ ] [, d ] [, e ] tte 4 [ b d, $ ] tte 6 [ b e, $ ] tte 8 [, {d,e} ] [, {d,e} ] tte 9 [ d, $ ] tte 11 [ e, $ ] d tte 5 [ bd, $ ] e tte 7 [ be, $ ] d tte 10 [ d, $ ] e tte 12 [ e, $ ] Not LLR1), redue/redue error i tte 8 o lookheds d,e
12 14. Cosider the followig grmmr: b b d d. how the grmmr is LR1) but ot LLR1) LR1) prser? Coil set of LR1) items = tte 0 tte 1 [, $ ] b [ b, $ ] [, $ ] [ b, $ ] [ b, $ ] [ d, ] [, $ ] [ d, ] [ b, $ ] d [ d, ] tte 7 [ d, ] [ d, ] [ d, ] tte 8 [, $ ] tte 2 [ b, $ ] tte 4 [ b, $ ] d tte 6 [ d, ] [ d, ] tte 9 [, $ ] tte 3 [ b, $ ] tte 5 [ b, $ ] tte 12 [, $ ] tte 10 [, $ ] tte 11 [, $ ] No oflits i y stte, grmmr is LR1) LLR1) prser? ttes 6 & 7 merged sie they hve idetil ores, yieldig tte 0 [, $ ] [, $ ] [ b, $ ] [, $ ] [ b, $ ] [ d, ] [ d, ] tte 1 b [ b, $ ] [ b, $ ] [ d, ] d [ d, ] tte 6 [ d, {,} ] [ d, {,} ] tte 8 [, $ ] tte 2 [ b, $ ] tte 4 d [ b, $ ] tte 9 [, $ ] tte 3 [ b, $ ] tte 5 [ b, $ ] tte 12 [, $ ] tte 10 [, $ ] tte 11 [, $ ] Not LLR1), redue/redue error i tte 6 o lookheds,
this 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 informationCSc 453 Compilers and Systems Software. 6 : Top-Down Parsing I
C 45 Compilers n ystems oftwre 6 : op-down Prsing I Christin Collberg Deprtment of Computer iene University of rizon ollberg@gmil.om Copyright 2009 Christin Collberg eptember 14, 2009 1 Overview 2 Compiler
More informationPattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions
Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its
More informationCS 321 Programming Languages and Compilers. Bottom Up Parsing
CS 321 Progrmming nguges nd Compilers Bottom Up Prsing Bottom-up Prsing: Shift-reduce prsing Grmmr H: fi ; fi b Input: ;;b hs prse tree ; ; b 2 Dt for Shift-reduce Prser Input string: sequence of tokens
More informationLR Parsing, Part 2. Constructing Parse Tables. Need to Automatically Construct LR Parse Tables: Action and GOTO Table
TDDD55 Compilers nd Interpreters TDDB44 Compiler Construction LR Prsing, Prt 2 Constructing Prse Tles Prse tle construction Grmmr conflict hndling Ctegories of LR Grmmrs nd Prsers Peter Fritzson, Christoph
More informationECE 468/573 Midterm 1 September 28, 2012
ECE 468/573 Midterm 1 September 28, 2012 Nme:! Purdue emil:! Plese sign the following: I ffirm tht the nswers given on this test re mine nd mine lone. I did not receive help from ny person or mteril (other
More informationA Variant of Pascal s Triangle Dennis Van Hise Stetson University
A Vrit of Pscl s Trigle eis V Hise tetso Uiversity I. Itroductio d Nottio It is the purpose of this pper to explore vrit of Pscl s trigle. This vrit hs the rule tht every etry, deoted s,, where,, is clculted
More informationEX 1 Find the length of each side EX 2 Find the value of a, b, c, d. if the perimeter is 20.
HOW DOES THIS APPLY? EX Fid the legth of eh side EX 2 Fid the vlue of, b,, d. if the perieter is 20. To solve or ot to solve? C you solve usig properties of isoseles trigles disovered? If so, write the
More informationTop-down vs Bottom-up. Bottom up parsing. Sentential form. Handles. Handles in expression example
Bottom up prsing Generl e LR0) LR LR1) LLR o est exploit JvCUP, should understnd the theoreticl sis LR prsing); op-down vs Bottom-up Bottom-up more powerful thn top-down; Cn process more powerful grmmr
More information10/12/17. Motivating Example. Lexical and Syntax Analysis (2) Recursive-Descent Parsing. Recursive-Descent Parsing. Recursive-Descent Parsing
Motivting Exmple Lexicl nd yntx Anlysis (2) In Text: Chpter 4 Consider the grmmr -> cad A -> b Input string: w = cd How to build prse tree top-down? 2 Initilly crete tree contining single node (the strt
More informationCS280 HW1 Solution Set Spring2002. now, we need to get rid of the n term. We know that:
CS80 HW Solutio Set Sprig00 Solutios by: Shddi Doghmi -) -) 4 * 4 4 4 ) 4 b-) ) ) ) * ) ) ) 0 ) c-) ) ) ) ) ) ow we eed to get rid of the term. We ow tht: ) ) ) ) substitute ito the recursive epressio:
More informationProblem Set 2 Fall 16 Due: Wednesday, September 21th, in class, before class begins.
Problem Set 2 Fll 16 Due: Wednesdy, September 21th, in clss, before clss begins. 1. LL Prsing For the following sub-problems, consider the following context-free grmmr: S T$ (1) T A (2) T bbb (3) A T (4)
More informationCSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011
CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the
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 informationEliminating left recursion grammar transformation. The transformed expression grammar
Eliminting left recursion grmmr trnsformtion Originl! rnsformed! 0 0! 0 α β α α α α α α α α β he two grmmrs generte the sme lnguge, but the one on the right genertes the rst, nd then string of s, using
More information12 <= rm <digit> 2 <= rm <no> 2 <= rm <no> <digit> <= rm <no> <= rm <number>
DDD16 Compilers nd Interpreters DDB44 Compiler Construction R Prsing Prt 1 R prsing concept Using prser genertor Prse ree Genertion Wht is R-prsing? eft-to-right scnning R Rigthmost derivtion in reverse
More informationCompilers Spring 2013 PRACTICE Midterm Exam
Compilers Spring 2013 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs
More informationEE 477 Digital Signal Processing. 8a IIR Systems
EE 477 Digitl Sigl Processig 8 IIR Systems Geerl Differece Equtio FIR: output depeds o curret d pst iputs oly IIR: output depeds o curret d pst iputs d pst outputs y M [] b x[ ] + y[ l] l N l EE 477 DSP
More informationMidterm I Solutions CS164, Spring 2006
Midterm I Solutions CS164, Spring 2006 Februry 23, 2006 Plese red ll instructions (including these) crefully. Write your nme, login, SID, nd circle the section time. There re 8 pges in this exm nd 4 questions,
More informationDef : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.
Mth 0 Uit : Roots & Powers Red Buildig O, Big Ides, d New Vocbulry, p. 0 tet.. Estitig Roots ( clss) Red Lesso Focus p. tet. Outcoes Ch. Notes. Defie d give eple of rdicl. pp. 0, 9. Idetify the ide d the
More informationacronyms possibly used in this test: CFG :acontext free grammar CFSM :acharacteristic finite state machine DFA :adeterministic finite automata
EE573 Fll 2002, Exm open book, if question seems mbiguous, sk me to clrify the question. If my nswer doesn t stisfy you, plese stte your ssumptions. cronyms possibly used in this test: CFG :context free
More informationCMSC 331 First Midterm Exam
0 00/ 1 20/ 2 05/ 3 15/ 4 15/ 5 15/ 6 20/ 7 30/ 8 30/ 150/ 331 First Midterm Exm 7 October 2003 CMC 331 First Midterm Exm Nme: mple Answers tudent ID#: You will hve seventy-five (75) minutes to complete
More informationHomework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22)
Homework Context Free Lnguges III Prse Trees nd Homework #5 (due 10/22) From textbook 6.4,b 6.5b 6.9b,c 6.13 6.22 Pln for tody Context Free Lnguges Next clss of lnguges in our quest! Lnguges Recll. Wht
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 informationGauss-Seidel Method. An iterative method. Basic Procedure:
Guss-Siedel Method Guss-Seidel Method A itertive method. Bsic Procedure: -Algebriclly solve ech lier equtio for i -Assume iitil guess solutio rry -Solve for ech i d repet -Use bsolute reltive pproimte
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 informationASTs, Regex, Parsing, and Pretty Printing
ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,
More informationCSE 401 Midterm Exam 11/5/10 Sample Solution
Question 1. egulr expressions (20 points) In the Ad Progrmming lnguge n integer constnt contins one or more digits, but it my lso contin embedded underscores. Any underscores must be preceded nd followed
More informationSection 3.1: Sequences and Series
Sectio 3.: Sequeces d Series Sequeces Let s strt out with the defiitio of sequece: sequece: ordered list of umbers, ofte with defiite ptter Recll tht i set, order does t mtter so this is oe wy tht sequece
More information. (b) Evaluate the sum given by. Exercise #1: A sequence is defined by the equation a n 2n
Nme: 453 Dte: SEQUENCES ALGEBRA WITH TRIGONOMETRY Sequeces, or ordered list of umbers, re extremely importt i mthemtics, both theoreticl d pplied A sequece is formlly defied s fuctio tht hs s its domi
More informationLogic Spring Final Review
Idirect Argumet: Cotrdictios d Cotrpositio. Prove the followig by cotrdictio d by cotrpositio. Give two seprte proofs. The egtive of y irrtiol umber is irrtiol. b. For ll iteger, if ² is odd the is odd.
More informationObjectives (today and tomorrow) CSE401: Lexical Analysis. Lexical analysis (scanning) Separation of lexing & parsing
Objectives (tody d tomorrow) CSE401: Lexicl Alysis Lrry Ruzzo Sprig 2004 Defie overll theory d prcticl structure of lexicl lysis Briefly recp regulr lguges, expressios, fiite stte mchies, d their reltioships
More informationOperator Precedence. Java CUP. E E + T T T * P P P id id id. Does a+b*c mean (a+b)*c or
Opertor Precedence Most progrmming lnguges hve opertor precedence rules tht stte the order in which opertors re pplied (in the sence of explicit prentheses). Thus in C nd Jv nd CSX, +*c mens compute *c,
More informationParser Generation. Bottom-Up Parsing. Constructing LR Parser. LR Parsing. Construct parse tree bottom-up --- from leaves to the root
Parser Generation Main Problem: given a grammar G, how to build a top-down parser or a bottom-up parser for it? parser : a program that, given a sentence, reconstructs a derivation for that sentence ----
More informationLING/C SC/PSYC 438/538. Lecture 21 Sandiway Fong
LING/C SC/PSYC 438/538 Lecture 21 Sndiwy Fong Tody's Topics Homework 8 Review Optionl Homework 9 (mke up on Homework 7) Homework 8 Review Question1: write Prolog regulr grmmr for the following lnguge:
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 information6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
More informationBottom Up Parsing Handout. 1 Introduction. 2 Example illustrating bottom-up parsing
Bottom Up Parsing Handout Compiled by: Nomair. Naeem dditional Material by: driel Dean-Hall and Brad Lushman his handout is intended to accompany material covered during lectures and is not consered a
More informationLexical and Syntax Analysis. Bottom-Up Parsing
Lexical and Syntax Analysis Bottom-Up Parsing Parsing There are two ways to construct derivation of a grammar. Top-Down: begin with start symbol; repeatedly replace an instance of a production s LHS with
More informationSome Thoughts on Grad School. Undergraduate Compilers Review and Intro to MJC. Structure of a Typical Compiler. Lexing and Parsing
Undergrdute Compilers Review nd Intro to MJC Announcements Miling list is in full swing Tody Some thoughts on grd school Finish prsing Semntic nlysis Visitor pttern for bstrct syntx trees Some Thoughts
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 informationSolutions to Final COMS W4115 Programming Languages and Translators Monday, May 4, :10-5:25pm, 309 Havemeyer
Departmet of Computer ciece Columbia Uiversity olutios to Fial COM W45 Programmig Laguages ad Traslators Moday, May 4, 2009 4:0-5:25pm, 309 Havemeyer Closed book, o aids. Do questios 5. Each questio is
More informationSection 3.2: Arithmetic Sequences and Series
Sectio 3.: Arithmetic Sequeces Series Arithmetic Sequeces Let s strt out with efiitio: rithmetic sequece: sequece i which the ext term is fou by ig costt (the commo ifferece ) to the previous term Here
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl
More informationCompilers. Chapter 4: Syntactic Analyser. 3 er course Spring Term. Precedence grammars. Precedence grammars
Complers Chpter 4: yntt Anlyser er ourse prng erm Prt 4g: mple Preedene Grmmrs Alfonso Orteg: lfonso.orteg@um.es nrque Alfonse: enrque.lfonse@um.es Introduton A preedene grmmr ses the nlyss n the preedene
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationBottom-Up Parsing. Lecture 11-12
Bottom-Up Parsing Lecture 11-12 (From slides by G. Necula & R. Bodik) 9/22/06 Prof. Hilfinger CS164 Lecture 11 1 Bottom-Up Parsing Bottom-up parsing is more general than topdown parsing And just as efficient
More informationBottom-up parsing. Bottom-Up Parsing. Recall. Goal: For a grammar G, withstartsymbols, any string α such that S α is called a sentential form
Bottom-up parsing Bottom-up parsing Recall Goal: For a grammar G, withstartsymbols, any string α such that S α is called a sentential form If α V t,thenα is called a sentence in L(G) Otherwise it is just
More informationLR Parsers. Aditi Raste, CCOEW
LR Parsers Aditi Raste, CCOEW 1 LR Parsers Most powerful shift-reduce parsers and yet efficient. LR(k) parsing L : left to right scanning of input R : constructing rightmost derivation in reverse k : number
More informationPrimitive Pythagorean triples and generalized Fibonacci sequences
Notes o Number Theory d Discrete Mthemtics Prit ISSN 30 53, Olie ISSN 37 875 Vol 3, 07, No, 5 Primitive Pythgore triples d geerlized ibocci sequeces J V Leyedekkers d A G Sho, 3 culty of Sciece, The Uiversity
More informationstack of states and grammar symbols Stack-Bottom marker C. Kessler, IDA, Linköpings universitet. 1. <list> -> <list>, <element> 2.
TDDB9 Compilers nd Interpreters TDDB44 Compiler Construction LR Prsing Updted/New slide mteril 007: Pushdown Automton for LR-Prsing Finite-stte pushdown utomton contins lterntingly sttes nd symols in NUΣ
More information3n
Prctice Set 6 Sequeces d Series Clcultor Required Objectives Alyze ptters i sequeces to determie subsequet terms. Fid the first four terms of sequece give equtio for. Fid expressio for give sequece. Expd
More informationJava CUP. Java CUP Specifications. User Code Additions. Package and Import Specifications
Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationMIT Parse Table Construction. Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology
MIT 6.035 Parse Table Construction Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology Parse Tables (Review) ACTION Goto State ( ) $ X s0 shift to s2 error error goto s1
More informationUsing Gaussian Elimination for Determination of Structure Index in Euler Deconvolution
Austrli Jourl of Bsic d Applied Scieces, 4(1): 6390-6396, 010 ISSN 1991-8178 Usig Gussi Elimitio for Determitio of Structure Idex i Euler Decovolutio 1 Rez.toushmli d M.ghbri 1 Islmic zd uiversity,hmed
More informationCompilers. Bottom-up Parsing. (original slides by Sam
Compilers Bottom-up Parsing Yannis Smaragdakis U Athens Yannis Smaragdakis, U. Athens (original slides by Sam Guyer@Tufts) Bottom-Up Parsing More general than top-down parsing And just as efficient Builds
More informationLR Parsing, Part 2. Constructing Parse Tables. An NFA Recognizing Viable Prefixes. Computing the Closure. GOTO Function and DFA States
TDDD16 Compilers and Interpreters TDDB44 Compiler Construction LR Parsing, Part 2 Constructing Parse Tables Parse table construction Grammar conflict handling Categories of LR Grammars and Parsers An NFA
More information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationAnnouncements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem
Announcements Project : erch It s live! Due 9/. trt erly nd sk questions. It s longer thn most! Need prtner? Come up fter clss or try Pizz ections: cn go to ny, ut hve priority in your own C 88: Artificil
More informationCompanion Mathematica Notebook for "What is The 'Equal Weight View'?"
Compnion Mthemtic Notebook for "Wht is The 'Equl Weight View'?" Dvid Jehle & Brnden Fitelson July 9 The methods used in this notebook re specil cses of more generl decision procedure
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 informationPrinciples of Programming Languages
Principles of Programming Languages h"p://www.di.unipi.it/~andrea/dida2ca/plp- 14/ Prof. Andrea Corradini Department of Computer Science, Pisa Lesson 8! Bo;om- Up Parsing Shi?- Reduce LR(0) automata and
More informationCSCE 531, Spring 2017, Midterm Exam Answer Key
CCE 531, pring 2017, Midterm Exm Answer Key 1. (15 points) Using the method descried in the ook or in clss, convert the following regulr expression into n equivlent (nondeterministic) finite utomton: (
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
More informationThe Rogers-Ramanujan Identities
MPRA Muih Persol RePE Arhive The Rogers-Ruj Idetities Fzlee ossi d Sbuj Ds Assistt Professor Preier Uiversity Chittgog Bgldesh Mrh Olie t https://prubui-uehede/8/ MPRA Pper No 8 posted Deeber 7 9:7 UTC
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationChapter 4: LR Parsing
Chapter 4: LR Parsing 110 Some definitions Recall For a grammar G, with start symbol S, any string α such that S called a sentential form α is If α Vt, then α is called a sentence in L G Otherwise it is
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationLR Parsing LALR Parser Generators
LR Parsing LALR Parser Generators Outline Review of bottom-up parsing Computing the parsing DFA Using parser generators 2 Bottom-up Parsing (Review) A bottom-up parser rewrites the input string to the
More informationHeaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 201 Heaps 201 Goodrich ad Tamassia xkcd. http://xkcd.com/83/. Tree. Used with permissio uder
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationLR(0) Parsing Summary. LR(0) Parsing Table. LR(0) Limitations. A Non-LR(0) Grammar. LR(0) Parsing Table CS412/CS413
LR(0) Parsing ummary C412/C41 Introduction to Compilers Tim Teitelbaum Lecture 10: LR Parsing February 12, 2007 LR(0) item = a production with a dot in RH LR(0) state = set of LR(0) items valid for viable
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
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 informationLanguages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *
Pln for Tody nd Beginning Next week Interpreter nd Compiler Structure, or Softwre Architecture Overview of Progrmming Assignments The MeggyJv compiler we will e uilding. Regulr Expressions Finite Stte
More informationCS 340, Fall 2014 Dec 11 th /13 th Final Exam Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2014 Dec 11 th /13 th Finl Exm Nme: Note: in ll questions, the specil symol ɛ (epsilon) is used to indicte the empty string. Question 1. [5 points] Consider the following regulr expression;
More informationWednesday, August 31, Parsers
Parsers How do we combine tokens? Combine tokens ( words in a language) to form programs ( sentences in a language) Not all combinations of tokens are correct programs (not all sentences are grammatically
More informationIn One Slide. Outline. LR Parsing. Table Construction
LR Parsing Table Construction #1 In One Slide An LR(1) parsing table can be constructed automatically from a CFG. An LR(1) item is a pair made up of a production and a lookahead token; it represents a
More informationBottom-up Parser. Jungsik Choi
Formal Languages and Compiler (CSE322) Bottom-up Parser Jungsik Choi chjs@khu.ac.kr * Some slides taken from SKKU SWE3010 (Prof. Hwansoo Han) and TAMU CSCE434-500 (Prof. Lawrence Rauchwerger) Bottom-up
More informationPART 3 - SYNTAX ANALYSIS. F. Wotawa TU Graz) Compiler Construction Summer term / 309
PART 3 - SYNTAX ANALYSIS F. Wotawa (IST @ TU Graz) Compiler Construction Summer term 2016 64 / 309 Goals Definition of the syntax of a programming language using context free grammars Methods for parsing
More information10/23/18. File class in Java. Scanner reminder. Files. Opening a file for reading. Scanner reminder. File Input and Output
File class i Java File Iput ad Output TOPICS File Iput Exceptio Hadlig File Output Programmers refer to iput/output as "I/O". The File class represets files as objects. The class is defied i the java.io
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 informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationStructure of a Typical Interpreter. Compiler. Scanning and Parsing. Lexical Analysis (Scanning) Interaction Between Scanning and Parsing
Snning nd Prsing Announements Projet 1 is 5% of totl grde Projet 2 is 10% of totl grde Projet 3 is 15% of totl grde Projet 4 is 10% of totl grde Tody Outline of plnned topis for ourse Overll struture of
More informationLR Parsing Techniques
LR Parsing Techniques Bottom-Up Parsing - LR: a special form of BU Parser LR Parsing as Handle Pruning Shift-Reduce Parser (LR Implementation) LR(k) Parsing Model - k lookaheads to determine next action
More informationA left-sentential form is a sentential form that occurs in the leftmost derivation of some sentence.
Bottom-up parsing Recall For a grammar G, with start symbol S, any string α such that S α is a sentential form If α V t, then α is a sentence in L(G) A left-sentential form is a sentential form that occurs
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 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 informationOutline CS412/413. Administrivia. Review. Grammars. Left vs. Right Recursion. More tips forll(1) grammars Bottom-up parsing LR(0) parser construction
C12/1 Introduction to Compilers and Translators pring 00 Outline More tips forll1) grammars Bottom-up parsing LR0) parser construction Lecture 5: Bottom-up parsing Lecture 5 C 12/1 pring '00 Andrew Myers
More information3. Syntax Analysis. Andrea Polini. Formal Languages and Compilers Master in Computer Science University of Camerino
3. Syntax Analysis Andrea Polini Formal Languages and Compilers Master in Computer Science University of Camerino (Formal Languages and Compilers) 3. Syntax Analysis CS@UNICAM 1 / 54 Syntax Analysis: the
More informationFinite Automata. Lecture 4 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 21, 2015
Finite Automt Lecture 4 Sections 3.6-3.7 Ro T. Koether Hmpden-Sydney College Wed, Jn 21, 2015 Ro T. Koether (Hmpden-Sydney College) Finite Automt Wed, Jn 21, 2015 1 / 23 1 Nondeterministic Finite Automt
More informationBottom-Up Parsing. Lecture 11-12
Bottom-Up Parsing Lecture 11-12 (From slides by G. Necula & R. Bodik) 2/20/08 Prof. Hilfinger CS164 Lecture 11 1 Administrivia Test I during class on 10 March. 2/20/08 Prof. Hilfinger CS164 Lecture 11
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl component
More information. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.
MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics
More informationExternal Memory. External Memory. Computational Models. Computational Models
Exterl emory Exterl emory Computtiol model Shortet pth i implicit grid grph lgorithm I/O lgorithm Cche-oliviou lgorithm Computtiol model Shortet pth i implicit grid grph lgorithm I/O lgorithm Cche-oliviou
More informationBottom-Up Parsing. Parser Generation. LR Parsing. Constructing LR Parser
Parser Generation Main Problem: given a grammar G, how to build a top-down parser or a bottom-up parser for it? parser : a program that, given a sentence, reconstructs a derivation for that sentence ----
More information