recategorized by
925 views
0 votes
0 votes

i am getting a option 

recategorized by

1 Answer

Best answer
1 votes
1 votes

option a is answer

we can make only one parse tree for every  string generated by this grammar , moreover the language generated by this grammar is set of all the even length palindrome

so it is unambiguous 

now it is not LL(1)

because  S ⇒ aSa |  bSb |ε 

here the follow of S is a,b ,$  that is match with the first of right hand side 

it means is row S and column a contain 2 entry  and same thing will happen for column b watch the diagram

  a b $  
S S->aSa,S->epsilon S->bSb,S->epsilon S->epsilon  

now the given grammar is not DCFL  so it is not LR(k)

selected by

Related questions

3 votes
3 votes
1 answer
1
1 votes
1 votes
2 answers
2
Prince Sindhiya asked Dec 27, 2018
1,593 views
The two basic operations that are often performed with the symbol table are:1.Set and reset 2.Set and insert 3. Insert and lookup 4.Reset and lookup