Talk:Linear code sequence and jump
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Layout Update[edit]
The layout of the article has been updated, a history section added, some additional references included and some minor edits for accuracy. --Nat Hillary 00:04, 5 January 2010 (UTC) —Preceding unsigned comment added by Nat hillary (talk • contribs)
Added reference to contemporary JJ-path moniker. Nat Hillary 18:35, 11 November 2009 (UTC) —Preceding unsigned comment added by Nat hillary (talk • contribs)
Typo correction. Nat Hillary 17:23, 11 November 2009 (UTC)
Created by. Nat Hillary 15:51, 5 November 2009 (UTC)
Jorgensen (2013) and DD-path[edit]
I think he is actually wrong. His definition of DD-path is a bit hard to grasp, but looking at his examples, DD-paths never overlap, even for conditional jumps. So DD-path can't be the same thing as JJ-path/LCSAJ. 188.27.81.64 (talk) 08:13, 18 July 2014 (UTC)
Yes, he is wrong. An LCSAJ can contain a number of decision points (on average, 4) but at each of them control flow passes straight on. A DD-path contains no decision points. There is no connection between LCSAJs and DD-paths. [David Hedley - co-author of original LCSAJ paper.] — Preceding unsigned comment added by 92.26.54.178 (talk) 09:15, 11 September 2018 (UTC)