From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,791b3f1b4bcfda0a,start X-Google-Attributes: gid103376,public From: Ingrid Biery Subject: flowcharts in Ada for McCabe complexity Date: 1996/12/28 Message-ID: <32C5CDFD.71DE@ix.netcom.com>#1/1 X-Deja-AN: 206479855 content-type: text/plain; charset=us-ascii organization: Netcom x-netcom-date: Sat Dec 28 2:50:16 PM PST 1996 mime-version: 1.0 newsgroups: comp.lang.ada x-mailer: Mozilla 2.01E-NC250 (Win95; U; 16bit) Date: 1996-12-28T14:50:16-08:00 List-Id: 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