The Gateway to Computer Science Excellence
+2 votes

GATE 2010 Question

The grammar S→aSa∣bS∣c is 

  1. LL(1) but not LR(1)
  2. LR(1) but not LL(1)
  3. Both LL(1) and LR(1)
  4. Neither LL(1) nor LR(1)

I have 2 small doubt

First Doubt:-If a grammer is LL(1) then it is always LR(0) ? Is there any grammer which is LL(1)  and cannot be parsed by LR(0) ?

Second doubt :- Can any one tell me the above question is write or wrong because they have given LR(1) parser and i haven't heard about LR(1).I have heard about  Brute force ,recursive descent,operator presedence,LL(1) LR(0) SLR(1) LALR(1) CLR(1).So what is the difference between LR(0) AND LR(1) and which one is more powerfull ?

in Compiler Design by (379 points) | 713 views
Thanks :)

3 Answers

+6 votes
Best answer

First Doubt : A grammar parsed by LL(1) must also be parsed by LR(1) Parser but may not by LR(0)

For e.g 

S. ---> AaAb 

S ---> BbBa

A ---> €

B ---> €

Second doubt : LR(1) also known as canonical LR(1)

So LR(1) and CLR(1) same.

by Active (2.3k points)
selected by

@Himanshu LL(1) is subset of LR(1)

Also LR(1) are DCFL.

In diagram where will be LL(0)??
+2 votes
CLR(1) is also called as LR(1)
by (419 points)
0 votes
  1. please check this i am correct or not
by Junior (815 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,252 answers
104,698 users