Databases
StackOverflow2013
Postsdbo
POWhy will this recursive regex only match when a character repeats 2^n - 1 times?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POWhy will this recursive regex only match when a character repeats 2^n - 1 times?
    primarykey
    data
    text
    <p>After reading <a href="https://stackoverflow.com/users/276101/polygenelubricants">polygenelubricants</a>'s series of articles on advanced regular expressions techniques (particularly <a href="https://stackoverflow.com/questions/3664881/how-does-this-java-regex-detect-palindromes">How does this Java regex detect palindromes?</a>), I decided to attempt to create my own PCRE regex to parse a palindrome, using recursion (in PHP).</p> <p>What I came up with was:</p> <pre><code>^(([a-z])(?1)\2|[a-z]?)$ </code></pre> <p>My understanding of this expression is that it should either match zero or one characters (every string of less than 2 characters is implicitly a palindrome, as well as to account for palindromes with odd lengths in the recursion), or two of the same character separated by a recursion of the pattern.</p> <p>Unfortunately, it does not seem to be working that way, as you can see at <a href="http://www.ideone.com/a9T3F" rel="nofollow noreferrer">www.ideone.com/a9T3F</a>. Instead, only the strings of 2<sup>n</sup> - 1 (ie. empty string, <code>a</code>, <code>aaa</code>, <code>aaaaaaa</code>, <em>a</em><sup>15</sup>) repeated characters match the regular expression.</p> <p>Oddly, if I modify my pattern so that the recursion is optional (ie. <code>^(([a-z])(?1)?\2|[a-z]?)$</code>, see <a href="http://www.ideone.com/D6lJR" rel="nofollow noreferrer">www.ideone.com/D6lJR</a>, it only matches strings with a character repeated 2<sup>n</sup> times (ie. empty string, <code>a</code>, <code>aa</code>, <code>aaaa</code>, <code>aaaaaaaa</code>, <em>a</em><sup>16</sup>).</p> <p>Why is my regex not working the way I expect it to?</p> <p><strong>Note for the people who are itching to suggest not to use regex:</strong><br />The point of this question is to learn how to use recursive regular expressions properly. I know that this is not an effective way to determine if a string is a palindrome, and I wouldn't use a recursive regex if I for some reason had to determine palindromes in production code; I am just interested in learning more about the advanced aspects of regex.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCommunity
    1. USDaniel Vandersluis
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POWhy will this recursive regex only match when a character repeats 2^n - 1 times?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POWhy will this recursive regex only match when a character repeats 2^n - 1 times?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POWhy will this recursive regex only match when a character repeats 2^n - 1 times?
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload