edited by
11,484 views
7 votes
7 votes

 

Which of the following statements is true?

  1. Every LL(1) grammar is  LALR(1).
  2. Every LL(1) grammar is CLR(1).

 

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

edited by

6 Answers

Best answer
17 votes
17 votes

1. False
2. True

selected by
1 votes
1 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

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,181 views
Can you give an example which is not LL(1) but is CLR(1)
0 votes
0 votes
1 answer
2
Rahul Ranjan 1 asked Mar 19, 2018
4,919 views
Given a grammar :$E \rightarrow E + T / T$$T \rightarrow i$Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without dra...
8 votes
8 votes
3 answers
3
Parshu gate asked Nov 13, 2017
15,198 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...