逻辑表达式GS0 S→ A1 A→A∨B2 A→ B3 B→B∧C4 B→ C5 C→┐D 6 C→ D7 D→A8 D→a其SLR分析表如下：状态 动作 GOTO ┐ ∨ ∧ a # A B C D0 s5 s7 s6 1 2 3 41 s8 a0 2 r2 s9 r2 r2 3 r4 r4 r4 r4

状态栈 符号栈 输入串 动作 0 # #(a∨┐a)∧a# 移进 0 5 # 0 (a∨┐a)∧a# 移进 0 5 7 # 0 ( a∨┐a)∧a# 移进 0 5 7 6 # 0 ( a ∨┐a)∧a# 规约B→C 0 5 3 # 0 ( B ∨┐a)∧a# 规约A→A∨B 0 1 # 0 ( A ∨┐a)∧a# 移进 0 1 9 # 0 ( A ∨┐a)∧a# 移进 0 1 9 7 # 0 ( A └ ∨┐a)∧a# 移进 0 1 9 7 6 # 0 ( A └ b ∨┐a)∧a# 规约B→C 0 1 9 3 # 0 ( A └ B ∨┐a)∧a# 规约A→A∨B 0 1 1 # 0 ( A └ A ∨┐a)∧a# 移进 0 1 1 8 # 0 ( A └ A ∨(┐a))∧a# 移进 0 1 1 8 0 # 0 ( A └ A ∨(┐a))∧a# 规约D→a 0 1 1 8 8 # 0 ( A └ A ∨(D))∧a# 规约C→┐D 0 1 1 8 5 # 0 ( A └ A ∨(C))∧a# 规约B→C 0 1 1 3 # 0 ( A └ A ∨B)∧a# 规约A→A∨B 0 1 # 0 ( A ∨B)∧a# 规约A→A∨B 0 1 9 # 0 ( A ∨B)∧a# 移进 0 1 9 3 # 0 ( A └ ∨B)∧a# 规约A→A∨B 0 1 # 0 ( A ∨B)∧a# 规约A→A∨B 0 3 # 0 ( A∨B )∧a# 规约B→C 0 1 # 0 ( A ∨B)∧a# 移进 0 1 9 # 0 ( A ∨B)∧a# 移进 0 1 9 2 # 0 ( A └ ∧B)∧a# 移进 0 1 9 2 7 # 0 ( A └ b ∧B)∧a# 移进 0 1 9 2 6 # 0 ( A └ B ∧B)∧a# 规约B→C 0 1 9 3 # 0 ( A └ B ∧C)∧a# 规约A→A∨B 0 1 # 0 ( A ∨B)∧a# 规约A→A∨B 0 3 # 0 ( A∨B )∧a# 规约B→C 0 2 # 0 ( A∨B∧C ) ∧a# 规约A→B 0 # 0 (A∨B∧C)∧a# 规约S→A 0 # A∨B∧C∧a# 接