Discussion
A recursive descent parser is naturally suited to building
Answer: C
Correct answer: an abstract syntax tree returned by each parsing procedure
Each procedure recognises one construct, so it is the natural place to build the node for that construct from the nodes its callees return. The tree is assembled bottom up as the recursion unwinds, and no separate tree-building pass is needed.
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