edited by
638 views

2 Answers

1 votes
1 votes
if any Grammer is LL(1) then it compulsory BUP that means must be CLR(1) , powerful one of BUP definitely satisfy but there is no guarantee of LALR(1).

bcoz BUP is  more powerful than TDP.that means atleast most powerful person must satisfy
0 votes
0 votes
False! each LL(1) is CLR(1) but each CLR(1) may or may not be LALR(1). I think there is no relation b/w LL(1) and LALR(1) but LL(1) are proper subet of CLR(1).

Note that, every epsilon free LL(1) grammar is LALR(1).
edited

Related questions

2 votes
2 votes
1 answer
1
arch asked Nov 19, 2017
294 views
every LL(k) grammer is also SLR(k) grammer. (true / false)
0 votes
0 votes
2 answers
2
eyeamgj asked May 16, 2018
283 views
it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).
0 votes
0 votes
1 answer
3
shivanisrivarshini asked Mar 10, 2018
550 views
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
1 votes
1 votes
1 answer
4
sushmita asked Jan 17, 2017
478 views
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT?CAN SOMEONE EXPLAIN??