LL(1) parser is a top-down parser
It begins from the start symbol of the grammar and finds a derivation for the input string
1 in LL(1) stands for “one symbol of lookahead”, the parser is only able to make decisions about which rule to apply based on next symbol in the input and not any further symbols