Being a bit smarter on the Tompson's construction to reduce the number of epsilon transitions and redundant states generated. Inspired by swtch.com/~rsc/regexp/...

Before/after comparison in images

I am not familiar with it, or how it differs from Tompson's construction that I currently use. I need to read further on it.

Wikipedia states that:
> Glushkov's construction algorithm is similar to Thompson's construction, once the ε-transitions are removed
And I definitely plan to remove epsilons.

Adds support for bracketed character classes like `[a-zA-Z_]`

I'm less sure about the trade-off between building a full DFA versus continuing with my current "generate DFA states on the fly" approach. Right now, I’m leaning toward keeping the on-the-fly method but adding a cache for DFA states.

Yeah, I definitely plan to add a transformation to remove epsilon transitions (and ideally generate fewer of them in the first place).

Ahh, sorry. That's probably what I will implement next 😅

People I respected watched it and apparently like it, so it probably contains some useful information. Still not enough for me to watch his rants

Anecdotedly, most people who try to sell me snake oils are users who think they are benefited and genuinely trying to help. And a whole nation can be convinced that traditional Chinese medicine is "scientific."

Also added the ability to pull replies from Mastodon and Bluesky. For example, see

lesleylai.info/micro/posts/...

I think this kind of moving implementation details into non-templated functions is a common way to reduce template code bloat in C++.

After searching, I found this Reddit post in which people suggested that using custom tags is not a good practice.

www.reddit.com/r/webdev/com...

Sorry for the late reply. I am moving to Codeberg for now. However, I am still using GitHub for private repos and CI.