I came up with this recursive-regex code. It's a bit simpler than most of the others posted here. It finds the leftmost longest palindrome in each line.
my $palin_re;
$palin_re = qr/(([a-z]) # First letter
[^a-z]* # any irrelevant chars
(?:(??{$palin_re})|[a-z]?) # The interior
[^a-z]* # any other irrelevant chars
\2) # the last letter matches the first
/xi;
while (<DATA>) {
if (/\b$palin_re\b/) {
print "Matched $1\n";
}
else {
print "No palindrome found in '$_'\n";
}
}
__DATA__
oo
madam in eden, I'm Adam, prince of eternia
is god a dog?
nested testest detsen nested
i prefer pi ip referp
nothing to see here, folks.
Caution: Contents may have been coded under pressure.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|