Explore >> Select a destination
|
You are here 
|
rcoh.me | ||
| | | | |
v8.dev
|
|
| | | | | V8 now has an additional RegExp engine that serves as a fallback and prevents many instances of catastrophic backtracking. | |
| | | | |
pbrisbin.com
|
|
| | | | | While reading Understanding Computation again last night, I was going back through the chapter where Tom Stuart describes deterministic and non-deterministic finite automata. These simple state machines seem like little more than a teaching tool, but he eventually uses them as the implementation for a regular expression matcher. I thought seeing this concrete use for such an abstract idea was interesting and wanted to re-enforce the ideas by implementing such a system myself - with Haskell, of course. | |
| | | | |
github.com
|
|
| | | | | An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs. - regex/regex-automata at master · rust-lang/regex | |
| | | | |
regex101.com
|
|
| | | Regular expression tester with syntax highlighting, explanation, cheat sheet for PHP/PCRE, Python, GO, JavaScript, Java, C#/.NET, Rust. | ||
