第四章语法自顶向下方法教程.ppt

LL分析实例 文法G: E? ? T E’[1] E’ ? + T E’[2] | ?[3] T ? F T’[4] T’ ? * F T’[5] | ?[6] F ? id[7] | ( E )[8] 符号串 i + i * i # 的LL[1]分析过程： Predict( [1] ) = first(TE’) = { id , ( } Predict( [2] ) = first(+TE’) = { + } Predict( [3] ) = follow(E’) = { ) , # } Predict( [4] ) = first(FT’) = { id , ( } Predict( [5] ) = first(*FT’) = { * } Predict( [6] ) = follow(T’) = { + , ) , # } Predict( [7] ) = first(id) = { id } Predict( [8] ) = first((E)) = { ( } 分析栈S 输入流T 矩阵元素 E # i + i * i # LL[ E ,i ] = [1] T E’# i + i * i # LL [ T ,i ] = [4] F T’ E’# i + i * i # LL [ F ,i ] = [7] i T’ E’ # i + i * i # Match T’ E’# + i * i # LL [ T’,+] = [6] E’# +i * i # LL [ E’,+ ] = [2] +T E’# +i * i # Match T E’# i * i # LL [ T,i ] =[4] F T’ E’# i* i # LL [ F,i ] = [7] i T’ E’# i * i # Match T’ E’# * i # LL [ T’,* ] = [5] *FT’ E’# * i # Match FT’ E’# i # LL[F,i] = [7] iT’ E’# i # Match T’ E’# # LL[T’,#] = [6] E’# # LL[E’, #] = [3] # # ok If-then-else语句 BL语言{ [i ]j | i =j=0 }不是LL文法 条件语句的产生式是无法变换成LL[1]型 产生式的。 人有了知识，就会具备各种分析能力， 明辨是非的能力。 所以我们要勤恳读书，广泛阅读， 古人说“书中自有黄金屋