Seite 1 von 1

Alias analysis with IFDS, CFL RP

Verfasst: 17. Jul 2016 15:41
von ds72tuqu
HI,
I am not able to understand how the language is represented with using the graph in slide 9 and 10 in lecture number 9. How the paths are derived from the language or its other way around in CFL RP? is there any references to understand how CFL RP works?

Re: Alias analysis with IFDS, CFL RP

Verfasst: 17. Jul 2016 18:31
von jlerch
Hi,
I'm slightly confused by your choice for the topic title. IFDS and Alias Analysis is not related to your question actually.

On slide 4 you find a reference to the paper defining CFL-RP.
I'm not exactly sure which paths you are struggling with. The ones drawn in blue? These are added according to the algorithm, which is presented on slides 7 and 8.

Re: Alias analysis with IFDS, CFL RP

Verfasst: 17. Jul 2016 20:53
von ds72tuqu
My problem is how I can create a context free language for a piece of code. once the language is there I am able to understand how the paths are being drawn using the algo.

Re: Alias analysis with IFDS, CFL RP

Verfasst: 17. Jul 2016 21:12
von jlerch
You define a language depending on the problem you want to solve. In the slides we have shown languages for two different problems: one to achieve context-sensitivity and another for field-sensitivity.