Talk:Linear code sequence and jump

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
???	This article has not yet received a rating on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.

Layout Update

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

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)[reply]

Yes, he is wrong. An LCSAJ can contain a number of decision points (on average, 4) but at each of them control flie 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.]