# MadeEasy Test Series: Compiler Design - Parsing

1 vote
841 views Let 'x', 'y', 'z' and 'u' represents the number of entries in rows of Non-terminals 'S', 'A', 'B' and 'C' respectively. The value of x + y + z + u is ______ .

edited
0
simply asked number of entries for grammer in table which are left.
0
Ya but i found half of the answers wrong on madeeasy test series..
2
I think question itself is wrong.Given grammar is not LL(1).
1

Question not asking grammar is LL(1) or not . Since if table contain 2 entry for particular column then not LL(1) , Here simply ask number of entries.

i think correct answer is 16 but they have given it 18. somebody please solve this problem
how this grammer is LL(1)..

it is having left recursive production(B-->Bb)
0 I got 16 but in answer key its 18. I think I am correct.

0
Isn't first of ( B -> Bb/∊) Should be ∊ only?
0
No after getting € we substitute it in production to get b also as the first.

Eg :

A->Bb

B-->€

In this first of A={€, b}

Same concept can be applied to the left recursive grammar also.
0
Thank you for the explanation.
0
Welcome.. I got 16 but in answer key its 18. I think I am correct.

## Related questions

1 vote
1
367 views
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this? According to me it is NOT LL(1) (since it is left factored), NOT LR(0) (Since the Item 0 has a R-R conflict), NOT SLR(1) (The item 0 has a RR conflict since Follow(X) = Follow(Y) = {a,b} correct me If i'm wrong
1 vote