Groups | Search | Server Info | Login | Register
Groups > comp.compilers > #268
| From | Rodrigo Dominguez <roddomi@hotmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | How to transform a CFG into a structured graph |
| Date | 2011-09-16 09:49 -0400 |
| Organization | Compilers Central |
| Message-ID | <11-09-018@comp.compilers> (permalink) |
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.
Back to comp.compilers | Previous | Next | Find similar
How to transform a CFG into a structured graph Rodrigo Dominguez <roddomi@hotmail.com> - 2011-09-16 09:49 -0400
csiph-web