home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.ada
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!howland.reston.ans.net!spool.mu.edu!agate!linus!linus.mitre.org!hotel.mitre.org!drodman
- From: drodman@hotel.mitre.org (David B Rodman)
- Subject: Re: Programs wanted
- Message-ID: <1993Jan26.133513.5440@linus.mitre.org>
- Sender: news@linus.mitre.org (News Service)
- Nntp-Posting-Host: hotel.mitre.org
- Organization: The Mitre Corporation - Reston, VA
- References: <1993Jan25.180334.4567@wvnvms.wvnet.edu>
- Date: Tue, 26 Jan 1993 13:35:13 GMT
- Lines: 24
-
- In article <1993Jan25.180334.4567@wvnvms.wvnet.edu> pk115050@wvnvms.wvnet.edu writes:
- >
- >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 $$$$ tools
- that will help. You could start with paul@reasoning.com . I understand that they
- have a new ada parser for their tool set. There may be other companies providing
- similar types of services.
-
- David Rodman
- My opinions are my own and not endorsed or sponsored by my employer. Besides who
- would pay for them.
-
-