Explore >> Select a destination
|
You are here 
|
pbrisbin.com | ||
| | | | |
rcoh.me
|
|
| | | | | The code for this post, as well as the post itself, are on github. This post is part 3 of a 3 part series. Part 1: Parsing Part 2: Generate an NFA Part 3: Evaluate an NFA Evaluating the NFA NFAs, DFAs and Regular Expressions Recall from part 2 that there are two types of finite automata: deterministic and non-deterministic. They have one key difference: A non-deterministic finite automata can have multiple paths out of the same node for the same token as well as paths that can be pursued without consuming input. | |
| | | | |
liorsinai.github.io
|
|
| | | | | I recently solved a particular kind of puzzle, nonograms, using finite state machines for regex matching. This is a very efficient way to do regex matching a... | |
| | | | |
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. | |
| | | | |
2ality.com
|
|
| | | In this blog post, we look at the ECMAScript proposal "RegExp v flag with set notation + properties of strings" by Markus Scherer and Mathias Bynens. | ||
