Register

Compiler

• edited by
606 views

1 Answer

1 1 vote
Parser depends on Grammar not on language. Language with left recursion can't be LL(1) but ultimately we can remove Left Recursion. Even removal of Left Recursion is not sufficient for LL(1) parsing but existence off Left Recursion make it NON LL(1).

EX.
S ----> a           
S------> Sa
given grammar is not LL(1) because of Left Recursion in 2nd production But 2nd production is useless so we can remove it. now it will be LL(1)
Voting & Accepting an answer helps improve the community
← Previous · ProbabilityNext → · Why is the power-set...
← Previous in category · CompilerNext in category → · How to convert this ...
Position:
Show:

Related questions

0 0 votes
0 0 answers
718
718 views
admin asked Aug 20, 2019
718 views
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 6 (Page No. 258)
Show that the following grammar:$S\rightarrow SA\mid A$$A\rightarrow a$is SLR(1) but not LL(1).
2 2 votes
0 0 answers
637
637 views
admin asked Aug 20, 2019
637 views
Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 5 (Page No. 258)
Show that the following grammar:$S\rightarrow AaAb\mid BbBa$$A\rightarrow \epsilon$$A\rightarrow\epsilon$is LL(1) but not SLR(1).
3 3 votes
1 answers 1 answer
1.1k
1.1k views
Bikram asked Nov 25, 2016
1,144 views
Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
1 1 vote
1 answers 1 answer
814
814 views
thor asked Nov 17, 2016
814 views
Compiler