Content deleted Content added
→Prior work: new section |
|||
Line 55:
: In your transformation, you have duplicated code (the <code>i=-1;</code> block) and you have also introduced a new variable <code>ii</code> which you not only assign to, but also test. None of these transformations is allowed under the McCabe or Kosaraju reducibility rules. They are allowed under the Böhm and Jacopini reducibility rules. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 05:59, 17 July 2014 (UTC)
: I do agree however with you first point, namely that I can't see much commonality between the notions mentioned by Brooks and the one by McCabe. I've therefore added a split template to the article. I don't know much about the Brooks notion, but I suspect it could be merged with [[accidental complexity]] and the page titled [[essential complexity and accidental complexity]] or something like that. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 05:55, 17 July 2014 (UTC)
== Prior work ==
I'm surprised that a journal published McCabe's paper (in 1976) without noticing that his section VI (about the irreducible graphs), minus the proposed measure, duplicated the [more extensive] findings of the compiler guys, published some 4 years before, namely ''Characterizations of reducible flow graphs'' by Hecht and Ullman, which appeared both at STOC'72 and also in SIAM J. of Comput. in the same year. [[Special:Contributions/188.27.81.64|188.27.81.64]] ([[User talk:188.27.81.64|talk]]) 02:06, 21 July 2014 (UTC)
| |||