Register

parser

• retagged by
317 views

1 Answer

0 votes
0 votes

False.

  • if a grammar is LL(k) then it will surely pass by LR(k) parser but converse is not true.

For example:

  •  if a grammar is LL(1)  then it will be SLR(1) is not guaranteed, it may be LR(1) grammar but not SLR(1) grammar.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
kallu singh asked Sep 5, 2017
725 views
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
User Avatar
1 votes
1 votes
1 answer
2
learner_geek asked Aug 2, 2017
347 views
Compiler parser
is this given diagram correct or incorrect if incorrect then please correct it .
is this given diagram correct or incorrect if incorrect then please correct it .
User Avatar
2 votes
2 votes
1 answer
3
sripo asked Nov 10, 2018
3,316 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
1 votes
1 votes
5 answers
4
syncronizing asked Sep 22, 2018
1,715 views
LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C
Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C
User Avatar
Link Copied!