Re: Loop dependency analysis for C programs

"renjith.varma@gmail.com" <renjith.varma@gmail.com>
30 Nov 2006 02:07:32 -0500

          From comp.compilers

Related articles
Loop dependency analysis for C programs renjith.varma@gmail.com (renjith.varma@gmail.com) (2006-11-29)
Re: Loop dependency analysis for C programs DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-11-29)
Re: Loop dependency analysis for C programs renjith.varma@gmail.com (renjith.varma@gmail.com) (2006-11-30)
Re: Loop dependency analysis for C programs dima@rts.ua (Dmitry Marienko) (2006-12-01)
Re: Loop dependency analysis for C programs Sid.Touati@inria.fr (Sid Touati) (2006-12-01)
Re: Loop dependency analysis for C programs notme@nowhere.com (Paul Anderson) (2006-12-01)
Re: Loop dependency analysis for C programs neal.wang@gmail.com (neal) (2006-12-01)
Re: Loop dependency analysis for C programs robert.hundt@gmail.com (Robert H) (2006-12-03)
| List of all articles for this month |

From: "renjith.varma@gmail.com" <renjith.varma@gmail.com>
Newsgroups: comp.compilers
Date: 30 Nov 2006 02:07:32 -0500
Organization: Compilers Central
References: 06-11-11806-11-128
Keywords: analysis, parallel
Posted-Date: 30 Nov 2006 02:07:32 EST

Hans-Peter Diettrich wrote:
> renjith.varma@gmail.com wrote:
>
> > I am planning to do loop dependency analysis for C programs. Could you
> > tell me the best way to get the loop structure?
>
> You want to create an "control flow graph" (CFG).
>
> DoDi


But how can CFG help in loop dependency analysis. I want to find out
whether the iterations of a particular loop are paralleizable. For this
i need to get the loop index variable and anyother variables depending
on that.


I got one parser named 'ELSA'. It has the option to write the AST into
an XML file. I think i can use some xml parser to get an AST data
structure from that. But is there any other tool that provides an AST
that can be directly used in my program?


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.