2014compiler课件Ch5_2_2013章节.pptVIP

Chapter 5 Bottom –Up Parsing LR(1) Parsing Computer Science Technology Harbin Engineering University Compiler * Simple LR(1) Parsing Uses DFA of set of LR(0) items as constructed in the previous section. The power of LR(0) is increased significantly. SLR(1) uses the next token of the input string to direct its actions. The input token is consulted before a shift to make sure that appropriate DFA transition exists. The Follow sets of nonterminals are used to decide if a reduction should be performed. This approach is powerful enough to parse almost all commonly occurring language constructs. Compiler * SLR(1) Parsing Algorithm Let s be a current state (at the top of the parsing stack) If state s contains any item of the form A-α . X β where X is a terminal, and X is the next token in the input string, then The action is to shift the current input token onto the stack, the new state to be pushed on the stack is the state containing item A- α X . β . Compiler * 2. If state s contains a complete item A - γ . , and the next token in the input string is in Follow(A), then the action is to reduce by the rule A - γ. A reduction by the rule S’-S, where S is the start state, is equivalent to acceptance (the next input token must be $) Otherwise, remove the string γ and all its corresponding states from the stack, back up in the DFA to the state from which the construction of γ began. The state must contain an item B- α . A β Push A into the stack Push the state containing item B- α A . β Compiler * 3. If the next input token is such that neither of the above two cases applies. An error is declared. Compiler * SLR(1) Grammar We say that a grammar is an SLR(1) grammar of the application of SLR(1) parsing algorithm results in no ambiguity. A grammar is SLR(1) if and only if , for any state s, the following two conditions are satisfied: For any item A - α . X β in s with X a terminal, there is no complete item B - γ . in s with X in Follow(B). For any two complete i