Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.

Size: px

Start display at page:

Download "Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8."

Bertram Dean
6 years ago
Views:

1 Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack Lft string can b implmntd by a stack op of th stack is th Shift pushs a trminal on th stack Rduc pops 0 or mor symbols off of th stack production rhs pushs a non-trminal on th stack production lhs Ky Issu How do w dcid whn to shift or rduc? xampl grammar: * Considr stp * W could rduc by giving * A fatal mistak! No way to rduc to th start symbol Prof. Aikn CS 13 Lctur 8 3 Prof. Aikn CS 13 Lctur 8 Handls Intuition: Want to rduc only if th rsult can still b rducd to th start symbol Assum a rightmost drivation S * X hn is a handl of Handls Cont. Handls formaliz th uition A handl is a string that can b rducd and also allows furthr rductions back to th start symbol W only want to rduc at handls Not: W hav said what a handl is, not how to find handls Prof. Aikn CS 13 Lctur 8 5 Prof. Aikn CS 13 Lctur 8 6 1

2 Important Fact #2 Important Fact #2 about bottom-up parsing: In shift-rduc parsing, handls appar only at th top of th stack, nvr insid Why? Informal induction on # of rduc movs: ru initially, stack is mpty Immdiatly aftr rducing a handl right-most non-trminal on top of th stack nxt handl must b to right of right-most nontrminal, bcaus this is a right-most drivation Squnc of shift movs rachs nxt handl Prof. Aikn CS 13 Lctur 8 Prof. Aikn CS 13 Lctur 8 8 Summary of Handls In shift-rduc parsing, handls always appar at th top of th stack Handls ar nvr to th lft of th rightmost non-trminal hrfor, shift-rduc movs ar suffic; th nd nvr mov lft Bottom-up parsing algorithms ar basd on rcognizing handls Rcognizing Handls hr ar no known ffic algorithms to rcogniz handls Solution: us huristics to guss which stacks ar handls On som CFGs, th huristics always guss corrctly For th huristics w us hr, ths ar th SLR grammars Othr huristics work for othr grammars Prof. Aikn CS 13 Lctur 8 9 Prof. Aikn CS 13 Lctur 8 10 Grammars All CFGs Viabl Prfixs It is not obvious how to dtct handls Unambiguous CFGs SLR CFGs will gnrat conflicts At ach stp th parsr ss only th stack, not th ntir input; start with that... a is a viabl prfix if thr is an w such that a w is a stat of a shift-rduc parsr Prof. Aikn CS 13 Lctur 8 Prof. Aikn CS 13 Lctur

3 Huh? What dos this man? A fw things: A viabl prfix dos not xtnd past th right nd of th handl It s a viabl prfix bcaus it is a prfix of th handl As long as a parsr has viabl prfixs on th stack no parsing rror has bn dtctd Important Fact #3 Important Fact #3 about bottom-up parsing: For any grammar, th st of viabl prfixs is a rgular languag Prof. Aikn CS 13 Lctur 8 13 Prof. Aikn CS 13 Lctur 8 1 Important Fact #3 Cont. Important Fact #3 is non-obvious W show how to comput automata that accpt viabl prfixs Itms An itm is a production with a. somwhr on th rhs h itms for ar.... Prof. Aikn CS 13 Lctur 8 15 Prof. Aikn CS 13 Lctur 8 16 Itms Cont. h only itm for X is X. Itms ar oftn calld LR0 itms Intuition h problm in rcognizing viabl prfixs is that th stack has only bits and pics of th rhs of productions If it had a complt rhs, w could rduc hs bits and pics ar always prfixs of rhs of productions Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur

