/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

 deniskyashif.com
Implementing a Regular Expression Engine ยท Denis Kyashif's Blog
| | nitely.github.io
A DFA for submatches extraction | Nitely's blog
1.7 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.
| | swtch.com
Regular Expression Matching Can Be Simple And Fast
1.2 parsecs away

Travel
| |
| | danilafe.com
Compiling a Functional Language Using C++, Part 1 - Tokenizing
2.4 parsecs away

Travel
| | In this post, we tackle the first component of our compiler: tokenizing.
| | blog.8thlight.com
Clean Coder Blog
16.6 parsecs away

Travel
| [AI summary] The blog post discusses the limitations of Test-Driven Development (TDD) in scenarios involving physical interactions, user interface elements, and test support code, emphasizing the need for manual testing and separation of concerns.