Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

tac|rev|perl

by BooK (Curate)
on Feb 16, 2001 at 06:50 UTC ( #58776=obfuscated: print w/ replies, xml ) Need Help??

Kickstart said something about s$x$y$g in the CB, and palindromes quickly became the topic (I guess my talking about y$x$y$ didn't help).

Anyway, here is my first try at a piece of code you can run through perl or tac|rev|perl... It's not symmetrical, and it does different (and rather poor) stuff each time. Call it proof of concept... and enjoy.

;;sub a;q;;;$_=a $;=$y=x;$x=y;;;; y$x,$y$;qq tnirp ;,mit;print,q;}{ _ bus;;sub a{$_[ 0].$/}s q;/q\/q;

P.S.: This seems to have B::Deparse enter an infinite loop if you try to deparse the script.

Comment on tac|rev|perl
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://58776]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2015-07-06 04:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (70 votes), past polls