Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer


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.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: obfuscated [id://58776]
Approved by root
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2016-12-06 04:29 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (100 votes). Check out past polls.