/explore

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

 pbrisbin.com
Regular Expression Evaluation via Finite Automata | pbrisbin dot com
| | rcoh.me
No Magic: Regular Expressions, Part 3
2.8 parsecs away

Travel
| | The code for this post, as well as the post itself, are on github. This post is part 3 of a 3 part series. Part 1: Parsing Part 2: Generate an NFA Part 3: Evaluate an NFA Evaluating the NFA NFAs, DFAs and Regular Expressions Recall from part 2 that there are two types of finite automata: deterministic and non-deterministic. They have one key difference: A non-deterministic finite automata can have multiple paths out of the same node for the same token as well as paths that can be pursued without consuming input.
| | swtch.com
Implementing Regular Expressions
5.5 parsecs away

Travel
| | [AI summary] This article compiles resources and implementations for creating efficient regular expression search algorithms using finite automata and DFA/NFA methods.
| | deniskyashif.com
Implementing a Regular Expression Engine ยท Denis Kyashif's Blog
2.6 parsecs away

Travel
| | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm.
| | blog.lohr.dev
After a day of programming in Zig
23.6 parsecs away

Travel
| A review by a Rust enthusiast