Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 2,074 of 2,753    |
|    Rodrigo Dominguez to All    |
|    How to transform a CFG into a structured    |
|    16 Sep 11 09:49:23    |
      From: roddomi@hotmail.com              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.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca