Actually, the code reads a simple language, uses recursive descent parsing to build a tree, and then uses a “compiler” to convert the tree to JavaScript (which can then be executed, of course).

The idea is related to recursive descent parsing, where you attempt to parse certain things, and if those things fail, you try again. There are ways to match in a fuzzy way using Levenshtein distance.