URL details: nitely.github.io/2020/01/19/a-dfa-for-submatches-extraction.html

home > domains > nitely.github.io > nitely.github.io/2020/01/19/a-dfa-for-submatches-extraction.html

URL title: A DFA for submatches extraction | Nitely’s Thoughts
URL description: 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 fro
URL last crawled: 2022-12-23
URL speed: 0.359 MB/s, downloaded in 0.040 seconds

open external url

1 external links to this url

Only links from external domains are shown on this page.