Databases
StackOverflow2013
Postsdbo
POCreate set of all possible matches for a given regex
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POCreate set of all possible matches for a given regex
    primarykey
    data
    text
    <p><strong>I'm wondering how to find a set of all matches to a given regex with a finite number of matches.</strong></p> <p>For example:</p> <p><em>All of these example you can assume they start with <code>^</code> and end with <code>$</code></em></p> <pre><code>`hello?` -&gt; (hell, hello) `[1-9][0-9]{0,3}` -&gt; (1,2,3 ..., 9998, 9999) `My (cat|dog) is awesome!` -&gt; (My cat is awesome!, My dog is awesome!) `1{1,10}` -&gt; (1,11, ..., 111111111, 1111111111) `1*` -&gt; //error `1+` -&gt; //error `(1|11){2}` -&gt; (1,11,111,1111) //notice how it doesn't repeat any of the possibilities </code></pre> <p>I'd also be interested if there was a way of retrieving count a unique a solutions to the regex or if there is a way to determine if the regex has a finite solutions.</p> <p>It would be nice if the algorithm could parse any regex, but a powerful enough subset of the regex would be fine.</p> <p>I'm interested in a PHP solution to this problem, but other languages would also be fine.</p> <p>EDIT:</p> <p>I've learned in my Formal Theory class about <a href="http://en.wikipedia.org/wiki/Deterministic_finite-state_machine" rel="nofollow noreferrer">DFA</a> which can be used to implement regex (and other regular languages). If I could transform the regex into a DFA the solution seems fairly straight forward to me, but that transformation seems rather tricky to me.</p> <p>EDIT 2:</p> <p>Thanks for all the suggestions, <a href="https://stackoverflow.com/questions/7614962/create-set-of-all-possible-matches-for-a-given-regex#7656789">see my post about the public github project</a> I'm working on to "answer" this question.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCommunity
    1. USKendall Hopkins
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    3. PL
      singulars
      1. LTLinked
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POCreate set of all possible matches for a given regex
      1. USBilly Moon
      1. VTFavorite
    2. VO
      singulars
      1. POCreate set of all possible matches for a given regex
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POCreate set of all possible matches for a given regex
      1. This table or related slice is empty.
      1. VTUpMod
    1. COGreat question. I imagine something that could do this would be very useful for unit-testing.
      singulars
      1. POCreate set of all possible matches for a given regex
      1. USFtDRbwLXw6
    2. CO@drrcknlsn That was one of my thoughts, I was thinking of using it to generate a complete cache for a regex based routing system for a MVC.
      singulars
      1. POCreate set of all possible matches for a given regex
      1. USKendall Hopkins
    3. COYou are assuming implicit anchors. It is easy to show all possible ways of matching a given string. For example, given "Hello world", the pattern `/hel+o?/i` matches Hello, Hell, and Hel. That is not the same as generation, though.
      singulars
      1. POCreate set of all possible matches for a given regex
      1. UStchrist
 

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