Explore >> Select a destination
|
You are here 
|
deniskyashif.com | ||
| | | | |
raganwald.com
|
|
| | | | | ||
| | | | |
twomorecents.org
|
|
| | | | | [AI summary] This text is a detailed exploration of the development and implementation of a regular expression engine, drawing from the works of several key figures in the field. It covers various features and techniques, including capturing groups, backreferences, numeric ranges, and the use of threads to simulate backtracking. The author also discusses the inspiration from Russ Cox, Rob Pike, and Ken Thompson, and their contributions to the field of regular expressions and computing. | |
| | | | |
rcoh.me
|
|
| | | | | 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. | |
| | | | |
github.com
|
|
| | | ?? My blog. Custom static site generator. Contribute to sulami/blog development by creating an account on GitHub. | ||
