What advantages do LL parsers have over LR parsers?

Question

What advantages do LL parsers have over LR parsers to warrant their relative popularity in today\'s parser generator tools?

According to Wikipedia, LR parsing appears to

Answer 1

From my personal experience (I used both for various situations), the most practical difference is that, with a LL(k), you can define the grammar in an easier way (since it's top-down) without caring about many possible reduce-reduce or shift-reduce conflicts which often occur with LR parsers. The only thing you have to care about is left-recursion which must be transformed into right one.

Another thing is that the top-down approach usually implies a higher complexity (regarding either space or time), because it has to store the whole tree while parsing and it can grow a lot until ambiguities are solved.