42
\$\begingroup\$

Notice: Following popular demand I have slightly relaxed the rules:

  • The maximum regex size grows by 1 byte every 5 answers. Answer N may use up to 29 + ⌈N/5⌉ bytes.
  • The score of each answer will be (M/(30+N/5))N

In regex golf, you're given two sets of strings, and are asked to create the shortest regex which matches all strings in the first set, but fails on all strings in the second set.

That is what we're going to do, but each time someone answers, their regex itself will be added to one of the two sets of strings (of their own choice). Therefore, there is a strict order to answers in this challenge.

Let's go through an example:

  • Say I start this with abc (which I won't), and put it in the match set.
  • Then a valid second answer would be a, as it matches the above (and there are no strings that need to fail yet). Say this answer goes in the fail set.
  • Now the third answer has to match abc but fail on a. A possible third answer is therefore b. Let's put this in the match set.
  • The fourth answer now has to match abc and b, but fail on a. We'll disallow duplicate answers, so a valid regex would be c|b.

What's important is that your answer should be as short as possible. This may be trivial for the first few answers, but once we get a few answers, it should get harder and harder to get the desired match in as few characters as possible.

For the actual challenge, initially the match set contains PPCG and the fail set contains [PPCG], and I have already provided the first answer.

Answering

The key thing to understand about this challenge is that only one person can answer at a time and each answer depends on the one before it.

There should never be two answers with the same N. If two people happen to simultaneously answer for some N, the one who answered later (even if it's a few seconds difference) should graciously delete their answer.

To make this run a bit smoother, try to stick to the following steps when posting your answer:

  • Make sure that someone has independently verified the correctness of the previous answer (and left a corresponding comment).
  • Take the two test sets found in the previous answer, and write a regex which matches all strings in one set and none in the other.
  • Post your answer in the following format:

    # N. [regex flavour] - [regex size in bytes]
    
        [regex]
    
    [link to online regex tester]
    
    [notes, explanation, observations, whatever]
    
    ### The next answer has to match the following strings:
    
        [match set]
    
    ### And fail on these strings:
    
        [fail set]
    

    where N is the number of your answer. Please copy [match set] and [fail set] from the previous answer, and append your regex to one of them.

    This is absolutely vital to the challenge! I've provided a dashboard tool for the challenge to help with the bookkeeping, and it relies on the above template. (See bottom of the post.)

  • Another user should now review your submission and leave a comment "Correctness verified" if your answer follows all the rules (see below). If it doesn't, they should leave a comment pointing out any flaws. You've then got 15 minutes to fix those issues. If you don't, your answer will be deemed invalid, should be deleted, and someone else may post a follow-up answer to the previous one. (If this happens, you're free to submit a new answer any time.)

These regulations may seem rather strict, but they are necessary to avoid invalid answers somewhere up the chain.

Rules

  • A user may only submit one answer per 4 hour period. (This is to prevent users from constantly watching the question and answering as much as possible.)
  • A user may not submit two answers in a row. (e.g. since I submitted answer 1 I can't do answer 2, but I could do 3.)
  • Do not edit answers that have been verified. (Even if you find a way to shorten it!)
  • Should a mistake be discovered earlier in the chain (i.e. after follow-up answers have been posted), the offending answer should be deleted and will be removed from the set of strings that new submissions should fail on. However, all answers that have been posted since should not be changed to reflect.
  • Clearly state one flavour your regex is valid in. You may choose any flavour that is freely testable online. There's a good list of online testers over on StackOverflow. In particular, Regex101 and RegexPlanet should be useful, as they support a wide variety of flavours. Please include a link to the tester you chose in your answer. By switching on the global and multiline modifiers in the tester, you can test all strings at once, one on each line (these modifiers are not counted towards your regex size, because they aren't needed on any individual string).
  • Your regex must not be empty.
  • Your regex for answer N must not be longer than 29 + ⌈N/5⌉ bytes. I.e. answers 1 to 5 may use up to 30 bytes (inclusive), answers 6 to 10 may use up to 31 bytes... answers 31 to 35 may use up to 36 bytes. Check the dashboard to see how many characters the next answer may use.
  • Your regex must not be identical to any string in either test set.
  • Do not include delimiters in your submission or byte count, even if the relevant host language uses them. If your regex uses modifiers, add one byte per modifier to the regex size. E.g. /foo/i would be 4 bytes.

Scoring

Each answer's score is calculated as (M/(30+N/5))N, where M is the size of the regex in bytes, and N is it's number. Each user's score is the product of all their answers. The user with the lowest overall score wins. In the unlikely event of a tie, the user with the latest submission wins. I will accept that user's latest answer.

If you prefer summing scores, you can calculate each answer's score as N * (log(M) - log(30)) and sum those up over all answers. That will give the same leaderboard order.

There is no need to include an answer's score in the answer, just report M. The challenge dashboard at the bottom of the question will compute the scores, and in the event of two very close scores, I'll double check the results using arbitrary-precision types.

Note that the score of each answer is less than 1, so you can improve your overall score by providing a new answer. However, the shorter each of your submissions, the more efficiently you can lower your score. Furthermore, later answers can achieve a lower score although being longer, due to the increasing exponent.

Dashboard

I've written a little Dashboard tool, using Stack Snippets, based on Optimizer's work over here. I hope this will help us get some order into these answer-dependent challenges.

This will display the current status of the challenge - in particular, if there are conflicting answers, if an answer needs to be verified, or if the next answer can be posted.

It also produces a list of all answers with scores, as well as a leaderboard of all users. Please stick to the challenge format above, so the dashboard can read out the relevant strings from your answers. Otherwise you might not be included in the leaderboard.

Please let me know (ideally in chat) if you spot any bugs or have some ideas how the usefulness of the tool could be improved.

function answersUrl(e){return"http://api.stackexchange.com/2.2/questions/"+QUESTION_ID+"/answers?page="+e+"&pagesize=100&order=desc&sort=creation&site=codegolf&filter="+ANSWER_FILTER}function commentsUrl(e,t){return"http://api.stackexchange.com/2.2/answers/"+e+"/comments?page="+t+"&pagesize=100&order=asc&sort=creation&site=codegolf&filter="+COMMENT_FILTER}function getAnswers(){$.ajax({url:answersUrl(page++),method:"get",dataType:"jsonp",crossDomain:true,success:function(e){answers.push.apply(answers,e.items);if(e.has_more)getAnswers();else{page=1;getFinalComments()}}})}function getFinalComments(){answers=answers.filter(shouldHaveHeading);answers=answers.filter(shouldHaveScore);$.ajax({url:commentsUrl(answers[0].answer_id,page++),method:"get",dataType:"jsonp",crossDomain:true,success:function(e){comments.push.apply(comments,e.items);if(e.has_more)getAnswers();else process()}})}function shouldHaveHeading(e){var t=false;try{t|=/^(#|&lt;h).*/.test(e.body_markdown);t|=["-","="].indexOf(e.body_markdown.split("\n")[1][0])>-1}catch(n){}return t}function shouldHaveScore(e){var t=false;try{t|=SIZE_REG.test(e.body_markdown.split("\n")[0])}catch(n){}return t}function findDuplicates(e){var t=false;var n={};e.forEach(function(e){var r=e.body_markdown.split("\n")[0].match(NUMBER_REG)[0];if(n[r])t=t||r;n[r]=true});return t}function hasBeenVerified(e,t){var n=false;t.forEach(function(t){n|=/correctness verified/i.test(t.body_markdown)&&e!=t.owner.user_id});return n}function userTimedOut(e){return NOW-e.creation_date*1e3<MSEC_PER_ANSWER}function getAuthorName(e){return e.owner.display_name}function getAnswerScore(e,t){e=parseInt(e);t=parseInt(t);return Math.pow(t/(30+e/5),e)}function process(){$("#last-user").append(answers[0].owner.display_name);var e=answers.slice(1).filter(userTimedOut).map(getAuthorName).join(", ");if(e)$("#timed-out-users").append(e);else $("#timed-out-notice").hide();var t=answers[0].body_markdown.split("\n")[0].match(NUMBER_REG)[0];var n=findDuplicates(answers);if(n){var r=$("#status-conflict-template").html();$("#challenge-status").append(r.replace("{{NUMBER}}",n));$("#challenge-status").addClass("conflict")}else if(!hasBeenVerified(answers[0].owner.user_id,comments)){var r=$("#status-verification-template").html();$("#challenge-status").append(r.replace("{{NUMBER}}",t));$("#challenge-status").addClass("verification")}else{var r=$("#status-next-template").html();$("#challenge-status").append(r.replace("{{NUMBER}}",t).replace("{{NEXT}}",parseInt(t)+1).replace("{{SIZE}}",29+Math.ceil((parseInt(t)+1)/5)));$("#challenge-status").addClass("next")}var i={};var s={};answers.forEach(function(e){var t=e.body_markdown.split("\n")[0];var n=$("#answer-template").html();var r=t.match(NUMBER_REG)[0];var o=(t.match(SIZE_REG)||[0])[0];var u=getAnswerScore(r,o);var a=getAuthorName(e);n=n.replace("{{NAME}}",a).replace("{{NUMBER}}",r).replace("{{SIZE}}",o).replace("{{SCORE}}",u.toExponential(5)).replace("{{LINK}}",e.share_link);n=$(n);$("#answers").append(n);i[a]=(i[a]||1)*u;s[a]=(s[a]||0)+1});var o=[];for(var u in i)if(i.hasOwnProperty(u)){o.push({name:u,numAnswers:s[u],score:i[u]})}o.sort(function(e,t){return e.score-t.score});var a=1;o.forEach(function(e){var t=$("#user-template").html();t=t.replace("{{NAME}}",e.name).replace("{{NUMBER}}",a++).replace("{{COUNT}}",e.numAnswers).replace("{{SCORE}}",e.score.toExponential(5));t=$(t);$("#users").append(t)})}var QUESTION_ID=41462;var ANSWER_FILTER="!*cCFgu5yS6BFQP8Z)xIZ.qGoikO4jB.Ahv_g-";var COMMENT_FILTER="!)Q2B_A497Z2O1kEH(Of5MUPK";var HOURS_PER_ANSWER=4;var MSEC_PER_ANSWER=HOURS_PER_ANSWER*60*60*1e3;var NOW=Date.now();var answers=[],comments=[],page=1;getAnswers();var SIZE_REG=/\d+(?=[^\d&]*(?:&lt;(?:s&gt;[^&]*&lt;\/s&gt;|[^&]+&gt;)[^\d&]*)*$)/;var NUMBER_REG=/\d+/
body{text-align:left!important}#challenge-status{font-weight:700;padding:10px;width:620px}#blocked-users{padding:10px;width:620px}.conflict{background:#994343;color:#fff}.verification{background:#FFDB12}.next{background:#75FF6E}#last-user,#timed-out-users{font-weight:700}#answer-list{padding:10px;width:300px;float:left}#leaderboard{padding:10px;width:290px;float:left}table thead{font-weight:700}table td{padding:5px}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <link rel="stylesheet" type="text/css" href="//cdn.sstatic.net/codegolf/all.css?v=83c949450c8b"> <div id="challenge-status"> </div><div id="blocked-users"> User <span id="last-user"></span> has posted the last answer, and may not post the next one. <div id="timed-out-notice"><span id="timed-out-users"></span> have answered within the last four hours and may not answer again yet. (If a user appears in this list twice, they must have answered twice within four hours!)</div></div><div id="answer-list"> <h2>List of Answers (newest first)</h2> <table class="answer-list"> <thead> <tr><td>No.</td><td>Author</td><td>Size</td><td>Score</td></tr></thead> <tbody id="answers"> </tbody> </table> </div><div id="leaderboard"> <h2>Leaderboard</h2> <table class="leaderboard"> <thead> <tr><td>No.</td><td>User</td><td>Answers</td><td>Score</td></tr></thead> <tbody id="users"> </tbody> </table> </div><table style="display: none"> <tbody id="answer-template"> <tr><td>{{NUMBER}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td>{{SCORE}}</td><td><a href="{{LINK}}">Link</a></td></tr></tbody> </table> <table style="display: none"> <tbody id="user-template"> <tr><td>{{NUMBER}}</td><td>{{NAME}}</td><td>{{COUNT}}</td><td>{{SCORE}}</td></tr></tbody> </table> <div id="status-conflict-template" style="display: none"> There is more than one answer with number {{NUMBER}}!<br>Please resolve this conflict before posting any further answer. </div><div id="status-verification-template" style="display: none"> Answer {{NUMBER}} has not been verified!<br>Please review the answer and post a comment reading "Correctness verified." on the answer if it is valid. Note that this has to be done by a different user than the author of the answer! </div><div id="status-next-template" style="display: none"> Answer {{NUMBER}} has been verified!<br>You may now post answer {{NEXT}}, using up to {{SIZE}} bytes. </div>

\$\endgroup\$
  • \$\begingroup\$ The rules turned out to be a bit stricter than I intended. After some discussion in chat I'm considering to relax the rules a little after the bounty has run out. I'll post 3 comments for the options I can think of below. Please indicate your preference by voting on the comments. \$\endgroup\$ – Martin Ender Nov 22 '14 at 12:36
  • 2
    \$\begingroup\$ Rules are rules. Don't change them. It might be a shame that it's pretty much impossible to post another answer, but that doesn't justify changing the rules. \$\endgroup\$ – Martin Ender Nov 22 '14 at 12:37
  • 2
    \$\begingroup\$ Allow for an additional byte every 10 answers. Correspondingly, change the answer score to (M/(30+N/10))^N. This would be applied retroactively, so the next answer could use up to 32 bytes. The change in scoring would not affect the top two places on the leaderboard, but the other users would be shuffled somewhat. \$\endgroup\$ – Martin Ender Nov 22 '14 at 12:38
  • 8
    \$\begingroup\$ Allow for an additional byte every 5 answers. Correspondingly, change the answer score to (M/(30+N/5))^N. This would be applied retroactively, so the next answer could use up to 35 bytes. The change in scoring would not affect the top two places on the leaderboard, but the other users would be shuffled somewhat. \$\endgroup\$ – Martin Ender Nov 22 '14 at 12:39
  • 4
    \$\begingroup\$ You people are strange and twisted. Why would you do this to yourselves? (It's fun to read though :P) \$\endgroup\$ – Joe Nov 25 '14 at 12:06

42 Answers 42

5
\$\begingroup\$

42. Python flavour - 38

\?[^w$]*\$$|^P|\w.\)|w.?\+|w\^|[^?P]P$

Tested on Regex101

The lack of entropy in the last few answers was getting to me... (should have done this sooner)

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)
\?[^w$]*\$$|[]^C]\w+$|w\^|\|..\)
\w.\)|\?[^-$]*\$$|[]^C]\w$|w[+^]
[]^C]\w$|\w.\)|-\$|w[+^]|\?[^w$]*\$$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
^...[3w!G)]|^[^\\C|]*$|G.?.?\)
^[^C\\|]+$|G.\)|\.\)|w\^|^P|\...?]
^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)
\?[^$w]*\$$|[]C^]\w$|w.]|\w.\)
\$..\\|\?[^w$]*\$$|w\^|[]^C]\w$
[]^C]\w$|\w.\)|w[[+^]|\?[^w$]*\$$
\?[^w$]*\$$|^P|\w.\)|w.?\+|w\^|[^?P]P$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 29 '14 at 18:30
  • \$\begingroup\$ My program struggles to find an answer less than 45 characters long... \$\endgroup\$ – Vi. Dec 2 '14 at 7:20
  • \$\begingroup\$ @Vi. Well I can say that a 38 solution does exist at least, but of course it'd be interesting if someone manages to get lower :) \$\endgroup\$ – Sp3000 Dec 2 '14 at 7:54
