chapt的er4-bottomupparser.pptVIP

◎2005 ECNU SEI CS416 Compiler Design lec04-bottomupparser Exercises P.273 4.39, 4.40 P.267 4.2, 4.3 (thinking) due: Bottom-Up Parsing (P.195) A bottom-up parser creates the parse tree of the given input starting from leaves towards the root. A bottom-up parser tries to find the right-most derivation of the given input in the reverse order. S ? ... ? ? (the right-most derivation of ?) ? (the bottom-up parser finds the right-most derivation in the reverse order) Bottom-up parsing is also known as shift-reduce parsing because its two main actions are shift and reduce. At each shift action, the current symbol in the input string is pushed to a stack. At each reduction step, the symbols at the top of the stack (this symbol sequence is the right side of a production) will replaced by the non-terminal at the left side of that production. There are also two more actions: accept and error. Shift-Reduce Parsing A shift-reduce parser tries to reduce the given input string into the starting symbol. a string ? the starting symbol reduced to At each reduction step, a substring of the input matching to the right side of a production rule is replaced by the non-terminal at the left side of that production rule. If the substring is chosen correctly, the right most derivation of that string is created in the reverse order. Rightmost Derivation: S ? ? Shift-Reduce Parser finds: ? ? ... ? S Shift-Reduce Parsing -- Example S ? aABb A ? aA | a B ? bB | b Handle Informally, a handle (句柄)of a string is a substring that matches the right side of a production rule. But not every substring matches the right side of a production rule is handle A handle of a right sentential form ?? (? ???) is a production rule A ? ? and a position of ? where the string ? may be found and replaced by A to produce the previous right-sentential form in a rightmost derivation of ?. S ? ?A? ? ??? If the grammar is unambiguous, then every right-