Cyclomatic Complexity

William C. Cox bcox@windriver.com
Sat Feb 19 07:49:00 GMT 2000


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!

 


More information about the Gcc mailing list