From: Ingrid Biery <biery@ix.netcom.com>
Subject: flowcharts in Ada for McCabe complexity
Date: 1996/12/28
Date: 1996-12-28T14:50:16-08:00 [thread overview]
Message-ID: <32C5CDFD.71DE@ix.netcom.com> (raw)
I am trying to compute the McCabe cyclomatic complexity for some Ada
programs I've written, and I can't figure out how to draw the flowchart
for an exception handler.
Does anyone have any experience with this, or can someone point me to a
reference (website, article, book, whatever) that can help me? Either
with Ada specific discussion of McCabe complexity, or just Ada specific
flowcharting.
Thanks for any help,
Ingrid
----------------------------------------------------------------------
Ingrid Biery Software Engineering Technology
ingrid@cs.utk.edu ingrid@toolset.com
http://www.cs.utk.edu/~ingrid http://www.toolset.com/set.html
next reply other threads:[~1996-12-28 0:00 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1996-12-28 0:00 Ingrid Biery [this message]
1996-12-28 0:00 ` flowcharts in Ada for McCabe complexity Jamie Schrumpf
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox