LL parser

An algorithm for scanning a sentence from certain context-free grammars from Left to right, and constructing a Leftmost derivation of the sentence (Hence LL, compare with LR parser). The class of grammars which are parsable in this way is known as the LL grammars, and includes several of the older programming languages. This is because LL parsers are usually simple to produce by hand.