4 xampl Considr th input hn is a stat of a shift-rduc pars is a prfix of th rhs of Will b rducd aftr th nxt shift Itm. says that so far w hav sn of this production and hop to s Gnralization h stack may hav many prfixs of rhs s Prfix 1 Prfix 2... Prfix n-1 Prfix n Lt Prfix i b a prfix of rhs of X i a i Prfix i will vntually rduc to X i h missing part of a i-1 starts with X i i.. thr is a X i-1 Prfix i-1 X i b for som b Rcursivly, Prfix k1 Prfix n vntually rducs to th missing part of a k Prof. Aikn CS 13 Lctur 8 19 Prof. Aikn CS 13 Lctur 8 20 An xampl Considr th string * : * is a stat of a shift-rduc pars is a prfix of th rhs of is a prfix of th rhs of * is a prfix of th rhs of * An xampl Cont. h stack of itms.. *. Says W v sn of W v sn of W v sn * of * Prof. Aikn CS 13 Lctur 8 21 Prof. Aikn CS 13 Lctur 8 22 Rcognizing Viabl Prfixs Ida: o rcogniz viabl prfixs, w must Rcogniz a squnc of partial rhs s of productions, whr ach squnc can vntually rduc to part of th missing suffix of its prdcssor An NFA Rcognizing Viabl Prfixs 1. Add a dummy production S S to G 2. h NFA stats ar th itms of G Including th xtra production 3. For itm a.xb add transition a.xb X ax.b. For itm a.xb and production X g add a.xb X.g Prof. Aikn CS 13 Lctur 8 23 Prof. Aikn CS 13 Lctur 8 2

5 An NFA Rcognizing Viabl Prfixs Cont. 5. vry stat is an accpting stat 6. Start stat is S.S NFA for Viabl Prfixs of th xampl.... S..... S... Prof. Aikn CS 13 Lctur * * * *.. *. Prof. Aikn CS 13 Lctur 8 26 NFA for Viabl Prfixs in Dtail 1 NFA for Viabl Prfixs in Dtail 2 S. S. S... Prof. Aikn CS 13 Lctur 8 2 Prof. Aikn CS 13 Lctur 8 28 NFA for Viabl Prfixs in Dtail 3 NFA for Viabl Prfixs in Dtail.. S. S... S. S * *. Prof. Aikn CS 13 Lctur Prof. Aikn CS 13 Lctur

6 NFA for Viabl Prfixs in Dtail 5 NFA for Viabl Prfixs in Dtail 6. S. S S. S * *. Prof. Aikn CS 13 Lctur Prof. Aikn CS 13 Lctur 8 32 NFA for Viabl Prfixs in Dtail NFA for Viabl Prfixs in Dtail 8. S. S S. S * *. Prof. Aikn CS 13 Lctur Prof. Aikn CS 13 Lctur 8 3 NFA for Viabl Prfixs in Dtail 9 NFA for Viabl Prfixs in Dtail 10. S. S S. S * *. Prof. Aikn CS 13 Lctur Prof. Aikn CS 13 Lctur

7 NFA for Viabl Prfixs in Dtail NFA for Viabl Prfixs in Dtail 12. S. S S. S * *. Prof. Aikn CS 13 Lctur 8 3..* * *. *. Prof. Aikn CS 13 Lctur 8 38 NFA for Viabl Prfixs in Dtail S..... S.... *..* *. Prof. Aikn CS 13 Lctur 8 39 * *. ranslation to th DFA..... S.. *... *. S..... *. *. *. *. *.. *. Prof. Aikn CS 13 Lctur 8 0 Lingo h stats of th DFA ar canonical collctions of itms or canonical collctions of LR0 itms h Dragon book givs anothr way of constructing LR0 itms Valid Itms Itm X b.g is valid for a viabl prfix ab if S * axw abgw by a right-most drivation Aftr parsing ab, th valid itms ar th possibl tops of th stack of itms Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2

