NateNate60@lemmy.world to Programmer Humor@lemmy.ml · edit-222 days agoOh boy what a beautiful regex. I'm sure it does something logical and easy to understand.lemmy.worldexternal-linkmessage-square82fedilinkarrow-up1332arrow-down19file-text
arrow-up1323arrow-down1external-linkOh 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-222 days agomessage-square82fedilinkfile-text
^.?$|^(..+?)\1+$ <answer> Matches strings of any character repeated a non-prime number of times https://www.youtube.com/watch?v=5vbk0TwkokM
minus-squareCanadaPlus@lemmy.sdf.orglinkfedilinkarrow-up3·edit-221 days agoYeah, but in an FSM all you have are states. To do it the obvious way, you need a loop with separate branches for every number greater than 2, or at the very least every prime number, and that’s not going to be finite.
Yeah, but in an FSM all you have are states. To do it the obvious way, you need a loop with separate branches for every number greater than 2, or at the very least every prime number, and that’s not going to be finite.