Ask Hexbear is the place to ask and answer ~~thought-provoking~~ questions.
Rules:
Posts must ask a question.
If the question asked is serious, answer seriously.
Questions where you want to learn more about socialism are allowed, but questions in bad faith are not.
Try !feedback@hexbear.net if you're having questions about regarding moderation, site policy, the site itself, development, volunteering or the mod team.
I'm imagining as years go by when/if this AI regex code breaks - nobody knows how it works or how to fix it. Am I wrong?
I'm not a programmer and I write shitty code but I can manage to write simple regex to create quick and dirty code. That's a terrible programming choice I know but I never share my code. It's just for me and it works.
Read this for a very light introduction to the concept, then type "parser combinator library " into a search engine and never maintain a regular expression again!
How does this method handle backtracking? It seems like, as written, those functions wouldn’t handle it
Some implementations don't support backtracking at all, but ones that do will have combinators like
where
atomicandchoiceare parsers that take other parsers as arguments likeandandorin the article, though the advice is to avoid backtracking whenever possible since it's quite expensive. The little examples in the post are just a taste to make the idea legible, but not really suited for especially interesting parsers.