Explore >> Select a destination
|
You are here 
|
swtch.com | ||
| | | | |
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. | |
| | | | |
deniskyashif.com
|
|
| | | | | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. | |
| | | | |
www.dalkescientific.com
|
|
| | | | | ||
| | | | |
www.salvis.com
|
|
| | | Database centric development | ||
