Register

Parsing techniques

• edited by
733 views

1 Answer

0 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).
Voting & Accepting an answer helps improve the community
← Previous · myselfNext → · Data Hazards
← Previous in category · Testbook Test Series...Next in category → · LL grammar
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
253
253 views
souled asked Mar 22
253 views
LL1 parsing table
ISNT THIS LL1 PARSING TABLE WRONG??SINCE first of S is {a,b} S- AB should be written is column a and b both..
0 0 votes
1 1 answer
2.6k
2.6k views
Sagar Chintawar asked Feb 11, 2019
2,575 views
Predictive parsing
Get LL(1) parsing table for the following grammarA aCDq / aBgC p /Ct / BD / rABD dB >e
1 1 vote
0 0 answers
2.5k
2.5k views
Hopealways asked Nov 23, 2018
2,504 views
MadeEasy Test Series: Compiler Design - Parsing
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this?According to me it is NOT LL(1) (since it is left factored)...
1 1 vote
1 1 answer
1.3k
1.3k views
garvit_vijai asked Oct 10, 2018
1,277 views
LL(1) Parsing
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols.b) No need of computing FIRST of some symbols.c) Maybe compute FIRST of som...