Discussion
Backtracking in a top-down parser is undesirable chiefly because
Answer: C
Correct answer: it can take exponential time and undoes semantic actions already run
Backtracking may explore many alternatives before finding the right one, and the cost can grow exponentially with the input. Worse for a practical compiler, any semantic action already executed - a symbol table entry, a line of output - must be undone, which is difficult to do correctly and is why predictive parsing is preferred.
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