编译原理综合复习题.doc

画一个DFA，它能够接受∑＝{0，1}上能够被5整除的二进制数。 余数 0 1 2 3 4 接受0 0 2 4 1 3 接受1 1 3 0 2 3 二进制：接受0：等价于×2 接受1：等价于×2 + 1 101 0111000 5 1010 111000 N*2 10101 11000 N*2+1 , 2、写出正规式(a|b)(ba|a)*a的NFA并确定化。（要求画出DFA状态图）．、已知文法G[E]: E(E+T|E-T|T T(T*F|T/F|F F((E)|i (1)给出句型i-i)*i的最左推导； (2)给出句型i-i)*i语法树； (3)给出句型i-i)*i的短语、直接短语、句柄。．(f(L) L(BD D(,BD B(A | I 表 7．(B | SaB | + B(A | B+A | aA A()S* | ( 8、对文法消除左递归和提取左公因子。 A(aABc (2)A(a (3)A(d (4)E(Ta (5)E(b (6)T(EF (7)F(ab A- aA’|d A’ = ABc|ε A(aABc|a|d 有无间接左递归？？？？？？？ A ( (d|a)A’ A’(a(BcA’|ε) 排序 F T E 左部非终结符下标 右部时改写 E(Ta ( EFa (Eaba E(b E( Eaba |b E( bE’ E’( abaE’|ε 9．(BCc | gDB B(bCDE | ε C(DaB | ca D(dD |ε E(gAf | c 求各非终结符的FIRST集和FOLLOW集 B( ε D(ε FIRST FOLLOW A FIRST(B)-{ε}U FIRST(C) U {g} = {b, g, d, c, a} {#}U{f} ={#, f} B {b,ε} FIRST(C) U FOLLOW(A) U FOLLOW(C) ={ #, f, d, c, a, g} C FIRST(D) - {ε} U {a}U{c} = {d, c, a} {c} U FIRST(D)-{ε}U FIRST(E) = {d, g, c} D {d,ε} FIRST(B)-{ε}U FOLLOW(A) U FIRST(E) U{a}U FOLLOW(D) = { b, #, f, a, g, c} E {g, c} FOLLOW(B) = {#, f, d, c, a, g } 文法G[A]的预测分析表 SELECT A(BCc FIRST(BCc) = FIRST(B) –{ε} U FIRST(C) = {a, b, c, d} A( gDB {g} B(bCDE {b} B(ε {ε}U FOLLOW(B) = { #, f, d, c, a, g, ε} C(DaB FIRST(DaB)= FIRST(D) - {ε} U {a} = {a,d} C( ca {c} D(dD {d} D(ε {ε}UFOLLOW(D) = { #, b, f, a, g, c, ε} E(gAf {g} E( c {c} 预测分析表： a b C d f g # A (BCc (BCc (BCc (BCc ( gDB B (ε (bCDE (ε (ε (ε (ε (ε C (DaB ( ca (DaB D (ε (ε (ε (dD D(ε (ε (ε E ( c (gAf 10．([T T( TE | F] F( Fi | i 消除左递归、左公因子 E([T T( F] T’ T’ (E T’ |ε F( i F’ F’ (i F’ |ε // E([ i ( i F’ |ε)] ( E T’ |ε) FIRST和FOLLOW集合 First Follow E {[} {#}U Fir