LL Parser

An LL parser (Left-to-right, leftmost derivation) is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost derivation of the sentence in time.

The downside is that it can only handle a few practical grammars, no left-associativity.

The example that breaks an LL Parser: should be parsed as , and not