Register

LL(1)

• retagged by
1,658 views

5 Answers

0 votes
0 votes

only option- c is coorect  i.e every LL(1) grammar is CLR(1) or LR(1)

User Avatar
Page:
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,247 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
8 votes
8 votes
3 answers
2
Parshu gate asked Nov 13, 2017
15,461 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
1 votes
1 votes
1 answer
3
smsubham asked Apr 4, 2018
1,039 views
LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...
User Avatar
0 votes
0 votes
2 answers
4
Deepalitrapti asked Jul 19, 2018
307 views
Compiler design
User Avatar
Link Copied!