* Re: flowcharts in Ada for McCabe complexity
1996-12-28 0:00 flowcharts in Ada for McCabe complexity Ingrid Biery
@ 1996-12-28 0:00 ` Jamie Schrumpf
0 siblings, 0 replies; 2+ messages in thread
From: Jamie Schrumpf @ 1996-12-28 0:00 UTC (permalink / raw)
In article <32C5CDFD.71DE@ix.netcom.com>, biery@ix.netcom.com says...
>
>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
Do you mean you can't figure out the flowchart for the exception part of the
code, or how the branch to the handler fits in?
Anyway, I worked on a project with the old DMA a couple of years ago where we
put 1 meg SLOC through the McCabe Battlemap toolset. That was quite a learning
experience, I must say.
I don't have my notes at home, but the McCabe site is at http://www.mccabe.com.
Maybe a question put to them would help you out -- if SET isn't a competitor,
that is... ;-)
--
------------------------------------------------------------------------------
Jamie Schrumpf http://www.access.digex.net/~moncomm
Arthur C. Clarke almost got it right -- what he should have said was:
"Any sufficiently advanced technology is indistinguishable from God."
^ permalink raw reply [flat|nested] 2+ messages in thread
* flowcharts in Ada for McCabe complexity
@ 1996-12-28 0:00 Ingrid Biery
1996-12-28 0:00 ` Jamie Schrumpf
0 siblings, 1 reply; 2+ messages in thread
From: Ingrid Biery @ 1996-12-28 0:00 UTC (permalink / 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
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~1996-12-28 0:00 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1996-12-28 0:00 flowcharts in Ada for McCabe complexity Ingrid Biery
1996-12-28 0:00 ` Jamie Schrumpf
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox