/explore
|
You are here 
|
swtch.com | ||
| | | | |
deniskyashif.com
In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
nitely.github.io
Finite Automata is commonly used to efficiently match a Regular Expression (RE) to a given textinput. There are RE engines for submatch extraction based on Non-deterministic Finite Automata (NFA). These algorithms usually return a single match for each submatch, instead of the history of submatches (full parse tree). An NFA can be converted to a Deterministic Finite Automata (DFA) to improve the runtime matching performance. This article describes an algorithm based on DFA that extracts full parse trees from text. |
|
| | | | | ||
| | | | |
crpt.fyi
Issues for organizations and discussions, repo for debriefs and resources - Call For Proposal · francep2p/community Wiki |
|
| | | |||
