GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 3

Question

Which of the following statements is FALSE?

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

Comments

Reffering from the diagram in... https://gateoverflow.in/1470/gate1999-1-17#16773

Iam confused how B is false.  @Arjun sir please help. which one of them is true.

---

@suraj20041995 diagram is referring to parsers…..In question languages of grammar is mentioned….

refer this  -https://gatecse.in/lr-parsing-part-2-language-of-ll-and-lr-grammars/

 

important points

 

---

dcfl ?

Answer 1

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

Answer 2

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)

Comments

Why you have mentioned LR(2) as a superset of LR(1)

---

1 . LR(2) Grammar is super-set of LR(1) grammar .

2 . Languages of grammars parsed by LR(2) parsers is same as Languages of grammars parsed by LR(1) parsers

please make sure , 1 statement is talking about grammar , 2 is talking about Language

Answer 3

A,C,D are correct options. B is false.