Path: csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!news.linkpendium.com!news.linkpendium.com!news.iecc.com!nerds-end From: Rodrigo Dominguez Newsgroups: comp.compilers Subject: How to transform a CFG into a structured graph Date: Fri, 16 Sep 2011 09:49:23 -0400 Organization: Compilers Central Lines: 13 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <11-09-018@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: gal.iecc.com 1316287340 68899 64.57.183.58 (17 Sep 2011 19:22:20 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Sat, 17 Sep 2011 19:22:20 +0000 (UTC) Keywords: analysis, question Posted-Date: 17 Sep 2011 15:22:20 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: x330-a1.tempe.blueboxinc.net comp.compilers:268 Hi, I am looking for any published work on how to transform a CFG into a structured graph (a.k.a. hammock graph). So far I have only found [1] which requires the notion of a lexically-ordered list of statements. I find this somewhat complicated to implement so I would like to ask the news group if anybody knows of other work in this area. I appreciate any help. [1] Zhang F, D'Hollander EH. Using hammock graphs to structure programs. IEEE Transactions on Software Engineering. 2004;30(4): 231-245. Available at: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1274043.