Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re: Cyclomatic Complexity of Perl code

by dragonchild (Archbishop)
on Dec 08, 2004 at 13:26 UTC ( [id://413191]=note: print w/replies, xml ) Need Help??


in reply to Cyclomatic Complexity of Perl code

On the Software Design mailing list, we've been discussing this exact topic1. One of our members has written PPI, which does a good (but not perfect) job of parsing Perl code. From that, we're starting to work on a way of determining complexity. Of course, we're still arguing on what determines "complexity", but that's the fun part! :-)

We'd really love to have you, or anyone else, join us.

  1. Without the nifty-keen name for it!

Being right, does not endow the right to be rude; politeness costs nothing.
Being unknowing, is not the same as being stupid.
Expressing a contrary opinion, whether to the individual or the group, is more often a sign of deeper thought than of cantankerous belligerence.
Do not mistake your goals as the only goals; your opinion as the only opinion; your confidence as correctness. Saying you know better is not the same as explaining you know better.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://413191]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (3)
As of 2024-04-18 22:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found