335
^.?$|^(..+?)\1+$
Matches strings of any character repeated a non-prime number of times
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 31 Oct 2024
335 points (97.7% liked)
Programmer Humor
32831 readers
549 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
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
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.
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
That sounds…
Easier to get almost right than actually learning the subject.
Much, much harder to get completely right than actually learning the subject.
So yes, basically the archetypal use case for LLMs.