2014compiler课件Ch5_1_2007new.pptVIP

Compiler Chapter 5 Bottom –Up Parsing LR(0) Parsing Introduction Bottom-up parsing algorithms are more powerful and more complex. The most general bottom-up algorithm is LR(1) parsing “L”: input processed from left to right “R”: rightmost derivation is produced 1 : one symbol lookahead It is meaningful to consider LR(0) parser Overview The parsing stack will contain both tokens and nonterminals, and some extra information. The stack is empty at the beginning and will contain the start symbol at the end of a successful parse. Start symbol is augmented with a new start symbol S’ - S Two actions: Shift (移入)a terminal from the front of the input string to the top of the stack. Reduce (归约)a string α at the top of the stack to a nonterminal A, given the BNF choice A- α A bottom-up parser is also called a shift-reduce parser. Example 5.1 Example 5.2 Observations Bottom–up parser can shift input symbols onto the stack until it determines what action to perform. To determine what action to perform a parser requires arbitrary “stack lookahead”. Parser itself builds a stack and can arrange for appropriate information. Next token in the input may also need to be consulted as a lookeahead. Derivation Shift-reduce parser traces out a rightmost derivation of the input string. Each of the intermediate strings of terminals and nonterminals in a derivation is called a right sentential form(右句型) Example: E’ = E = E + n = n + n Viable Prefix(可行前缀、活前缀) Handle （句柄） A parser will shift terminals from the input to the stack until it is possible to perform a reduction to obtain the next right sentential form. This will occur when the string of symbols on the top of the stack matches the right-hand side of the production that it uses on the next reduction. This string together with the position in the right sentential form where it occurs, and the production used to reduce it, is called the handle of the right sentential form. Handle (cont)