Calculate the FIRST and FOLLOW for each non Terminal

Question

Consider the Following Grammar

P - > S

S  - > A | A ;S 

A - > id = E

E - > E+E | E-E | E*E | E/E | (E) | T

T - > id | num

Calculate FIRST and FOLLOW for each non terminal. 

Answer 1

First(P)={id}                                            Follow(P)={$}

First(S)={id}                                            Follow(S)={ $}

First(A)={id}                                            Follow(A)={ ; , $}

First(E)={  ( , id ,num }                           Follow(E)={ + , - , * , / , ) , ; , $ }

First(T) ={id , num}                                 Follow(T)={ + , - , * , / , ) , ; , $ }

Comments

No u are wrong

---

Your first (A) is wrong.. first (A) =id.. therefore first (A) is not equal to first(E)

---

First we need to convert the E production to non left recursive grammar?

Isn't it??