Discussion
During a reduction, the input pointer of an LR parser
Answer: B
Correct answer: does not move, since no token is consumed by a reduction
A reduction rearranges what is already on the stack and consumes nothing from the input. Only a shift advances the pointer. This is why a parser may perform several reductions in succession on the same lookahead, and why the lookahead is examined repeatedly without being consumed.
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