Discussion
An expression tree contains 5 binary operators. Translating it with one operation per three address instruction produces how many instructions?
Answer: D
Each operator becomes one instruction, so five are emitted. The number of temporaries introduced is also five, one holding the result of each operation. Later optimisation may eliminate several of them by reusing registers.
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