Discussion
An implementation that stores only states on the parsing stack is possible because
Answer: C
Correct answer: each state determines the grammar symbol that led into it
Every transition into a given state is on the same symbol, so the symbol is recoverable from the state and need not be stored separately. Implementations therefore push states alone, halving the stack, and reconstruct the symbols only when something - an error message, say - actually needs them.
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