10. Elimination of left recursion

1. The following grammar eliminate left recursion, and analyzed symbol string i * i + i  

     E -> E+T | T

     T -> T*F | F

     F -> (E) | i

E-> TE '

E '-> + TE' | e

T->FT'

T'->*FT'|ε

F->(E)|i

2.P101 Practice 7 (2) (3)

（2）

A->aABe|a

B->Bb|d

 

（3）

S->Aa|b

A->SB

B->ab

 

Set seeking FIrst

S->Ap

First(Ap)={a,c,p}

A->a|ε

First(a)={a}

First (e) = {e}

A->cA

First(cA)={c}

A->aA

First(aA)={a}

 

Set seeking FIrst

S->Ap

S->Bq

A->a

A->cA

B->b

B->dB