GREG: Check out Kurt Starsinic's B::Fathom module
This is what John Tobey's latest code scores:
$ perl -MO=Fathom -le'$_=1;for$n(2..9){s/\S+/$&$n $&+$n
$&*$n/g}2002-eval||print for split'
48 tokens
15 expressions
7 statements
1 subroutine
readability is 2.92 (very readable)
----- Original Message -----
From: <[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Thursday, October 10, 2002 5:16 PM
Subject: Re: [Boston.pm] question & puzzle
> Chris Devers wrote:
> > Clearly we need more puzzles around here :)
>
> Someone needs to write a code analysis
> tool to measure the complexity and
> general unreadability of a piece of
> perl code.
>
> Then, when these kinds of puzzles come up,
> people can compete to have the most readable
> code, rather than the shortest, and most
> useless version of the code.
>
> Greg
> _______________________________________________
> Boston-pm mailing list
> [EMAIL PROTECTED]
> http://mail.pm.org/mailman/listinfo/boston-pm
>
_______________________________________________
Boston-pm mailing list
[EMAIL PROTECTED]
http://mail.pm.org/mailman/listinfo/boston-pm
