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. | |
| | | | |
jawher.me
|
|
| | | | | ||
| | | | |
danilafe.com
|
|
| | | | | In this post, we tackle the first component of our compiler: tokenizing. | |
| | | | |
www.s-anand.net
|
|
| | | In 1994, I learnt Perl. It was fantastic. I used it to: In 2006, I was convinced I should stick to Perl over Python. In 2008, Google launched AppEngine and it provided free hosting (which was a big deal!) but had only 2 runtimes: Java and Python. The choice was clear. I'd rather learn Python ... Perl, 1994-2011 Read More » | ||
