573final - ECE 573 – Final Exam December 14, 2009 Name:...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECE 573 – Final Exam December 14, 2009 Name: Purdue Email: Please sign the following: I affirm that the answers given on this test are mine and mine alone. I did not receive help from any person or material (other than those explicitly allowed). X Part 1: /30 Part 2: /30 Part 3: /15 Part 4: /25 Total: /100 Part 1: Dataflow analysis (30 pts) In this problem, you will design a dataflow analysis that performs a sign analysis . A sign analysis determines at each program point whether a variable is definitely positive (+), definitely negative (- ), definitely zero (0), or could be anything (?). Problem 1 (10 pts): Provide a lattice for this dataflow analysis. A few things to keep in mind: (i) don’t forget that having no information is different from a variable being “anything”; (ii) if a variable is 0, it also counts as both + and- ; (iii) ? means that a variable might be positive or might be negative. Problem 2 (1 pts): Should this analysis be forward or backward? Problem 3 (1 pts): Does this analysis use meet or join at merge points?...
View Full Document

This note was uploaded on 02/19/2012 for the course ECE 468 taught by Professor Test during the Fall '08 term at Purdue University.

Page1 / 9

573final - ECE 573 – Final Exam December 14, 2009 Name:...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online