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: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Tools
Date: 1996/12/18
Message-ID: <dewar.850943274@merv>#1/1
X-Deja-AN: 204814000
references: <5942ok$p9s@mill.gdls.com>
 <32B6D316.2F1C@velveeta.apdev.cs.mci.com>
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-12-18T00:00:00+00:00
List-Id: <comp.lang.ada>


Jim Rogers says

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


I don't think this can possibly be true. Dynamic dispatching is semantically
equiavlent to a series of calls protected by conditoinals, and it would seem
that any methodology which could not handle:


   if a then call-b
   elsif b then call-c
   ...


is too limited to be useful.