mncaudill + compsci   7

Regular Expression Matching: the Virtual Machine Approach
"This article presents two strategies as two different ways to implement a virtual machine that executes a regular expression that has been compiled into text-matching bytecodes, just like .NET and Mono are different ways to implement a virtual machine that executes a program that has been compiled into CLI bytecodes."
programming  reference  algorithms  compsci  vm  parsing 
december 2009 by mncaudill
E.W. Dijkstra Archive: The threats to computing science (EWD898)
This has been around for a while but this is one of the best essays on computing science that I have ever read, and Dijkstra was the perfect candidate to write it.
software  compsci 
september 2009 by mncaudill
Compilers and Compiler Generators
Full book PDF. It appears to provide the sweet spot of appealing to one who doesn't know a lot about compilers, but wants to.
compsci  compiler 
november 2008 by mncaudill
Top Down Operator Precedence
Douglas Crockford explains a parsing technique that works well with dynamic, functional languages, like javascript.
compsci  javascript  compiler 
september 2008 by mncaudill

Copy this bookmark:



description:


tags: