Programming-Articles-On-The-Web

at 21h7 min, 10 January 2012 with Tags: Languages Tutorials

Nice programming articles/blogs

Let's Build a Compiler by Jack Crenshaw is probably one the best papers I've seen so far. there's also a Forth version.
JonesForth this great article shows you how to build a Forth in assembler. Worth a look.
Another course with a lot of book references.
A really nice Course for implementing a language named Xi
Compiler Construction by Niklaus Wirth.

Lis.py Peter Norvig's explaining how to build a basic Scheme interpreter. He also build a second one, more advanced.
Scheme In Python is another nice series of articles in building a Scheme interpreter.
Lispy In Scheme from the same author as above, describes a similar way of building a Scheme interpreter in Scheme (Chicken).
Scheme From Scratch I want to implement Scheme from Scratch: an interpreter, a compiler, a JIT, etc. I want to see how it all happens. If you do too then you may enjoy following along. Very instructive read, a pleasure to follow, even if, like me, you don't know much about C.

ReFactor A nice collection of Factor articles with detailled scripts.
Useless Factor Daniel Ehrenberg's blog on Factor.
Samuel Tardieu's lair, teaching computer science in Paris. Some articles about Factor, Forth, and programming in general.
Factor in University is Factor a good choice for a real wold project ?
Manfred von Thun A nice set of articles from the author of the Joy language, but not in Joy (Pascal).

Nakkaya little articles related to Clojure.
Michael Fogus blogs on Clojure (one of the authors of the Joy of Clojure book), and all things related to programming: very wise.

Jigsaw is a parser combinator library build by Christopher Diggins (the author of Cat and Heron languages) in C#. The article explains the internals, and reading the source code is really very instructive.
Simple Top-Down Parsing In the early seventies, Vaughan Pratt published an elegant improvement to recursive-descent in his paper Top-down Operator Precedence. Pratt’s algorithm associates semantics with tokens instead of grammar rules, and uses a simple "binding power" mechanism to handle precedence levels. Traditional recursive-descent parsing is then used to handle odd or irregular portions of the syntax. All is done with Python.
Pratt Parser where the author (Bob Nystrom) of the Magpie language tries to put the light on the beautiful algorithm for parsing a full little language. Note Bob Nystrom is also using this method to parse his Magpie baby.