In short, it will implicitly choose which side wins. If two of your conflicting rules are able to parse the same input, the left one in left / right will win (where / is a left-biased choice operator). If your grammar has non-trivial left-recursive parts you’ll spend a lot of time rearranging them. The methods of descent are the easier ones, but they have problems: ![]()
0 Comments
Leave a Reply. |