This is proof that regex even confuses the bots.
this post was submitted on 12 Nov 2023
252 points (95.7% liked)
Programmer Humor
32410 readers
1 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
May be our own path to survive the AI rebellion.
Maybe the goal wasn’t to stop the AIs but the aaaaaaaaaaaaaaaaaaaaaaaa! we made along the way.
(For reference: https://owasp.org/www-community/attacks/Regular_expression_Denial_of_Service_-_ReDoS)
I still don't understand regex at all
I recommend using https://regex101.com/
It explains all parts of your regex and highlights all matches in your example text. I usually add a comment to a regex101 playground if I use a regex in code.
The plural of regex is regrets.
My guess is, that someone started with a small share of features to find a simple solution for the problem, but the complexity of the problem got waaaay out of hand.
Regexes are actually used in formal computer science (if that's the right term), i.e. "proof that this and that algorithm won't deadlock" or something like that.
They're actually really elegant and can cover a lot. But you'll have to learn them by using them.
For the purpose of algorithm verification, the final and/or pushdown automaton or probably sometimes even Turing Machines are used, because they are easier to work with. "Real" regular expressions are only nice to write a grammar for regular languages which can be easily interpreted by the computer I think. The thing is, that regexs in the *nix and programming language world are also used for searching which is why there are additional special characters to indicate things like: "it has to end with ..." and there are shortcuts for when you want that a character or sequence occurs
- at least once,
- once or never or
- a specified number of times back to back.
In "standard" regex, you would only have
- () for grouping,
- * for 0 or any number of occurances (so a* means blank or a or aa or ...)
- + as combining two characters/groups with exclusive or (in programming, a+ is mostly the same as aa* so this is a difference)
- and sometimes some way to have a shortcut for (a+b+c+...+z) if you want to allow any lower case character as the next one
So there are only 4 characters which have the same expressive power as the extended syntax with the exception of not being able to indicate, that it should occur at the end or beginning of a string/line (which could even be removed if one would have implemented different functions or options for the tools we now have instead)
So one could say that *nix regex is bloated /s
You are probably thinking of Temporal logic which allows us to model if algorithms and programs terminate etc! It can be represented by using state machines tho!
It's been a while, so I'm quite rusty, especiallyeon the terminology, but I think we modelled feasible sequences of finite and infinite state machines using regexes.
That's how I was forced to learn 'em in uni. ;)
Ohhh I must be confusing the two! But yea, Regex is just NDAs in text form! The course I have had on it is one of my favorites! Really fun stuff
Regex is actually just a way to write (Epsilon) non determistic state automata(ε-NDA) using text! ε-NDA comes from automata theory and they are just a somewhat powerful way to describe state machines! They can kind of be seen as a stepping stone to things like Context-Free Grammars which is what language parsers use to define their language/parsers, and Turing machines! Regex is a fundamental part of computer science, and they are of course incredibly useful in string validation due to their expressive power! If you study at uni and get the chance to take a course in automata theory I recommend it! Personal favorite subject :)
It's really not too bad as long as:
-
you use a proper IDE (e.g. Regex101) with highlighting and piecewise explanations
-
you use named capturing groups
-
you give the regex a descriptive name in your code
People write regex in notepad and complain it doesn't work on the first try...
What part do you not understand?
.*
So you do not understand nothing? That's great to hear.
No, No, they don't understand everything and nothing!
Both statements match 😄
Yes
//////?-.,", duh,?!
Nobody does.
Regexes are write-only. No one can understand other peoples regexes
Not only other people's regexes. Mine from last week and before too
Error in Moderation
Could have been worse. Could have been an Error in Excess.
Regex's are not something you need AI for as there are already tools that explain them for you. Use regexr.com or a similar tool.
Regex's
Foxes
Boxes
Hexes
Regexes
You can do it. You too can pluralize without an apostrophe.
Oxen
Children
Brethren
Regexen
I've begun to understand that the modern meaning of an apostrophe is "oh shit! Here comes an 's'".
Sadly, I am gradually growing okay with that idea.
Thanks for pointing that out, it's a bad habit I've picked up!
____ are not something you need AI for as there are already tools that explain ____ for you. Use Wikipedia or a similar tool.
I don't agree that AI has no uses, you just have to know when to use it. There are multiple times I have scoured documentation and official forums of a niche tool to few results only to ask ChatGPT and get far closer to my goal in 2 minutes than I did in 30. I know the AI has to be getting that info from somewhere, but if Google, Reddit, and a forum search can't find it then I am sorry but I am going to ask an AI.
Yeha, also anything else has plenty of books and internet content on them so you really don't need AI for those too.
Groups multiple tokens together and creates a capture group for extracting a substring or using a backreference
With an explanation like this, I thing I'll take the AI.
You have a problem. You decide to use regex to solve it. Now you have two problems.