Re: flowcharts in Ada for McCabe complexity

[jamie@dcd00745.slip.digex.net (Jamie Schrumpf)]

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."