retagged by
411 views

2 Answers

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

selected by
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 ) ≠ ∅

Related questions

8 votes
8 votes
2 answers
4