top down | LL : (left-to-right input, leftmost rule application)
http://en.wikipedia.org/wiki/Recursive_descent_parser : look for rules to apply recursively, with backtracking. Requires that the grammar not have left recursion. In particular, a rule like: " A -> A B " fails with infinite recursion down the leftmost branch.
many variations in implementation depending on grammars and approach
