/explore
|
You are here 
|
pbrisbin.com | ||
| | | | |
deniskyashif.com
In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
swtch.com
|
|
| | | | | ||
| | | | |
rust-lang.github.io
|
|
| | | |||
