^.?$|^(..+?)\1+$
Matches strings of any character repeated a non-prime number of times
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
The pipe is throwing me off because usually I have to do parentheses for that to work...
It matches for non-primes and doesn't match for primes.
I'm I the only one who pronounces regex with a soft g? Hard g feels so clunky
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
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.
Post funny things about programming here! (Or just rant about your favourite programming language.)