This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Cyclomatic Complexity
- To: "Washburn, John" <Washburn dot John at mbco dot com>
- Subject: Re: Cyclomatic Complexity
- From: "William C. Cox" <bcox at windriver dot com>
- Date: Sat, 19 Feb 2000 07:49:05 -0800
- CC: egcs at egcs dot cygnus dot com
Hi John,
I wrote one of these years ago. The effort is indeed minor,
once you have a running compiler (we did ours from scratch).
Contrary to all the graphical pictures, you don't need a
program flow graph for a C or Pascal-like language; the
tokens seen by the lexer are enough information, with a
little parser work. We compared our output with an official
McCabe tool (McCabe originated the concept) and got the
same results...
Go for it!