Register

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

5,670 views
6 6 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

1 1 vote
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)
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE Overflow | Comp...Next → · GATE Overflow | Comp...
← Previous in category · GATE Overflow | Comp...Next in category → · GATE Overflow | Comp...
Position:
Show:

Related questions

10 10 votes
4 4 answers
2.7k
2.7k views
Arjun asked Jan 26, 2019
2,691 views
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 1
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...
4 4 votes
3 3 answers
6.6k
6.6k views
Arjun asked Jan 26, 2019
6,579 views
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...
4 4 votes
2 answers 2 answers
2.7k
2.7k views
Arjun asked Jan 26, 2019
2,747 views
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 8
Which of the following sentences regarding Viable prefixes is/are CORRECT?Viable prefixes is the set of prefixes of right-sentential forms that can appear on the stack of...
5 5 votes
1 1 answer
3.4k
3.4k views
Arjun asked Jan 26, 2019
3,365 views
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 10
Which of the following is TRUE regarding LL(0) grammar?We can have a LL(0) grammar for any regular languageWe can have a LL(0) grammar for a regular language only if it d...