Discussion
Recursive descent parsing represents each nonterminal of the grammar as
Answer: C
Correct answer: a procedure whose body mirrors the productions for that nonterminal
Each nonterminal becomes a procedure, each alternative a branch within it, each terminal in a right side a call to match, and each nonterminal a call to the corresponding procedure. The correspondence between grammar and code is close enough to read one from the other, which is why the method is so easy to write 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