a syntax token can contain (direct or indirect) recursive references to itself ( note: some rule factoring may be needed, to avoid grammar left-recursion or ambiguity )
When I define left-recursive rule in Syntax, I got the exception: Uncaught RangeError: Maximum call stack size exceeded
What do you mean by " some rule factoring may be needed"? Do you mean I need to convert left-recursion to non-left-recursion following rules like this: https://web.cs.wpi.edu/~kal/PLT/PLT4.1.2.html ?
Left-recursive grammars, can be transformed to right-recursive grammars which is not problematic for the grammar parser. Left-recursion in the grammar will NOT work. Factoring some grammar rules, helps with this.
In the manual, it says
When I define left-recursive rule in Syntax, I got the exception: Uncaught RangeError: Maximum call stack size exceeded
What do you mean by " some rule factoring may be needed"? Do you mean I need to convert left-recursion to non-left-recursion following rules like this: https://web.cs.wpi.edu/~kal/PLT/PLT4.1.2.html ?