722 views

2 Answers

3 votes
3 votes
Because Recursive Descent Parser will go into an infinite looping state on left recursive grammar.
1 votes
1 votes
Recursive descent parser is a top down parser. A top down parser accepts the grammers which is free from ambiguity and left recursion.

Related questions

0 votes
0 votes
2 answers
1
dhruba asked Jun 5, 2023
314 views
0 votes
0 votes
1 answer
3
Kartheek8899 asked Oct 14, 2022
514 views
S - L = RS - RL - * RL - idR - LIs given CFG LR(0) & SLR(1)?
0 votes
0 votes
2 answers
4
atulcse asked Jan 16, 2022
859 views
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}