I have a problem with the following syntax:
T -> T , k , T
T -> nil
T -> number
This is a BNF rule for binary trees. Assuming that nil and number are tokens, I need to remove the ambiguity of this grammar without restricting the structure of the Binary Tree. Note that the two recursive refrences to T should remain; in the first rule.
I really couldn't solve this problem. Who can help me?! ;)