Grammar Type?

Question

The grammar $E \to T + E \mid T$ is?

• A. $\text{LR}(0)$ and $\text{LL}(1)$
• B. Not an operator grammar
• C. Ambiguous
• D. $\text{SLR}(1)$ but not $\text{LL}(1)$

As the question did not seem to be complete , I am trying to guess the question from the answer ( shame on these test series guys , can't even proof-read question ).

Comments

terminals ?? , is it incomplete ?

---

This was written there.

 

Let me check the answer. ( There test series are so stupid , they don't even check the question properly ).

sonam vyas

Hi , can you please check now.

Answer 1

This grammar is SLR(1) But Not LL(1).

Answer 2

This Grammar is not LL(1) because we have to put both Production  in first of RHS which is first of  T ,  in this way 2 production are going in to same cell so there is a conflict.

If we find out canonical collection of Lr(0) items then we are going to get 1 SR conflict so it is not LR(0) .But that conflict can be easily resolved by SLR(1).

ANS : option D is correct Grammar is SLR(1) but not LL(1).

Answer 3

It is useless grammar. It doesnot generate any terminals. May be ambiguois might be the answer. I dont know what they meant

Answer 4

Grammar is not complete..You can't say about ambiguity.(option c is eliminated)

Still if we explore..

It is satisfying the conditions of operator grammar. (option b is eliminated)

However we are not able to find FIRST but we can think that it is not LL(1) because from both of the productions we are getting FIRST(T) hence we will not get disjoint set so it is not LL(1) 

Now if you try to make cannonical collection of LR(0) item. You will find a SR conflict which will be solved by SLR(1).

I think Option (d) is correct