Programmer Humor

32473 readers

595 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.

founded 5 years ago

MODERATORS

[email protected]

330

Oh boy what a beautiful regex. I'm sure it does something logical and easy to understand. (lemmy.world)

submitted 2 weeks ago* (last edited 2 weeks ago) by NateNate60 to c/[email protected]

83 comments fedilink hide all child comments

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

Matches strings of any character repeated a non-prime number of times

https://www.youtube.com/watch?v=5vbk0TwkokM

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 3 points 2 weeks ago* (last edited 2 weeks ago)

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.