/explore
|
You are here 
|
nitely.github.io | ||
| | | | |
pbrisbin.com
While reading Understanding Computation again last night, I was going back through the chapter where Tom Stuart describes deterministic and non-deterministic finite automata. These simple state machines seem like little more than a teaching tool, but he eventually uses them as the implementation for a regular expression matcher. I thought seeing this concrete use for such an abstract idea was interesting and wanted to re-enforce the ideas by implementing such a system myself - with Haskell, of course. |
|
| | | | | ||
| | | | |
swtch.com
|
|
| | | | | ||
| | | | |
github.com
A low level regular expression library that uses deterministic finite automata. - BurntSushi/regex-automata |
|
| | | | | ||
| | | | |
isocpp.github.io
The C++ Core Guidelines are a set of tried-and-true guidelines, rules, and best practices about coding in C++ |
|
| | | |||
