how to solve it??

Question

Consider the following LL(1) grammar.
E → TE′
E′ → + E|ε
T → FT′
T′ → T|ε
F → GF′
F′ → *F′|ε
G → (E)|a|b|c
Initially stack contains two symbols. Bottom of stack symbol is $ and top of stack (above $) symbol is E where E is start symbol of the grammar. The number of symbols on the stack after the sixth action taken by LL(1) parser to parse the input “ab*” are ______.

Answer 1

I guess, 3 should be the correct answer.

And the content of the stack should be T'E'$.

Here is the complete parsing of "ab*":

Comments

thnx

---

one mstk,in the table for T,there will be no FT' for *

---

and one more thing for this qs,last part only is enough..

---

Yes, [T, *] entry in the table will be empty.

Answer 2

Grammar is LL(1) so fo paerse string 'ab*' Productions are :

E$ ---> TE'$ ---> FT'E'$ ---> GF'T'E'$ ---> aF'T'E'$ ---> aT'E'$ ---> aTE'$ ---> aFT'E'$ ---> aGF'T'E'$ ---> abF'T'E'$ ---> ab*F'T'E'$ ---> ab*T'E'$ ---> ab*E'$ ---> ab*$

 

See content of stack after 6th operation .. it is { T', E', $ }

Comments

I think it is {T, E', $}