loops in irreducible graph?

sreedhar@sally.cs.mcgill.ca (V.C. SREEDHAR)
Wed, 12 Jan 1994 18:48:10 GMT

          From comp.compilers
Related articles
loops in irreducible graph? sreedhar@sally.cs.mcgill.ca (1994-01-12)
Re: loops in irreducible graph? cliffc@rice.edu (1994-01-13)
Re: loops in irreducible graph? stoltz@cse.ogi.edu (1994-01-14)
| List of all articles for this month |
Newsgroups: comp.compilers
From: sreedhar@sally.cs.mcgill.ca (V.C. SREEDHAR)
Keywords: theory, question
Organization: Compilers Central
Date: Wed, 12 Jan 1994 18:48:10 GMT

Hello:


There are many ways to identify loops/nested loops (sometimes also called
as natural loops) for reducible flowgraph. Can someone point to me how to
identify loops in irreducible graph? or rather loops/nested-loops that
are not reducible (in the usual sense of definition[1]). The notion of
loops is little tricky for multiple entry loops.


[1] @Book{Hecht77,
    Author = "Matthew S. Hecht",
    Title = "Flow Analysis of Computer Programs",
    Publisher = {Elsevier North-Holland, Inc.},
    Year = 1977
}
--

Post a followup to this message

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