Discussion
In a recursive descent parser, the parsing stack is
Answer: D
Correct answer: the call stack of the host programming language
There is no explicit stack of grammar symbols: the recursion of the procedures does the work, and the partly expanded grammar symbols are held in the sequence of active calls. This is what makes the method so compact, and it is also its limitation - a deeply nested input can exhaust the call stack.
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