Discussion
A dependency graph for an annotated parse tree has an edge from attribute a to attribute b when
Answer: C
The edges record which values must be available before which others can be computed. Any topological sort of the graph is a legal evaluation order. Drawing the graph for a small tree is the quickest way to see whether a definition is workable.
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