1 votes 1 votes Find First and Follow of the given grammar $S \rightarrow aSa | bSb|A$ $A \rightarrow aBb$ $B \rightarrow aB|bB|\epsilon$ Compiler Design compiler-design parsing + – Mk Utkarsh asked Feb 1, 2018 Mk Utkarsh 2.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply Inspiron commented Feb 1, 2018 reply Follow Share S= first={a,b},follow={a,b,$} A=first={a},,follow=follow of S B=first={a,b,null},follow={b} 1 votes 1 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Here it is ...... sumit goyal 1 answered Feb 1, 2018 • selected Feb 1, 2018 by Mk Utkarsh sumit goyal 1 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments sandeep007734 commented Feb 5, 2018 reply Follow Share yes, for B, to get b, we can use $B \rightarrow bB$ and $B \rightarrow \epsilon$ and hence it is not $LL(1)$ 0 votes 0 votes Vishwadeepak commented Aug 18, 2018 reply Follow Share Yes this answers is correct but LL(1) Parsing table will be create also 0 votes 0 votes Ana_101 commented 20 hours ago reply Follow Share can you help me with other grammar please? 0 votes 0 votes Please log in or register to add a comment.