Discussion
Left recursion in a grammar is a problem for
Answer: D
Correct answer: top-down parsers, which would recurse without consuming input
A top-down parser expanding A by the production A → Aα immediately faces A again with no token consumed, so it recurses forever. A bottom-up parser has no such difficulty and in fact prefers left recursion, since it keeps the stack shallow.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development