2014compiler课件Ch4_2章节(476KB).pptVIP

Chapter 4 Top-Down Parsing LL(1) Parsing LL(1)分析 Computer Science Technology Harbin Engineering University Introduction No longer often used Simple scheme with explicit stack Prelude for more powerful and complex bottom-up algorithms First “L” – the input is processed from left to right Second “L” – leftmost derivation 1 – one lookahead symbol Compiler * LL(1) Parsing Basic Method 基本方法 Push the start symbol onto the stack. Generate(生成): Replace a nonterminal on the top of the stack by one of the choices in the grammar rule for that nonterminal. The replacement string from the BNF must be