[Pharo-users] Left recursion in PetitParser

I have a PetitParser question. A small part of my grammar is like this: expression := constant / namedSend / ... namedSend := receiver dot namedMessage / ... receiver := expression This is of course left-recursive. I believed the "all the rest is magic" blurb and just went ahead and wrote it as given above. I get an infinite recursion when I run the parser. I know how to left-factor the grammar by hand. But should I have to? How powerful is thy magic, Lukas? Andrew