howdy. I think I have tracked down an incredibly maddening GUI spinning ball of death. Imagine a left-recursive grammar rule in my ANTLR grammar:
script : expr EOF ;
expr : expr '*' expr
with input 3*4. ANTLR will create a parse tree as the enclosed image shows (well almost; i'm simplifying here).
Q: If I create an AST (jetbrains terminology) that has such a structure, will it be a problem for jetbrains? condition might be a composite node whose first child is composite with same IElementType (expr).
Can anyone at jetbrains confirm my suspicion that such trees are a problem?
Attachment(s):Screen Shot 2015-12-23 at 12.58.23 PM.png