parsing - Why can't a recursive-descent parser handle left recursion

Question

Could someone please explain to me why recursive-descent parsers can't work with a grammar containing left recursion?

Answer 1

consider:

A ::= A B

the equivalent code is

boolean A() {
    if (A()) {
        return B();
    }
    return false;
}

see the infinite recursion?