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. | |
| | | | |
github.com
|
|
| | | | | JS regexes ? future. A template tag for readable, high-performance, native JS regexes with extended syntax, context-aware interpolation, and always-on best practices. - slevithan/regex | |
| | | | |
blog.burntsushi.net
|
|
| | | | | I blog mostly about my own programming projects. | |
| | | | |
nurkiewicz.com
|
|
| | | When choosing or learning a new programming language, type system should be your first question. How strict is that language when types don't really match? Will there be a conservative, slow and annoying compiler? Or maybe a fast feedback loop, often resulting in crashes at runtime? And also, is the language runtime trusting you know what you are doing, even if you don't? Or maybe it's babysitting you, making it hard to write fast, low-level code? Believe it or not, I just described static, dynamic, weak and strong typing. | ||
