• balsoft@lemmy.ml
    link
    fedilink
    English
    arrow-up
    4
    ·
    edit-2
    43 minutes ago

    So, here’s my attempt

    The first portion (^.?$) matches all lines of 0 or 1 characters.

    The second portion (^(..+?)\1+$) is more complicated:

    1. (..+?) is a capture group that matches the first character in any line, followed by a smallest possible non-zero number of characters such that (2) still matches (note that the minimum length of this match is 2)
    2. \1+ matches as many as possible (and more than 0) repeats of the (1) group

    I think what this does is match any line consisting of a single character with the length

    • divisible by some number (due to the more than 0 condition in (2), so that there have to be repeats in the string), that’s not
      • 1 (due to the note in (1), so that the repeating portion has to be at least 2 characters long), or
      • the length itself (due to the more than 0 condition in the (2), so that there is at least one repetition)

    Therefore, combined with the first portion, it matches all lines of the same character whose lengths are composite (non-prime) numbers? (it will also match any line of length 1, and all lines consisting of the same string repeated more than one time)

  • bitjunkie@lemmy.world
    link
    fedilink
    arrow-up
    1
    ·
    31 minutes ago

    For a second I thought I was still in the thread about monkeys face-rolling typewriters until the heat death of the universe not eventually producing Hamlet

  • nroth@lemmy.world
    link
    fedilink
    arrow-up
    5
    ·
    1 hour ago

    A non prime number of times… It looks like the string of characters could repeat number of times because the whole capture group repeats. I don’t see a prime constraint.

    • Feathercrown@lemmy.world
      link
      fedilink
      English
      arrow-up
      2
      ·
      60 minutes ago

      The capture group must be the same each time it repeats, so the number of characters stays the same. So X groups of Y characters = string of length X*Y. X and Y can be anything so any string length that can be made by multiplying two numbers-- which is every non-prime string length-- is matched. 0 and 1 are handled specially at the start.

    • explore_broaden@midwest.social
      link
      fedilink
      arrow-up
      1
      ·
      13 minutes ago

      Yes, the first one matches only 2 more characters while the second matches 1 or more. Also the +? is a lazy quantifier so it will consume as little as possible.

  • fysihcyst@lemmy.ml
    link
    fedilink
    arrow-up
    2
    ·
    1 hour ago

    This is brilliantly disgusting.

    Literal interpretation of the regex

    The regex matches either a line with a single character or a line with a sequence of two or more characters that’s repeated two or more times. For some examples: the regex matches “a”, “b”, “abab”, “ababab”, “aaaa”, and “bbbbbb”, but does not match “aa”, “bb”, “aaa”, “ab”, “aba”, or “ababa”.

    Hint for the special thing it matches

    For a line with a single character repeated n times, what does matching (or not matching) this regex say about the number n?

  • S_H_K@lemmy.dbzer0.com
    link
    fedilink
    arrow-up
    4
    ·
    3 hours ago

    No cookie for me I just tried it in Notepad++ and VS code and it matches lines of one characer (first group I think) or the starting of a line that is an at least 2 characters string repeated twice (second group it seems)
    so the second group matches abab
    abcabc abcdeabce abcdefabcdef

    Nothing about prime numbers really only first repetition gets a match. Very interesting Honestly I used regex from years and never had to retort to something like this ever. I can only imagine it useful to check for a password complexity to not be repeated strings like I do for sites that I just want in and use a yopmail.com mail to register a fake user.

  • PeriodicallyPedantic@lemmy.ca
    link
    fedilink
    arrow-up
    4
    arrow-down
    1
    ·
    4 hours ago

    Empty input Or input of exactly 1 character Or input of at least 2 characters, followed by at least 1 something (idk what \1 matches)

    Did I get it (almost)?

  • fubo@lemmy.world
    link
    fedilink
    arrow-up
    93
    ·
    edit-2
    8 hours ago

    The answer given in the spoiler tag is not quite correct!

    Test case

    According to the spoiler, this shouldn’t match “abab”, but it does.

    Corrected regex

    This will match what the spoiler says: ^.?$|^((.)\2+?)\1+$

    Full workup

    Any Perl-compatible regex can be parsed into a syntax tree using the Common Lisp package CL-PPCRE. So if you already know Common Lisp, you don’t need to learn regex syntax too!

    So let’s put the original regex into CL-PPCRE’s parser. (Note, we have to add a backslash to escape the backslash in the string.) The parser will turn the regex notation into a nice pretty S-expression.

    > (cl-ppcre:parse-string "^.?$|^(..+?)\\1+$")
    (:ALTERNATION
     (:SEQUENCE :START-ANCHOR (:GREEDY-REPETITION 0 1 :EVERYTHING) :END-ANCHOR)
     (:SEQUENCE :START-ANCHOR
      (:REGISTER
       (:SEQUENCE :EVERYTHING (:NON-GREEDY-REPETITION 1 NIL :EVERYTHING)))
      (:GREEDY-REPETITION 1 NIL (:BACK-REFERENCE 1)) :END-ANCHOR))
    

    At which point we can tell it’s tricky because there’s a capturing register using a non-greedy repetition. (That’s the \1 and the +? in the original.)

    The top level is an alternation (the | in the original) and the first branch is pretty simple: it’s just zero or one of any character.

    The second branch is the fun one. It’s looking for two or more repetitions of the captured group, which is itself two or more characters. So, for instance, “aaaa”, or “ababab”, or “abbabba”, but not “aaaaa” or “abba”.

    So strings that this matches will be of non-prime length: zero, one, or a multiple of two numbers 2 or greater.

    But it is not true that it matches only “any character repeated a non-prime number of times” because it also matches composite-length sequences formed by repeating a string of different characters, like “abcabc”.

    If we actually want what the spoiler says — only non-prime repetitions of a single character — then we need to use a second capturing register inside the first. This gives us:

    ^.?$|^((.)\2+?)\1+$.

    Specifically, this replaces (..+?) with ((.)\2+?). The \2 matches the character captured by (.), so the whole regex now needs to see the same character throughout.

      • fubo@lemmy.world
        link
        fedilink
        arrow-up
        12
        ·
        edit-2
        7 hours ago

        Whatever you do, don’t get in a time machine back to 1998 and become a Unix sysadmin.

        (Though we didn’t have CL-PPCRE then. It’s really the best thing that ever happened to regex.)

        • Treczoks@lemmy.world
          link
          fedilink
          arrow-up
          3
          ·
          6 hours ago

          I have to admit that using CL-PPCRE does not really help me understanding the regexp any better. But this may be because I deal with complex regexps for decades now, and I just read them.

      • MalReynolds@slrpnk.net
        link
        fedilink
        English
        arrow-up
        4
        ·
        7 hours ago

        I upvoted you because I consider Perl write only (used to know it, now it inspires readable code as a high priority)

        • Treczoks@lemmy.world
          link
          fedilink
          arrow-up
          7
          ·
          edit-2
          3 hours ago

          Let’s put it this way: You can produce unreadable code in basically any language. With Perl, it is just a bit easier.

          And of course if you have the discipline of a good programmer, even your casual Perl programs should be readable. That’s what differenciates a good programmer from a hacker.

          • MalReynolds@slrpnk.net
            link
            fedilink
            English
            arrow-up
            3
            ·
            4 hours ago

            Yeah, I was younger then, perhaps less disciplined, and as always, given enough work you can decompile or regenerate anything. Still, I contend, the nature of Perl, powerful as it was, lent itself to unmaintainable messes, and I’m not talking regex’s, which is why it has faded, no amount of get gud withstanding.

      • fubo@lemmy.world
        link
        fedilink
        arrow-up
        8
        ·
        6 hours ago

        Regex is good for a few very specific things, and sysadmins used to use it for goddamn everything. If all your server logs are in lightly-structured text files on a small number of servers, being able to improvise regex is damn useful for tracking down server problems. Just write a shell loop that spawns an ssh logging into each server and running grep over the log files, to look for that weird error.

        These days, if you need to crunch production server logs you probably need to improvise in SQL and jq and protobufs or systemd assmonkery or something.

        But if you actually need a parser, for goodness sake use a parser combinator toolkit, don’t roll your own, especially not with regex. Describing your input language in plain Haskell is much nicer than kludging it.

        (This is the “totally serious software engineering advice” forum, right?)

  • Sylvartas@lemmy.world
    link
    fedilink
    arrow-up
    2
    arrow-down
    3
    ·
    2 hours ago

    All my homies hate regexs. That’s actually the best use case I found for LLMs so far : I just tell it what I want it to match or not match, and it usually spits out a decent one

    • BluesF@lemmy.world
      link
      fedilink
      arrow-up
      4
      ·
      1 hour ago

      Oooof. I feel like trying to figure out what’s wrong with some regex I didn’t write is much harder than writing it myself personally.

      • Sylvartas@lemmy.world
        link
        fedilink
        arrow-up
        1
        ·
        41 minutes ago

        I’ve never had to use it for important stuff tbh. But alongside a regex tester and a sample of the stuff I intend to use it on, I’ve had good results with an incremental approach where I tell the LLM what I want to change with the expression until I’m satisfied

    • RegalPotoo@lemmy.world
      link
      fedilink
      English
      arrow-up
      9
      ·
      edit-2
      10 hours ago

      Something like

      !“A line with exactly 0 or 1 characters, or a line with a sequence of 1 or 3 or more characters, repeated at least twice”!<

          • NateNate60@lemmy.worldOP
            link
            fedilink
            arrow-up
            3
            ·
            8 hours ago

            They said—

            A line with exactly 0 or 1 characters, or a line with a sequence of 1 or 3 or more characters, repeated at least twice

            Note—

            …or a line with a sequence of 1 or 3 or more characters, repeated at least twice

            It should be—

            …or a line with a sequence of 2 or more characters, repeated at least twice

            The regex in the post will match “abab”. Their original description (line 2 of this comment) will not match “abab”.