An LL(k) parser is a type of parser that build the tree in a top-down way.
The inverse approach, the LR approach build the tree from the leaves
It
The * means any number of lookahead tokens.
LL parsers can't handle left-recursive rules.
A LL grammar is easier to understand than LR grammars.