Re: Tool to Measure the Complexity of PL/SQL

Graphing PL/SQL code using nodes and edges should be fairly easy to do by hand, unless the code runs to more than a few thousand lines. There is typically not a lot of branching activity or calls in the PL/SQL programs that I have seen, which might make computing a cyclomatic complexity factor more of an interesting exercise than an activity that will yield useful results. Two reasons to determine a program's cyclomatic complexity factor are finding out how testable the program is and how maintainable the code is.

sammy_6_at_my-deja.com wrote:

> Does any one know of a tool to measure the cyclomatic complexity of
> PL/SQL. I am not concerned with the complexity of the sql cursors
> (i.e. the select, insert, update statement) as these are a database
> design issue.
> I have measured the cyclomatic complexity of Pro*C programs by
> stripping out the PRO*C statements and measuring the complexity of the
> pure 'C' code using a 'C' metrics tool. This has given me a good
> qualitative measurement of how good our programmers are, how much
> testing is required etc. I now need the same for PL/SQL. Any help ?
>
> Sent via Deja.com http://www.deja.com/
> Before you buy.
Received on Fri Dec 31 1999 - 22:07:04 CET