L
LovesHisLittleShad
Is it my imagination, or is Perl a million times harder than other
languages? Looking at books on all the languages of the past (I'm a
programmer), I've notices that Perl is the only one that seems greek
in most chapters, with very little explanation of what the people are
doing.
Am I wrong, or does the Perl language literally attract the wizards of
the world to it, more than other languages? Consider the following
code someone wrote that I found on a web site:
not exp log srand xor s qq qx xor
s x x length uc ord and print chr
ord for qw q join use sub tied qx
xor eval xor print qq q q xor int
eval lc q m cos and print chr ord
for qw y abs ne open tied hex exp
ref y m xor scalar srand print qq
q q xor int eval lc qq y sqrt cos
and print chr ord for qw x printf
each return local x y or print qq
s s and eval q s undef or oct xor
time xor ref print chr int ord lc
foreach qw y hex alarm chdir kill
exec return y s gt sin sort split
Run it and see what it does. How in the world did someone come up
with this?
Who are these people?
languages? Looking at books on all the languages of the past (I'm a
programmer), I've notices that Perl is the only one that seems greek
in most chapters, with very little explanation of what the people are
doing.
Am I wrong, or does the Perl language literally attract the wizards of
the world to it, more than other languages? Consider the following
code someone wrote that I found on a web site:
not exp log srand xor s qq qx xor
s x x length uc ord and print chr
ord for qw q join use sub tied qx
xor eval xor print qq q q xor int
eval lc q m cos and print chr ord
for qw y abs ne open tied hex exp
ref y m xor scalar srand print qq
q q xor int eval lc qq y sqrt cos
and print chr ord for qw x printf
each return local x y or print qq
s s and eval q s undef or oct xor
time xor ref print chr int ord lc
foreach qw y hex alarm chdir kill
exec return y s gt sin sort split
Run it and see what it does. How in the world did someone come up
with this?
Who are these people?