I have a grammar that will need left and right associative rules. As I
understand left associative rules they are recursive on the first
element:
A -> A + B |
B
B -> 1
How do I setup my grammar file to create a parser that can handle left
recursion? Where in the manual is this for further reading?
Stephen