/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
| | deniskyashif.com
Implementing a Regular Expression Engine ยท Denis Kyashif's Blog
0.9 parsecs away

Travel
| | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm.
| | 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.
| | twomorecents.org
Writing a Regular Expression Engine - Two More Cents
2.1 parsecs away

Travel
| | [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.
| | data36.com
Learn Python for Data Science - from scratch (20 articles)
20.0 parsecs away

Travel
| Learn data science and machine learning in Python, pandas and scikit learn! This is a free series of 20 in-depth tutorial articles.