NateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-211 hours agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldimagemessage-square48fedilinkarrow-up1162arrow-down15file-text
arrow-up1157arrow-down1imageOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldNateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-211 hours agomessage-square48fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squareikidd@lemmy.worldlinkfedilinkEnglisharrow-up33·7 hours agoI upvoted this because I hate it.
minus-squarefubo@lemmy.worldlinkfedilinkarrow-up10·edit-26 hours agoWhatever 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.)
minus-squareTreczoks@lemmy.worldlinkfedilinkarrow-up3·5 hours agoI 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.
I upvoted this because I hate it.
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.)
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.