Explore >> Select a destination
|
You are here 
|
swtch.com | ||
| | | | |
raganwald.com
|
|
| | | | | ||
| | | | |
deniskyashif.com
|
|
| | | | | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. | |
| | | | |
docs.rs
|
|
| | | | | This crate provides routines for searching strings for matches of a regular expression (aka "regex"). The regex syntax supported by this crate is similar to other regex engines, but it lacks several features that are not known how to implement efficiently. This includes, but is not limited to, look-around and backreferences. In exchange, all regex searches in this crate have worst case `O(m * n)` time complexity, where `m` is proportional to the size of the regex and `n` is proportional to the size of the string being searched. | |
| | | | |
github.com
|
|
| | | UTS18 set notation in regular expressions. Contribute to tc39/proposal-regexp-v-flag development by creating an account on GitHub. | ||