11
\$\begingroup\$

28. Python flavour - 29

\.\)|P[.$?]|w\^|^[^|C\\]*$|^P

Tested on Regex101

Lots of fiddling around was done - #4 in the pass set's probably the biggest pain, as it's a substring of a regex in the fail set, and also shares a suffix with another regex in the fail set.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 15 '14 at 12:52
9
\$\begingroup\$

24 - Python flavour - 29

^(..[^^].{4,22}\$|[^?]+\w)$|2

Tested here

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – feersum Nov 14 '14 at 13:22
8
\$\begingroup\$

10. Python flavor - 19

^[\w^]*$|!|]P|G]\$$

Tested on Regex101.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)*[^\\|]*[^\]]$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – FryAmTheEggman Nov 13 '14 at 22:00
8
\$\begingroup\$

8. ECMAScript flavour - 14 bytes

[^?][PG]$|<|PG

Demo

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – FryAmTheEggman Nov 13 '14 at 21:00
  • \$\begingroup\$ Fixed the demo link. \$\endgroup\$ – Martin Ender Nov 13 '14 at 23:57
  • \$\begingroup\$ @FryAmTheEggman The script does read the comments, but only looks for "correctness verified" as a substring (ignoring case). \$\endgroup\$ – Martin Ender Nov 14 '14 at 0:20
  • \$\begingroup\$ @MartinBüttner Thanks, good to know. \$\endgroup\$ – FryAmTheEggman Nov 14 '14 at 0:30
  • 3
    \$\begingroup\$ +1 for singlehandedly making this challenge 10 times harder \$\endgroup\$ – Sp3000 Nov 15 '14 at 13:14
