1. COMPILER CONSTRUCTION Principles and Practice Kenneth C. Louden

2. 5. Bottom-Up Parsing PART TWO

5. DFA and the LR(0) Parsing of The grammar: A -> ( A ) | a shift shift shift reduce A->a shift reduce A->(A) shift reduce A->(A) accept ( (a) )$ ( a) )$ a )$ ) )$ ) )$ )$ )$ $ $ $ 0 $ 0 ( 3 $ 0 ( 3 ( 3 $ 0 ( 3 ( 3 a 2 $ 0 ( 3 ( 3 A 4 $ 0 ( 3 ( 3 A 4 ) 5 $ 0 ( 3 A 4 $ 0 ( 3 A 4 ) 5 $ 0 A 1 Parsing stack input Action 1 2 3 4 5 6 7 8 9

7. 5.3 SLR(1) Parsing

9. 5.3.1 The SLR(1) Parsing Algorithm

16. The parsing process for n+n+n shift 2 reduce E ->n shift3 shift4 reduce E -> E+n shift3 shift4 reduce E -> E+n accept n + n + n $ +n + n $ +n + n $ n + n $ + n $ + n $ n $ $ $ $0 $0 n 2 $0E1 $0E1+3 $0E1+3n4 $0E1 $0E1+3 $0E1+3n4 $0E1 Action Input Parsing stack 1 2 3 4 5 6 7 8 9

20. 5.3.2 Disambiguating Rules for Parsing Conflicts

24. 5.3.3 Limits of SLR(1) Parsing Power

27. 5.3.4 SLR(k) Grammars

29. 5.4 General LR(1) and LALR(1) Parsing

30. 5.4.1 Finite Automata of LR(1) Items

35. 5.4.2 The LR(1) Parsing Algorithm

41. The DFA of LR(1) item

43. 5.4.3 LALR(1) Parsing

51. The DFA of LR(1)

52. The DFA of LALR(1) Note: An LALR( l ) parser will perform the reduction A->a , before declaring error; A general LR( l) parser will declare error immediately after a shift of the token a.

54. Computing the DFA of LALR( l) items directly from the DFA of LR(0) items

57. 5.5 Yacc: LALR(1) PARSING GENERATOR

59. 5.5.1 Yacc Basics

70. 5.5.2 Yacc Options

81. 5.5.3 Parsing Conflicts and Disambiguating Rule 5.5.4 Tracing the Execution of a Yacc Parsing 5.5.5 Arbitrary Value Types in Yacc 5.5.6 Embedded Action in Yacc Back

82. 5.6 GENERATION OF A TINY PARSER USING Yacc

83. 5.7 ERROR RECOVERY IN BOTTOM-UP PARSERS

84. 5.7.1 Detecting Errors in Bottom-up Parsing

89. 5.7.2 Panic Mode Error Recovery

97. 5.7.3 Error Recovery in Yacc 5.7.4 Error Recovery in TINY

98. End of Part Two THANKS