LL parsing is a top-down parser for a subset of the context-free grammers. Top-down parsing is finding the left-most derivations of an input-stream by searching for parse-trees using a top-down expansion of the given formal grammer rules.
This parser parses the input from Left to right without backtracking. It constructs a Leftmost derivation of the sentence.
LL parser is called an LL(k) parser if it uses k tokens of lookahead when parsing a sentence.
LL(1) grammars, fairly restrictive, are very popular because the corresponding LL parsers only need to look at the next token to make their parsing decisions.
Parser works on strings from a particular formal grammar.

The parser consists of

• input buffer
• stack
• parsing table

It applies the rule found in the table by matching the top-most symbol on the stack (row) with current symbol in the input stream (column).