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: 26 Jan 93 13:35:13 GMT
From: drodman@hotel.mitre.org (David B Rodman)
Subject: Re: Programs wanted
Message-ID: <1993Jan26.133513.5440@linus.mitre.org>
List-Id: <comp.lang.ada>

In article <1993Jan25.180334.4567@wvnvms.wvnet.edu> pk115050@wvnvms.wvnet.edu w
rites:
>
>1. Determine the number of nodes and edges that are present in a piece of
>ADA code.
>
>2. Determine the following from a piece of ADA code:
>   A. The number of unique operators.
>   B. The number of unique operands.
>   C. The total number of operators.
>   D. The total number of operands.
>
>Any help will be appreciated.
>

I have to agree with Dave Emery, what you are asking for is alot. I doubt 
that you will be able to find source to do this, however you may find $$$$ tool
s
that will help. You could start with paul@reasoning.com . I understand that the
y 
have a new ada parser for their tool set. There may be other companies providin
g 
similar types of services.

David Rodman
My opinions are my own and not endorsed or sponsored by my employer. Besides wh
o 
would pay for them.