Register

Parsing techniques

• edited by
396 views

1 Answer

0 votes
0 votes
The given grammar is LL(3).

Some prorperties of LL grammar are that it should not be ambiguous, non determinstic and left recursive.

So if we see for LL(1): it has a look ahead of 1 so that makes this grammar non deterministic as after seeing a we dont whether it is S->a or S->ab or S->abc.. So not LL(1)

LL(2): after seeing ab we dont know S->ab or S->abc.

LL(3) has a lookahead of 3 and this problem doesnot reside here. So the given grammar is LL(3).
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Sagar Chintawar asked Feb 11, 2019
1,914 views
Predictive parsing
Get LL(1) parsing table for the following grammar A--> aCDq / aBg C --> p /Ct / BD / rAB D--> d B-->e
Get LL(1) parsing table for the following grammarA aCDq / aBgC p /Ct / BD / rABD dB >e
User Avatar
0 votes
0 votes
2 answers
4
atul_21 asked Nov 28, 2017
655 views
Parsing
I think that the given grammar is LL(1) . please explain me if I'm wrong.
I think that the given grammar is LL(1) . please explain me if I'm wrong.
User Avatar
Link Copied!