7
\$\begingroup\$

2. ECMAScript flavour - 6 bytes

^[P\^]

Test it here

The next answer has to match the following strings:

PPCG
^P

And fail on these strings:

[PPCG]
^[P\^]
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 13 '14 at 19:19
7
\$\begingroup\$

9. Python flavour - 28

^[^\\|]*(\\\\)*[^\\|]*[^\]]$

Tested on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)*[^\\|]*[^\]]$
\$\endgroup\$
  • \$\begingroup\$ I also found this not to work a minute ago. It requires two backslashes in a row to match so I don't think a flag could save it. \$\endgroup\$ – feersum Nov 13 '14 at 21:34
  • \$\begingroup\$ Whoops.... Should have been a * instead of +. I edited my answer \$\endgroup\$ – ndc5057 Nov 13 '14 at 21:36
  • \$\begingroup\$ Correctness verfied. \$\endgroup\$ – FryAmTheEggman Nov 13 '14 at 21:37
7
\$\begingroup\$

23. PCRE flavour - 28

([^\\}<]{3}|][^]]|^).?[$PG]$

Tested on Regex101.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
\$\endgroup\$
  • \$\begingroup\$ What does [^] do? \$\endgroup\$ – feersum Nov 14 '14 at 12:34
  • \$\begingroup\$ @feersum In most flavours, a ] as the first element of a character class (after optional negation), is just a ] inside the character class and doesn't close (because empty character classes are a bit pointless). So [^]] matches anything but ]. The notable exception is ECMAScript, which does allow empty character classes. In that case [] doesn't match anything, it acts like (?!) and [^] matches any character, which is convenient, because ECMAScript doesn't have an s modifier, and [\s\S] is a pain to type an read. \$\endgroup\$ – Martin Ender Nov 14 '14 at 12:37
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 14 '14 at 12:37
7
\$\begingroup\$

