High Quality Content by WIKIPEDIA articles! In computer science, an LL parser is a top-down parser for a subset of the context-free grammars. It parses the input from Left to right, and constructs a Leftmost derivation of the sentence (hence LL, compared with LR parser that constructs a rightmost derivation). The class of grammars which are parsable in this way is known as the LL grammars.