Recursive Descent With StringScanner

Recursive descent parsers are ridiculously simple to write, and can be created without the extra ceremony of using a parser generator. Combine the idea with the use of a string scanner library to do the lexing, and you have an easy way to write ad-hoc parsers.