I gave this talk at Coderfaire, August 17, 2013. As usual, the slides do not make a ton of sense without the words. Sorry!
However they contain a complete recursive-descent parser for a toy grammar, in JS. I’ve never given a talk with this much code before. The slides reveal this code line by line, and that worked out very nicely.
More resources for this talk: http://gist.io/6256943