Discussion
A top down parser evaluates an L-attributed definition by
Answer: C
Correct answer: passing inherited attributes as parameters and returning synthesised ones
In recursive descent each nonterminal is a procedure, so the natural mechanism is already present: inherited attributes go in as parameters and synthesised ones come back as results. This is why recursive descent handles L-attributed definitions so comfortably, and it is the argument most often made for writing the parser by hand.
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