11. Python - 29

^(.{,4}|.{9}|.{16,19}|.{5}P)$

► Test at RegexPlanet

Almost all invalid answers have a different length than all the valid ones. This regex makes use of that.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – feersum Nov 13 '14 at 22:55
7
+100
\$\begingroup\$

29. PCRE flavour - 28

^..(.[!)3G^w]|$)|\^.{7}$|G\)

Tested on Regex101

This answer still works...

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 20 '14 at 15:03
  • 1
    \$\begingroup\$ Nice! Barring reshuffling, that's exactly what I had \$\endgroup\$ – Sp3000 Nov 20 '14 at 19:18
  • \$\begingroup\$ I was trying to calculate this using genetic algorithm, but it produced only 30-character regex... Now running it to get the next answer. Current result - 32 characters. \$\endgroup\$ – Vi. Nov 21 '14 at 4:06
  • \$\begingroup\$ @Vi A genetic algorithm eh, interesting ideas you have there :P \$\endgroup\$ – Sp3000 Nov 21 '14 at 5:33
  • \$\begingroup\$ @Sp3000, Now 30 characters... But another anwser has arrived, so need to restart. \$\endgroup\$ – Vi. Nov 21 '14 at 9:55
6
+100
\$\begingroup\$

31. Perl flavour - 29

