|How to transform a CFG into a structured graph firstname.lastname@example.org (Rodrigo Dominguez) (2011-09-16)|
|From:||Rodrigo Dominguez <email@example.com>|
|Date:||Fri, 16 Sep 2011 09:49:23 -0400|
|Posted-Date:||17 Sep 2011 15:22:20 EDT|
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  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.
 Zhang F, D'Hollander EH. Using hammock graphs to structure programs. IEEE
Transactions on Software Engineering. 2004;30(4): 231-245. Available at:
Return to the
Search the comp.compilers archives again.