2014compiler课件Ch4_3章节.pptVIP

Chapter 4 Top-Down Parsing Problems with LL(1) Parsing Computer Science Technology Harbin Engineering University Compiler * Theorem A grammar in BNF is LL(1) if the following conditions are satisfied. 1. For every production A - α1 | α2 |…| αn, First(αi) ∩ First(αj) is empty for all i and j, 1 ≤ i, j ≤ n, i ≠ j. 2. For every nonterminal A such that First(A) contains ε, First(A)∩Follow(A) is empty. Compiler * Example 4.15 First(exp) = { ( , number} First (addop) = {+, - } First(term) = { ( , number} First(mulop) = { * } First(factor) = { ( , number} Follow(exp) = { $ , +, -, ) } Follow(addop) = { ( , number } Follow(term) = { *, $, +, - } Follow(factor) = { *, $, +, - } Follow(mulop) = { ( , number } This grammar is not LL(1) grammar! exp - exp addop term | term addop - + | - term - term mulop factor | factor mulop - * factor - (exp) | number Compiler * Example 4.16 This grammar is not LL(1) grammar! statement - if-stmt | other if-stmt - if (exp) statement else-part else-part - else statement | ε exp - 0 | 1 First(statement) = {if, other} First(if-stmt) = { if } First(else-part) = { else, ε} First(exp) = {0, 1} Follow(statement) = { $, else } Follow(if-stmt) = { $, else } Follow(else-part) = { $, else } Follow(exp) = { ) } Compiler * Example 4.17 This grammar is LL(1) grammar! stmt-sequence - stmt stmt-seq’ stmt-seq’ - ; stmt-sequence | ε stmt - s First(stmt-sequence) = { s } First(stmt-seq’) = { ; , ε} First(stmt) = { s } Follow(statement-sequence) = { $ } Follow(stmt-seq’) = { $ } Follow(stmt) = { ; , $ } Compiler * Problems with LL(1) Parsing We try to rewrite the grammar into a form of LL(1) grammar. Two standard techniques: Left recursion removal Left factoring Not all grammars can be turned into LL(1) grammar. Compiler * Left Recursion Removal Left recursion is commonly used to make operations left associative. exp - exp addop term | term This is the case of immediate left recursion Left recursion occurs only within the production of