Explore >> Select a destination
|
You are here 
|
docs.rs | ||
| | | | |
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. | |
| | | | |
blog.burntsushi.net
|
|
| | | | | I blog mostly about my own programming projects. | |
| | | | |
extendsclass.com
|
|
| | | | | Online regular expression tester for Python, PHP, Ruby, JS, Java and MySQL. Regex visualizer. Syntax highlighting. Cheatsheet. Generate string corresponding to a regex. | |
| | | | |
docs.rs
|
|
| | | This crate provides a lightweight regex engine for searching strings. The regex syntax supported by this crate is nearly identical to what is found in the `regex` crate. Like the `regex` crate, 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. | ||