8 Itms Valid for a Prfix An itm I is valid for a viabl prfix a if th DFA rcognizing viabl prfixs trminats on input a in a stat s containing I h itms in s dscrib what th top of th itm stack might b aftr rading input a Valid Itms xampl An itm is oftn valid for many prfixs xampl: h itm. is valid for prfixs... Prof. Aikn CS 13 Lctur 8 3 Prof. Aikn CS 13 Lctur 8. Valid Itms for S.... * S.... *. * *.. *... * * * LR0 Parsing Ida: Assum stack contains a nxt input is t DFA on input a trminats in stat s Rduc by X b if s contains itm X b. Shift if s contains itm X b.tw quivalnt to saying s has a transition labld t Prof. Aikn CS 13 Lctur 8 5 Prof. Aikn CS 13 Lctur 8 6. LR0 Conflicts LR0 has a rduc/rduc conflict if: Any stat has two rduc itms: X b. and Y w. LR0 has a shift/rduc conflict if: Any stat has a rduc itm and a shift itm: X b. and Y w.td LR0 Conflicts S... S... *.. *. * *.. *.... *.... wo *. shift/rduc * conflicts with. LR0 ruls. Prof. Aikn CS 13 Lctur 8 Prof. Aikn CS 13 Lctur 8 8 8

9 SLR LR = Lft-to-right scan SLR = Simpl LR SLR improvs on LR0 shift/rduc huristics Fwr stats hav conflicts SLR Parsing Ida: Assum stack contains a nxt input is t DFA on input a trminats in stat s Rduc by X b if s contains itm X b. t FollowX Shift if s contains itm X b.tw Prof. Aikn CS 13 Lctur 8 9 Prof. Aikn CS 13 Lctur SLR Parsing Cont. If thr ar conflicts undr ths ruls, th grammar is not SLR h ruls amount to a huristic for dtcting handls h SLR grammars ar thos whr th huristics dtct xactly th handls SLR Conflicts S... S... *.. *. * *.. *.... *... Follow = {, $ }. Follow *. = {,, $ } * No. conflicts with SLR ruls!. Prof. Aikn CS 13 Lctur 8 51 Prof. Aikn CS 13 Lctur 8 52 Prcdnc Dclarations Digrssion Lots of grammars arn t SLR including all ambiguous grammars W can pars mor grammars by using prcdnc dclarations Instructions for rsolving conflicts Prcdnc Dclarations Cont. Considr our favorit ambiguous grammar: * h DFA for this grammar contains a stat with th following itms: *.. shift/rduc conflict! Dclaring * has highr prcdnc than rsolvs this conflict in favor of rducing Prof. Aikn CS 13 Lctur 8 53 Prof. Aikn CS 13 Lctur 8 5 9

10 Prcdnc Dclarations Cont. h trm prcdnc dclaration is mislading hs dclarations do not dfin prcdnc; thy dfin conflict rsolutions Not quit th sam thing! Naïv SLR Parsing Algorithm 1. Lt M b DFA for viabl prfixs of G 2. Lt x 1 x n $ b initial configuration 3. Rpat until configuration is S $ Lt a w b currnt configuration Run M on currnt stack a If M rjcts a, rport parsing rror Stack a is not a viabl prfix If M accpts a with itms I, lt a b nxt input Shift if X b. a g I Rduc if X b. I and a FollowX Rport parsing rror if nithr applis Prof. Aikn CS 13 Lctur 8 55 Prof. Aikn CS 13 Lctur 8 56 Nots If thr is a conflict in th last stp, grammar is not SLRk SLR xampl Configuration DFA Halt Stat Action * $ 1 shift k is th amount of lookahad In practic k = 1 Prof. Aikn CS 13 Lctur 8 5 Prof. Aikn CS 13 Lctur 8 58 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift Prof. Aikn CS 13 Lctur 8 59 Prof. Aikn CS 13 Lctur

11 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 61 Prof. Aikn CS 13 Lctur 8 62 SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift * $ shift Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 63 Prof. Aikn CS 13 Lctur 8 6 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 65 Prof. Aikn CS 13 Lctur 8 66

12 SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift * $ shift * $ 3 $ Follow rd. Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 6 Prof. Aikn CS 13 Lctur 8 68 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 69 Prof. Aikn CS 13 Lctur 8 0 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift * $ shift * $ 3 $ Follow rd. * $ $ Follow rd. * Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur

