Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

---

You are here		rcoh.me No Magic: Regular Expressions, Part 3
|	|	nitely.github.io A DFA for submatches extraction | Nitely's blog	1.9 parsecs away Travel
|	|	Finite Automata is commonly used to efficiently match a Regular Expression (RE) to a given textinput. There are RE engines for submatch extraction based on Non-deterministic Finite Automata (NFA). These algorithms usually return a single match for each submatch, instead of the history of submatches (full parse tree). An NFA can be converted to a Deterministic Finite Automata (DFA) to improve the runtime matching performance. This article describes an algorithm based on DFA that extracts full parse trees from text.
|	|	actually.fyi Comptime table generation for shift-based DFAs | Actually.fyi	2.7 parsecs away Travel
|	|	Ergonomic lookup table generation for bit-twiddling using compile time reflection.
|	|	swtch.com Regular Expression Matching Can Be Simple And Fast	2.9 parsecs away Travel
|	|
|	|	mathspp.com Dynamic string replacements with regex | mathspp	26.5 parsecs away Travel
|		Learn how to find text patterns and replace them with dynamic content using regex.

home connect explore probe about/faq blog mcp contact updated: 2026-07-01