Thu, 10 Dec 1992 16:22:48 GMT

Related articles |
---|

Path flow and Control Flow Problems ravi@thor.ece.uc.EDU (1992-12-09) |

Re: Path flow and Control Flow Problems preston@helena.cs.rice.edu (1992-12-10) |

Newsgroups: | comp.compilers |

From: | preston@helena.cs.rice.edu (Preston Briggs) |

Organization: | Rice University, Houston |

Date: | Thu, 10 Dec 1992 16:22:48 GMT |

References: | 92-12-036 |

Keywords: | analysis, optimize, bibliography |

ravi@thor.ece.uc.EDU (Ravishankar) writes:

*>I am trying to find out if there are any references on Path analysis of*

*>Control Flow Graphs. Given a source program ( say, in a language like*

*>VHDL ), the first step that I am concerned with is the generation the*

*>Control Flow Graph for the given description *

Building the control-flow graph for a given routine is described in many

books on compiler construction. The usual reference is

Compilers: Principles, Techniques, and Tools

Aho, Sethi, and Ullman

Addison-Wesley, 1986

Probably Chapter 8, 9, and 10 will help most.

*>After the generation of the Control Flow graph, I would have to do an*

*>analysis and enumerate the set of all "fesable" paths that can be taken*

*>from the beggining to the end of the program.*

You can't simply enumerate all the paths, since loops allow an infinite

number of paths. For example,

procedure zap(integer i);

begin

while i > 0 do

writeln(i);

i = i - 1

end;

writeln('done)

end

We can't write down all the paths without knowing something about the

value of "i".

On the other hand, you could give a summary of the possible paths, using,

for example, regular expressions.

title="Summarizing Graphs by Regular Expressions",

author="Mark Wegman",

pages="203--216",

booktitle=popl10, % proceedings of POPL 10

year=1983,

month=jan

Preston Briggs

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.