Register

LL(k) Grammar

6,961 views
4 votes
4 votes
Consider the grammar with the following productions.
S→aaB/aaC
B→b
C→c
Which of the following option is true ?

(A) The grammar is LL(3)

(B) The grammar is LL(1)

(C) The grammar is LL(2)

(D) It can’t be LL(k) grammar for any k, as it contains left factoring.
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,265 views
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
User Avatar
0 votes
0 votes
1 answer
2
Rahul Ranjan 1 asked Mar 19, 2018
4,972 views
Check if grammar is LL(1) ?
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 drawing parsing table ?
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...
User Avatar
8 votes
8 votes
3 answers
3
Parshu gate asked Nov 13, 2017
15,523 views
Finding type of Grammar LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
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)
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...
User Avatar
Link Copied!