this post was submitted on 31 Oct 2024
328 points (97.7% liked)

Programmer Humor

32549 readers
601 users here now

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

Rules:

founded 5 years ago
MODERATORS
 

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

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

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

(page 2) 33 comments
sorted by: hot top controversial new old
[–] SpiceDealer@lemmy.world 3 points 3 weeks ago* (last edited 3 weeks ago)

I could be wrong but I think the (..+?) portion will either remove a dud or replenish the allowance.

[–] ShaunaTheDead@fedia.io 2 points 3 weeks ago

It matches for non-primes and doesn't match for primes.

[–] JackbyDev@programming.dev 2 points 3 weeks ago

The pipe is throwing me off because usually I have to do parentheses for that to work...

[–] FourPacketsOfPeanuts@lemmy.world 1 points 1 week ago* (last edited 1 week ago)

I'm I the only one who pronounces regex with a soft g? Hard g feels so clunky

[–] Sylvartas@lemmy.world -2 points 3 weeks ago (3 children)

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

[–] kibiz0r@midwest.social 3 points 3 weeks ago

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.

load more comments (2 replies)
load more comments
view more: ‹ prev next ›