From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.5-pre1 Date: 24 May 93 00:33:02 GMT From: mole-end!mat@uunet.uu.net Subject: Re: McCabe package for Ada? Message-ID: <1993May24.003302.27291@mole-end.matawan.nj.us> List-Id: In article <1993May19.220953.20443@sparky.imd.sterling.com>, dwb@IMD.Sterling.C OM (David Boyd) writes: > In article , groleau@e7sa.crd.ge.com (Wes Grolea u > X7574) writes: > Actually the McCabe folks have come up with some metrics for just > that situation. ... pathological complexity (pv(G)) > which measures those truely awfull conditions in code > such as branches into loops or decisions. You know the stuff you shoot > people for or would only expect from a 10 year olds first program. I'm curious: has anyone run it on Duff's Device? -- (This man's opinions are his own.) From mole-end Mark Terribile mat@mole-end.matawan.nj.us, Somewhere in Matawan, NJ