[?[CP(].[-<)|w]|^P|^[^C|\\]*$

I don't know how it works, it was produced by my the first foray into genetic algoritms. There is program output that mentions the answer.

The next answer has to match:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)

and to fail:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 24 '14 at 11:35
  • \$\begingroup\$ Ahaha nice - did you use the previous answers as seeds for the population or did it just end up looking like the previous one? \$\endgroup\$ – Sp3000 Nov 24 '14 at 12:00
  • \$\begingroup\$ The passing and failing strings are used as initial building blocks. They hovewer got banned after some time due to being local minimums. You can see how it goes in the program log: the number in parentheses after "metric=" is the measure of how fast we are going forward. It it's low for long, we ban current answers and reset. \$\endgroup\$ – Vi. Nov 24 '14 at 12:06
  • \$\begingroup\$ (Meanwhile, 31-character candidate for next answer is already found) \$\endgroup\$ – Vi. Nov 24 '14 at 12:09
  • \$\begingroup\$ Oh, the limit increased? It's not 29? This way it is not going to end soon... I though the main challenge is to find the last, the ultimate regex. \$\endgroup\$ – Vi. Nov 24 '14 at 13:01
6
\$\begingroup\$

32. PCRE — 30 bytes

^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)

Tested on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 24 '14 at 13:40
  • \$\begingroup\$ Why is it added to "fail" list? It already fails on itself, so can serve as the next answer without modifications. I suppose for each answer there is no choice of to which list it is to be appended. \$\endgroup\$ – Vi. Nov 24 '14 at 14:03
  • 3
    \$\begingroup\$ @Vi. I guess hwnd's feeling nice today \$\endgroup\$ – Sp3000 Nov 24 '14 at 14:04
  • \$\begingroup\$ I'll make it harder as it keeps going. \$\endgroup\$ – hwnd Nov 24 '14 at 14:06
