# Recent activity by Vineeta Garg

1
2
3
here nothing is given whether language is decidable or not.so how to solve it
4
5
How it is left factored??
Consider the following CFG. S $\rightarrow$aAb|aBc|bAd|bBe A$\rightarrow$g B$\rightarrow$g The number of states exist in DFA using LALR (1) construction for the above grammar ____________?? (Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take 13 states in ... DFA....!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!