3,113 views
5 votes
5 votes

Which of the following statements is FALSE?

  1. Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter
  2. Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of grammars parsed by LR(1) parsers
  3. Languages of grammars parsed by LL(2) parsers is a strict super set of the languages of grammars parsed by LL(1) parsers
  4. There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser

3 Answers

0 votes
0 votes
B is false because LR(k) is equivalent to LR(k+1) grammar not any superset relationship
0 votes
0 votes
Answer is B

LR(0) ⊂ LR(1) = LR(2) ........LR(k) = LR(k+1)  ; for k >= 1 : LR(k)=LR(k+1)

so, Languages of grammars parsed by LR(2) parsers is not a strict super set of the languages of grammars parsed by LR(1) parsers

although they both are same ;

if you compare their grammars :

LR(0) ⊂ LR(1) ⊂ LR(2) ........LR(k) ⊂ LR(k+1)
Answer:

Related questions

6 votes
6 votes
2 answers
1
Arjun asked Jan 26, 2019
1,691 views
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...