Explore >> Select a destination
|
You are here 
|
rcoh.me | ||
| | | | |
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. | |
| | | | |
rhaeguard.github.io
|
|
| | | | | ||
| | | | |
deniskyashif.com
|
|
| | | | | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm. | |
| | | | |
www.baturin.org
|
|
| | | [AI summary] The text provides an in-depth exploration of functional programming concepts in OCaml, focusing on type systems, pattern matching, and data structures. It covers topics such as unit and boolean values as sum types, polymorphic types like option and result, and the use of match expressions for pattern matching. The text also includes exercises for practicing these concepts, such as defining functions, writing sum types, and implementing pattern matching. | ||
