编译原理第二次小作业.docVIP

下载可编辑 .专业.整理. Homework 2 向首兴 2014013421 1. 对于一个文法若消除了左递归、提取了左公因子后是否一定为LL(1)文法？试对下面文法进行改写，并对改写后的文法进行判断。 (1) A → aABe | a B → Bb | d 答：对该文法消除左递归： B → Bb | d = B → dC C → bC | ε 对该文法提取左公因子： A → aABe | a = A → aD D → ABe | ε 改写后的文法： A → aD B → dC C → bC | ε D → ABe | ε First(A) = {a} Follow(A) = {d, #} First(B) = {d} Follow(B) = {e} First(C) = {b, ε} Follow(C) = {e} First(D) = {a, ε} Follow(D) = {d, #} For C: First(bC) ∩ First(ε) = {b} ∩ {ε} = ? First(bC) ∩ Follow(C) = {b} ∩ {e} = ? For D: First(ABe) ∩ First(ε) = {a} ∩ {ε} = ? First(ABe) ∩ Follow(D) = {a} ∩ {d, #} = ? 由上验证：该文法是LL(1)文法。 (2) S → Ab| Ba A → aA | a B → a 答：该文法没有左递归； 对该文法提取左公因子： A → aA | a = A → aC C → A | ε 改写后的文法： S → Ab| Ba A → aC B → a C → A | ε First(S) = {a} Follow(S) = {#} First(A) = {a} Follow(A) = {b} First(B) = {a} Follow(B) = {a} First(C) = {a, ε} Follow(C) = {b} For S: First(Ab) ∩ First(Ba) = {a} ∩ {a} = {a} 由上验证：该文法不是LL(1)文法。 2. 给定文法G(S): S → a | ^ | (T) T → T,S | S 写出如下句型的最左归约。 (a,a) 答：(a,a) → (S,a) → (T,a) → (T,S) → (T) → S (a,(a,a)) 答：(a,(a,a)) → (S,(a,a)) → (T,(a,a)) → (T,(S,a)) → (T,(T,a)) → (T,(T,S)) → (T,(T)) → (T,S) → (T) → S (((a,a),^,(a)),a) 答：(((a,a),^,(a)),a) → (((S,a),^,(a)),a) → (((T,a),^,(a)),a) → (((T,S),^,(a)),a) → (((T),^,(a)),a) → ((S,^,(a)),a) → ((T,^,(a)),a) → ((T,S,(a)),a) → ((T,(a)),a) → ((T,(S)),a) → ((T,(T)),a) → ((T,S),a) → ((T),a) → (S,a) → (T,a) → (T,S) → (T) → S 3. 给定文法 G(S): S → aAb A → BcA | B B → idt | ε 请分别写出下列句型的句柄。 aidtcBcAb 答：树形图如下： 句柄：BcA aidtccb 答：树形图如下： 句柄：ε ab 答：树形图如下： 黄色部分即为句柄：ε aidtb 答：树形图如下： 句柄：ε或idt 4. 写出如下文法的LR(0)项目集规范族。 (1) S → aS | bS | a 答：设该文法的拓广文法为： S → S S → aS | bS | a 如下计算其LR(0)项目集规范族： C := { CLOSURE ({S → .S})} Repeat For C 中每一项目集I和每一文法符号X Do if GO(I, X)非空且不属于C Then 把GO(I, X)放入C中 Until C不再增大 计算流程： C := { CLOSURE ({S → .S, S → .aS, S → .bS, S → .a}) }