Why can left recursion break a recursive descent parser?

A Because the parsing function for the non-terminal would call itself again before consuming any input, causing infinite recursion and stack overflow B Because left-recursive grammars are inherently ambiguous C Because left recursion always produces shift-reduce conflicts in LR parsers D Because left-recursive rules cannot be expressed in BNF notation