A Non-Backtracking Regular Expression Engine for .NET (Core)
This article describes an improvement to the state removal algorithm for converting FAs to regular expressions
Adventures in Reflection.Emit! Here I present a regular expression engine with a Compile() feature.
Deep dive some advanced source generation in a real world application
Add non-backtracking fast DFA regular expression and finite state automata to your projects
Explore, run, and manipulate DFA regular expressions from graphs, to state machines with this library
Hoodwink your computer into doing your work for you using regular expressions
Creating a simple parser in 3 easy lessons
A Pike virtual machine and optimizing compiler for regular expressions using an NFA engine
A regex and finite state engine as part of PCK
A Pike VM for running non-backtracking NFA regular expressions in C#
Embed fast streaming C# code to match text based on inputted regular expressions
Add fast scanners/tokenizers to your C# project
Generate fast, easy to use lexers/scanners in major .NET languages
Generate tight C code to match text based on regular expressions
Easily add lexers to your project with this simple drop in NuGet package and a few annotations
Silly SQL Tricks, Mistakes and Other Nonsense