Nope; you need to left-factor them unfortunately. Other parser combinators may have different implementation algorithms, but this one is naive PEG/recursive-descent so you need to help it out manually otherwise it'll just infinite-recurse
For those interested, here is an article about a parser combinator implementation in Racket that supports left-recursive grammars:
Won't it be possible to detect the left recursion instead of going into an infinite loop?