My LL(k) recursive descent parser cannot handle left recursion without incurring in a O(n³) worst case time-complexity. OP please fix. I expect a solution until next week. Thank you.