8 Nov 2002 10:58:25 -0500

Related articles |
---|

Question on Partitions (in the DeSSA algorithm) in Morgan's book pks3539@cacs.louisiana.edu (Prabhat k Singh) (2002-11-08) |

From: | "Prabhat k Singh" <pks3539@cacs.louisiana.edu> |

Newsgroups: | comp.compilers |

Date: | 8 Nov 2002 10:58:25 -0500 |

Organization: | http://groups.google.com/ |

Keywords: | Java, question |

Posted-Date: | 08 Nov 2002 10:58:25 EST |

Hi,

I am implementing a java bytecode optimizer using the soot framework

and algorithms in the Robert Morgan's "Building an optimizing compiler

book". While implementing the DeSSA (translating SSA to normal form)

on page 178 he talks about a partition P = {p1, p2, p3,...pr} of the

set of all temporaries.

1. How can i get this partition at the begining of the

algorithm NORMAL(N, E, Exit, Entry, P) // page 179

2. What is the representative temporary. How do i get it?

if i have a partition set:

P = p1 p2 p3 p4

t1,t2 t3,t4 t5,t6 t7

if i do FIND(t1) what should it return? should it be t1 or t2 or ...?

thanks a lot.

prabhat..

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.