5
\$\begingroup\$

1. ECMAScript flavour - 2 bytes

^P

Test it on Regex101.

The initial matching set is PPCG and the failing set [PPCG]. Therefore, this regex simply tests that the string starts with P.

The next answer has to match the following strings:

PPCG
^P

And fail on these strings:

[PPCG]
\$\endgroup\$
  • 3
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Beta Decay Nov 13 '14 at 19:09
5
\$\begingroup\$

3. ECMAScript flavour - 6 bytes

[^\]]$

Test it here

The next answer has to match the following strings:

PPCG
^P

And fail on the these strings:

[PPCG]
^[P\^]
[^\]]$
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Beta Decay Nov 13 '14 at 19:27
5
\$\begingroup\$

7. Python flavour - 16

(?<!\\..)(?!]).$

Tested on Regex101

Gotta add a \ to the match list :)

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – NinjaBearMonkey Nov 13 '14 at 20:46
  • \$\begingroup\$ This…this is devious. \$\endgroup\$ – wchargin Nov 14 '14 at 6:05
  • \$\begingroup\$ @WChargin Thanks :) You should check out some of user23013 or n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳ answers; some are quite 'devious' ;) \$\endgroup\$ – FryAmTheEggman Nov 14 '14 at 13:43
5
\$\begingroup\$

12. ECMAScript flavor - 17

!|[^?]P(CG|G..)?$

Test it here.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 13 '14 at 23:54
5
\$\begingroup\$

22. PCRE Flavor – 29 bytes

Since the original #22 is not modified for 1 hour I assume it has become invalid.

^.{3,23}[.-~]..\$$|[^P?][PG]$

Demo

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. (And yes, that's right, the previous 22 is now invalid.) \$\endgroup\$ – Martin Ender Nov 14 '14 at 11:00
5
\$\begingroup\$

26. Python flavor - 28

^..(.[!G)(3w^]|.{7}$|$)|\$\?

Test on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 14 '14 at 15:21
5
\$\begingroup\$

30. Python flavour - 28

[[?C(].[-!)|w]|^P|^[^C|\\]*$

Tested on Regex101

When there's a will...

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – jimmy23013 Nov 21 '14 at 7:27
5
\$\begingroup\$

37. Perl flavour - 30

\?[^$w]*\$$|[]C^]\w$|w.]|\w.\)

