|XP is just a number|
Re: Cyclomatic Complexity of Perl codeby pernod (Chaplain)
|on Dec 08, 2004 at 09:39 UTC||Need Help??|
I would like to be able to calculate the Cyclomatic Complexity of some Perl code.
Don't get me wrong. Software metrics, properly used and configured, are great tools. The question is; is cyclomatic complexity what you really need?
BrowserUk has given lots of reasons for not using this metric on dynamic languages, and I agree wholeheartedly with him. I would suggest looking for other metrics first before this one, starting with test coverage (as mentioned already in this thread). A super search on Devel::Cover will give you lots of useful information.
A look at Tom Gilb's work on evolutionary programming and measurable requirements might also be a good idea. Gilb is a loudmouth, but many of his ideas are sound.
I know this does not answer your question, but I hope it will give some food for thought. Good luck measuring!