Source : Free On-Line Dictionary of Computing

LL
     
         A class of language {grammar}s, which can
        be {parse}d without {backtrack}ing.  The first L stands for
        Left-to-right scan, the second for Leftmost derivation.
     
        Often found in the form LL(k) where k is the number of
        {token}s of {look-ahead} required when parsing a sentence of
        the language.  In particular, LL(1) is a fairly restrictive
        class of grammar, but allows simple {top-down} parsing
        (e.g. {recursive-descent}) to be used without wasteful
        {backtracking}.  A number of programming languages are LL(1)
        (or close).
     
        (1995-10-30)