/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

 deniskyashif.com
Implementing a Regular Expression Engine ยท Denis Kyashif's Blog
| | swtch.com
Regular Expression Matching Can Be Simple And Fast
0.9 parsecs away

Travel
| |
| | raganwald.com
Exploring Regular Expressions and Finite-State Recognizers, Part I
2.2 parsecs away

Travel
| |
| | rcoh.me
No Magic: Regular Expressions, Part 3
3.0 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.
| | mkaz.blog
RegEx - mkaz.blog
16.4 parsecs away

Travel
| Marcus Kazmierczak's blog about code, data visualization, and life