search
Log In
7 votes
3.3k views
  1. Every LL(1) grammer is LALR(1) TRUE OR FALSE
  2. Every LL(1) grammer is CLR(1) TRUE OR FALSE

AS I think 2nd is True and 1st is False if I am wrong please let me correct.

in Compiler Design 3.3k views

6 Answers

12 votes
 
Best answer

1. False
2. True


selected by
0
Thanks sir
0
I think both true please conform this picture.if LL(1) than also LALR(1)
0

@Arnab Bhadra
What is the source of your diagram ?

1 vote
Both are true.

Every ll 1 grammar is lalr1 grammar and every lalr1 grammar is CLR1 grammar
0 votes
1. True

2.False
1
@kallu

if first is true how could second be false, since every LALR(1) is CLR(1)...

by the way @learner_geek,

second is true but first is false since there are some LL(1) which are not LALR(1)...
0
According to  @kallu if first is true then 2nd will automatically true because every LALR(1) is CLR(1)
0

thanks  joshi_nitish

0
for any k>0

LR(k)=LR(k+1)
0

We can also refer to this link for better understanding- https://www.facebook.com/groups/gateoverflow/search/?query=parser%20diagram

0 votes
If a grammar G is LL(1) then it must be CLR(1). Hence it may or may not be LALR(1) and may or may not be SLR(1).
Hence (i) FALSE
(ii) TRUE
0 votes
1st one false....2 nd one true...
0 votes
both are true .

Every ll 1 grammar is lalr1 grammar and every lalr1 grammar is CLR1 grammar.

check the standard book

Related questions

1 vote
1 answer
2
6 votes
3 answers
3
4.4k views
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
asked Nov 13, 2017 in Compiler Design Parshu gate 4.4k views
4 votes
1 answer
4
4.9k views
Consider a Grammar G as follows : $S\rightarrow W$ $W \rightarrow ZXY / XY$ $Y\rightarrow c/\epsilon$ $Z\rightarrow a/d$ $X\rightarrow Xb/\epsilon$ Draw the LL(1) parsing table for the given grammar ? NOTE :- The above grammar is NOT LL(1) .
asked Dec 27, 2016 in Compiler Design Kapil 4.9k views
...