Discussion
A recursive descent parser is written for a grammar with 12 nonterminals. How many parsing procedures does it normally contain?
Answer: A
The usual structure is one procedure per nonterminal, so twelve are needed. Terminals are matched inline by a helper rather than by procedures of their own. The correspondence between grammar and code is what makes the style so readable.
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