Discussion
A table driven predictive parser uses a stack containing
Answer: D
Correct answer: grammar symbols still to be matched or expanded
The stack of a predictive parser holds what the parser still expects to see. A terminal on top is matched against the input and popped; a nonterminal is replaced by the right side of the production the table selects. It is a direct simulation of the recursive descent call stack without the recursion.
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