Discussion
A recursive descent parser with backtracking
Answer: A
Correct answer: tries alternatives in turn and undoes work when one fails
With backtracking the parser attempts each alternative in turn, and on failure restores the input position and tries the next. It handles a larger class of grammars than a predictive parser, but it can take exponential time and it makes semantic actions awkward, since work already done may have to be undone.
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