Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		swtch.com Regular Expression Matching Can Be Simple And Fast
\|	\|	nitely.github.io A DFA for submatches extraction \| Nitely's blog	2.1 parsecs away Travel
\|	\|	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.	2.1 parsecs away Travel
\|	\|	raganwald.com Exploring Regular Expressions and Finite-State Recognizers, Part I	1.9 parsecs away Travel
\|	\|		1.9 parsecs away Travel
\|	\|	rdrr.io regex: Regular Expressions as used in R	2.6 parsecs away Travel
\|	\|	[AI summary] This documentation page details the syntax, metacharacters, and options for using regular expressions in the R programming language.	2.6 parsecs away Travel
\|	\|	github.com GitHub - tc39/proposal-regexp-named-groups: Named capture groups for JavaScript RegExps	21.2 parsecs away Travel
\|		Named capture groups for JavaScript RegExps. Contribute to tc39/proposal-regexp-named-groups development by creating an account on GitHub.	21.2 parsecs away Travel