Submission on Regex101.

The solution was produced by the the same program as before. The program has also printed 29-character solution \?[^$w]*\$|[]^C]\w)$|w.]|\w.\, I don't know why, as it looks like a malformed regex...

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)
\?[^w$]*\$$|[]^C]\w+$|w\^|\|..\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
^...[3w!G)]|^[^\\C|]*$|G.?.?\)
^[^C\\|]+$|G.\)|\.\)|w\^|^P|\...?]
^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)
\?[^$w]*\$$|[]C^]\w$|w.]|\w.\)
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 25 '14 at 10:05
  • \$\begingroup\$ Ahaha I'm pretty annoyed I didn't get this after coming so far with the first half :P \$\endgroup\$ – Sp3000 Nov 25 '14 at 10:11
5
\$\begingroup\$

40. PCRE — 33 bytes

[]^C]\w$|\w.\)|w[[+^]|\?[^w$]*\$$

Tested on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)
\?[^w$]*\$$|[]^C]\w+$|w\^|\|..\)
\w.\)|\?[^-$]*\$$|[]^C]\w$|w[+^]

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
^...[3w!G)]|^[^\\C|]*$|G.?.?\)
^[^C\\|]+$|G.\)|\.\)|w\^|^P|\...?]
^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)
\?[^$w]*\$$|[]C^]\w$|w.]|\w.\)
\$..\\|\?[^w$]*\$$|w\^|[]^C]\w$
[]^C]\w$|\w.\)|w[[+^]|\?[^w$]*\$$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Vi. Nov 25 '14 at 21:14
  • 1
    \$\begingroup\$ I have a 35 but I'm not satisfied with it so I'm going to see if I can get something more interesting \$\endgroup\$ – Sp3000 Nov 27 '14 at 3:39
  • \$\begingroup\$ And I have 3 options for a 32-character answer, but the whole challenge got a bit boring (especially bookkeeping of Regex101 submissions and lists of fail/pass strings). If somebody wants, I can post an answer. \$\endgroup\$ – Vi. Nov 27 '14 at 14:47
4
\$\begingroup\$

4. ECMAScript flavour - 5 bytes

^\^?P

Test it here.

The next answer has to match the following strings:

PPCG
^P

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Beta Decay Nov 13 '14 at 19:34
4
\$\begingroup\$

5. ECMAScript flavour - 6 bytes

^[P^]P

Tested on Regex101.

Time to spice things up a bit with the success set.

The next answer has to match the following strings:

PPCG
^P
^[P^]P

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – FryAmTheEggman Nov 13 '14 at 19:57
4
\$\begingroup\$

6. ECMAScript flavour - 9 bytes

[^?][PG]$

Tested on Regex101.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – FireFly Nov 13 '14 at 19:58
4
\$\begingroup\$

14. PCRE flavour - 25

([.$?]|G\])\$$|^\^?P|\]P$

Tested on Regex101

This is starting to get quite hard.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
\$\endgroup\$
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 14 '14 at 0:23
4
\$\begingroup\$

15. PCRE flavour - 26

([P.$?]\$|[]^]P|G\]\$|CG)$

Tested on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – FireFly Nov 14 '14 at 0:44
4
\$\begingroup\$

16. PCRE flavor - 21

^[^?]*[PG]$|[?$].*\$$

Tested on Regex 101.

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
\$\endgroup\$
  • \$\begingroup\$ It doesn't match PPCG. \$\endgroup\$ – jimmy23013 Nov 14 '14 at 0:55
  • \$\begingroup\$ @user23013 fixed \$\endgroup\$ – es1024 Nov 14 '14 at 1:07
  • \$\begingroup\$ Correctness verified. \$\endgroup\$ – jimmy23013 Nov 14 '14 at 1:41
4
\$\begingroup\$

25. PCRE flavour - 29

^(..[^^].{4,22}\$|[^?]+\w)$|~

Tested here. (The test regex contains an additional \n to make sure that no match spans multiple lines. This is not necessary to match each individual string.)

