New version page

U of M CS 5641 - Bottom-Up Parsing Algorithms

Upgrade to remove ads
Upgrade to remove ads
Unformatted text preview:

Bottom-Up Parsing AlgorithmsProblem: when to shift, when to reduce?What we need for LR parsingLR(0) state = set of LR(0) itemsLR(0) statesNaïve SLR Parsing AlgorithmNotesSlide 8SLR ExampleConfiguration | int * int $Slide 11Configuration int | * int $Slide 13Slide 14Configuration int * | int $Slide 16Slide 17Slide 18Configuration int * int | $Slide 20Slide 21Slide 22Slide 23Configuration int * | T $Slide 25Slide 26Slide 27Configuration int * T | $Slide 29Slide 30Slide 31Slide 32Configuration | T $Slide 34Configuration T | $Slide 36Slide 37Configuration | E $Slide 39Configuration E | $Slide 41Slide 42An ImprovementAn Improvement (Cont.)Goto TableRefined Parser MovesAction TableSLR Parsing AlgorithmNotes on SLR Parsing AlgorithmConstructing SLR statesExample SLR Parse TableExample SLR ParseAnother ExampleBottom-Up Parsing AlgorithmsLR(k) parsingL: scan input Left to rightR: produce Rightmost derivationk tokens of lookaheadLR(0)zero tokens of look-aheadSLRSimple LR: like LR(0), but uses FOLLOW sets to build more “precise” parsing tablesLR(0) is a toy, so we focus on SLRReading: Section 4.7Problem: when to shift, when to reduce?Recall our favorite grammar:E  T + E | TT  int * T | int | (E)The stepT * int + int  int * int + intis not part of any rightmost derivationHence, reducing first int to T was a mistakeHow to know when to reduce and when to shift?What we need for LR parsingLR(0) statesdescribe states in which the parser can beNote: LR(0) states are used by both LR(0) and SLR parsersParsing tablestransitions between LR(0) states,actions to take when transiting: shift, reduce, accept, errorHow to construct LR(0) states?How to construct parsing tables?How to drive the parser?LR(0) state = set of LR(0) itemsAn LR(0) item [X  ] says thatthe parser is looking for an Xit has an on top of the stackexpects to find input string derived from Notes:[X . a ] means that if a is on the input, it can be shifted (resulting in a . . That is:a is a correct token to see on the input, andshifting a would not “over-shift” (still a viable prefix).[X .] means that we could reduce  to XT  int. * TT  int.5LR(0) statesET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TNaïve SLR Parsing Algorithm1. Let M be LR(0) state machine for G•each state contains a set I of LR(0) items2. Let |x1…xn$ be initial configuration3. Repeat until configuration is S’|$•Let | be current configuration•Run M on current stack •If M rejects , report parsing error•If M accepts , let a be next inputShift if [X  . a  ]  ItemsReduce if [X    Items and a  Follow() a Xa Report parsing error if neither appliesNotesIf there is a conflict in the last step, grammar is not SLR(k)k is the amount of lookaheadIn practice k = 1T  int. * TT  int.5LR(0) statesET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TSLR ExampleConfiguration DFA Halt State Action| int * int $ 1T  int. * TT  int.5Configuration| int * int $ET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TSLR ExampleConfiguration DFA Halt State Action| int * int $ 1 shiftint | * int $ 5T  int. * TT  int.5Configurationint | * int $ET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TT  int. * TT  int.5Configurationint | * int $ET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TSLR ExampleConfiguration DFA Halt State Action| int * int $ 1 shiftint | * int $ 5 * not in Follow(T)shiftint * | int $ 8T  int. * TT  int.5Configurationint * | int $ET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TT  int. * TT  int.5Configurationint * | int $ET(intint*)EETint((intT(S’  . EE  . TE  .T + ET  .(E)T  .int * TT  .int1S’  E . 2 E  T.E  T. + E3T  (. E)E  .TE  .T + ET  .(E)T  .int * TT  .int4E  T + . EE  .TE  .T + ET  .(E)T  .int * TT  .int67T  (E.)8T  int * .TT  .(E)T  .int * TT  .int9E  T + E.T  (E). 10T  int * T. 11TT  int. * TT  int.5Configurationint * | int $ET(intint*)EETint((intT(S’ …


View Full Document
Download Bottom-Up Parsing Algorithms
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Bottom-Up Parsing Algorithms and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Bottom-Up Parsing Algorithms 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?