Recursive Descent Parsing
lSimplest reasonably general form of parsing.
lWorks for many, but not all grammars.
lSometimes a grammar can be transformed to enable recursive descent.
lRecall that each each auxiliary symbol in the grammar can be identified with a syntactic category, the set of strings that can be generated from that symbol (possibly with the help of other symbols). The meaning will derive from this idea.