That was a low-hanging fruit! :) I have to congratulate plannapus though, this regex is amazingly elegant for the current test sets. If you want to upvote this answer, make sure to upvote the previous one, too!

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – feersum Nov 14 '14 at 15:17
4
\$\begingroup\$

35. PCRE — 35 bytes

^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)

Tested on Regex101

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
^...[3w!G)]|^[^\\C|]*$|G.?.?\)
^[^C\\|]+$|G.\)|\.\)|w\^|^P|\...?]
^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)
\$\endgroup\$
  • \$\begingroup\$ My verifier shows no errors. \$\endgroup\$ – Vi. Nov 25 '14 at 0:58
  • \$\begingroup\$ Correctness verified. (@Vi., the dashboard looks for this specific phrase.) \$\endgroup\$ – Martin Ender Nov 25 '14 at 0:59
  • \$\begingroup\$ I though about using that phrase, but was not sure if I want to make my comment authoritative. \$\endgroup\$ – Vi. Nov 25 '14 at 1:00
  • \$\begingroup\$ My other 34-character answer mentioned before seems to work here. Waiting for 4 hours (or like that)... \$\endgroup\$ – Vi. Nov 25 '14 at 1:03
  • \$\begingroup\$ I don't bother hacking up - I delegate it to the computer. Maybe write an answer-posting bot using StackExchange API?.. \$\endgroup\$ – Vi. Nov 25 '14 at 1:06
4
\$\begingroup\$

36. Python flavour - 32

\?[^w$]*\$$|[]^C]\w+$|w\^|\|..\)

Tested on Regex101

I had three 32-byte regexes ready, and luckily one of them still works :D

The next answer has to match the following strings:

PPCG
^P
^[P^]P
[^?][PG]$
(?<!\\..)(?!]).$
^[\w^]*$|!|]P|G]\$$
!|[^?]P(CG|G..)?$
[^])]\$|^\^?P|P.\].$
([.$?]|G\])\$$|^\^?P|\]P$
([P.$?]\$|[]^]P|G\]\$|CG)$
!|((G.|P|\.)\$|[^?]P|CG)$
^[(!P]|G..$|]..\||[^?]P$
^.{3,23}[.-~]..\$$|[^P?][PG]$
^..(.[!G)(3w^]|.{7}$|$)|\$\?
\.\)|P[.$?]|w\^|^[^|C\\]*$|^P
^..(.[!)3G^w]|$)|\^.{7}$|G\)
\?[^w$]*\$$|[]^C]\w+$|w\^|\|..\)

And fail on these strings:

[PPCG]
^[P\^]
[^\]]$
^\^?P
[^?][PG]$|<|PG
^[^\\|]*(\\\\)+[^\\|]*[^\]]$
^(.{,4}|.{9}|.{16,19}|.{5}P)$
^[^?]*[PG]$|[?$].*\$$
^[^[]P|]P|(G]|[.])\$$
\..$|!|\|G|^[\^P]P|P\^|G.\$$
...\^.P|^!|G]\$$|w|<!|^\^?P
([^\\}<]{3}|][^]]|^).?[$PG]$
^(..[^^].{4,22}\$|[^?]+\w)$|2
^(..[^^].{4,22}\$|[^?]+\w)$|~
^..(.[!()3G^w]|.{7}$|$)|G\\
[[?C(].[-!)|w]|^P|^[^C|\\]*$
[?[CP(].[-<)|w]|^P|^[^C|\\]*$
^..(.{7}$|.[3Gw!^)]|$)|G.?.?\)
^...[3w!G)]|^[^\\C|]*$|G.?.?\)
^[^C\\|]+$|G.\)|\.\)|w\^|^P|\...?]
^P|!.3|w\^|^[^C\\|]+$|\.[)$-](?!.!)
\$\endgroup\$
  • 1
    \$\begingroup\$ Correctness verified. \$\endgroup\$ – Martin Ender Nov 25 '14 at 1:27
  • \$\begingroup\$ Correctness as a Perl regex is also verified. \$\endgroup\$ – Vi. Nov 25 '14 at 1:28
  • \$\begingroup\$ Let's hope the question be inactive until tomorrow, as I have a pending 30-character answer to post. \$\endgroup\$ – Vi. Nov 25 '14 at 1:55

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.