13 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 3 Prof. Aikn CS 13 Lctur 8 Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Configuration * $ S.. 5 *.. * S *. *.. *. *.. * * Prof. Aikn CS 13 Lctur 8 5 Prof. Aikn CS 13 Lctur 8 6 SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift * $ shift * $ 3 $ Follow rd. * $ $ Follow rd. * $ 5 $ Follow rd. Configuration $ 2 S * S *. *. *. * * * * Prof. Aikn CS 13 Lctur 8 Prof. Aikn CS 13 Lctur

14 Configuration $ 2 S * S *. *. *. * * * * SLR xampl Configuration DFA Halt Stat Action * $ 1 shift * $ 3 * not in Follow shift * $ shift * $ 3 $ Follow rd. * $ $ Follow rd. * $ 5 $ Follow rd. $ accpt Prof. Aikn CS 13 Lctur 8 9 Prof. Aikn CS 13 Lctur 8 80 Nots Skippd using xtra start stat S in this xampl to sav spac on slids Rrunning th automaton at ach stp is wastful Most of th work is rpatd An Improvmnt Rmmbr th stat of th automaton on ach prfix of th stack Chang stack to contain pairs Symbol, DFA Stat Prof. Aikn CS 13 Lctur 8 81 Prof. Aikn CS 13 Lctur 8 82 An Improvmnt Cont. For a stack sym 1, stat 1... sym n, stat n stat n is th final stat of th DFA on sym 1 sym n Goto abl Dfin goto[i,a] = j if stat i A stat j goto is just th transition function of th DFA On of two parsing tabls Dtail: h bottom of th stack is any,start whr any is any dummy symbol start is th start stat of th DFA Prof. Aikn CS 13 Lctur 8 83 Prof. Aikn CS 13 Lctur 8 8 1

15 Rfind Parsr Movs Shift x Push a, x on th stack a is currnt input x is a DFA stat Rduc X a As bfor Accpt rror Prof. Aikn CS 13 Lctur 8 85 Action abl For ach stat s i and trminal a If s i has itm X a.ab and goto[i,a] = j thn action[i,a] = shift j If s i has itm X a. and a FollowX and X S thn action[i,a] = rduc X a If s i has itm S S. thn action[i,$] = accpt Othrwis, action[i,a] = rror Prof. Aikn CS 13 Lctur 8 86 SLR Parsing Algorithm Lt I = w$ b initial input Lt j = 0 Lt DFA stat 1 hav itm S.S Lt stack = dummy, 1 rpat cas action[top_statstack,i[j]] of shift k: push I[j], k rduc X A: pop A pairs, push X, goto[top_statstack,x] accpt: halt normally rror: halt and rport rror Prof. Aikn CS 13 Lctur 8 8 Nots on SLR Parsing Algorithm Not that th algorithm uss only th DFA stats and th input h stack symbols ar nvr usd! Howvr, w still nd th symbols for smantic actions Prof. Aikn CS 13 Lctur 8 88 Mor Nots Som common constructs ar not SLR1 LR1 is mor powrful Build lookahad o th itms An LR1 itm is a pair: LR0 itm x lookahad [ *, $] mans Aftr sing * rduc if lookahad is $ Mor accurat than just using follow sts ak a look at th LR1 automaton for your parsr! Prof. Aikn CS 13 Lctur

Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. Shift ABC xyz ABCx yz. Lecture 8. Reduce Cbxy ijk CbA ijk

Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. Shift ABC xyz ABCx yz. Lecture 8. Reduce Cbxy ijk CbA ijk Review: Shift-Reduce Parsing Bottom-up parsing uses two actions: Bottom-Up Parsing II Lecture 8 Shift ABC xyz ABCx yz Reduce Cbxy ijk CbA ijk Prof. Aiken CS 13 Lecture 8 1 Prof. Aiken CS 13 Lecture 8 2