Discussion
Partial redundancy elimination generalises common subexpression elimination by
Answer: C
Correct answer: removing a computation redundant on some but not all paths
Common subexpression elimination requires the expression to be available on every path, which fails if one branch computes it and another does not. Partial redundancy elimination inserts the computation on the paths lacking it, making it fully redundant at the join, and then removes it - and it subsumes loop invariant code motion as a special case.
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