0 votes 0 votes Compiler Design compiler-design parsing lr-parser ll-parser numerical-answers made-easy-test-series + – Vineeta Garg asked Feb 5, 2017 retagged Jul 15, 2022 by Anjana5051 Vineeta Garg 411 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes S1:follow(s) ={$(as it is a start symbol),c(S->ScS)}---so cardinality is 2 ---- true S2: it is not LL(1)...as it is left recursive grammar you cannot parse it with a top down parser ---- false So ans is 1 Pavan Kumar Munnam answered Feb 5, 2017 selected Feb 6, 2017 by Tendua Pavan Kumar Munnam comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Only S1 is true. For S1: Follow of S={$,c} (BY Follow calculations) For S2: First (abS) ∩ First (ScS) ∩ First (d ) ∩ First (e ) ≠ ∅ Smriti012 answered Feb 5, 2017 Smriti012 comment Share Follow See all 0 reply Please log in or register to add a comment.