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,34349f11b6d01b2 X-Google-Attributes: gid103376,public From: James Rogers Subject: Re: Tools Date: 1996/12/17 Message-ID: <32B6D316.2F1C@velveeta.apdev.cs.mci.com>#1/1 X-Deja-AN: 204733181 references: <5942ok$p9s@mill.gdls.com> content-type: text/plain; charset=us-ascii organization: MCI Telecommunications Colorado Springs, CO mime-version: 1.0 newsgroups: comp.lang.ada x-mailer: Mozilla 2.0 (X11; I; AIX 2) Date: 1996-12-17T00:00:00+00:00 List-Id: Art Schwarz wrote: > I'm interested in reading articles which describe what the complexity metric > for Ada is; what constructs are used and supported. the weight each has and > how the construct participates in control flow graph formation. I am also > interested in any freeware, shareware, commercialware which supports the return > of the complexity metric of a module along with the control-flow graph used to > form the complexity metric. I assume this means that you will not be using any tagged types. Run-time dispatching makes Cyclomatic Complexity calculations very difficult. There is no static analysis which can tell which subprogram will be called via dynamic dispatching. -- Jim Rogers ************************************************************* Team Ada