jgk@panix.com (Joe keane) writes:>One person designs a language 'C1' with precedence:>> [higher]> ...> |> &> <, <=, >, <=> ==, !=> ...> [lower]>>Some other person designs a language 'C2' with precedence:>> [higher]> ...> <, <=, >, <=> ==, !=> |> &> ...> [lower]>>They're the same besides that.>>To compromise, they make a new language 'C3' such that a program is>valid C3 if it is valid C1 and valid C2 -and- both ways mean the same.>>Is there some good way to do this -in the grammar-?

Sure, you don't want | & to asssociate with < <= > >= == != (I find
the remaining associations questionable, but let's stick with your
example). So write the grammar in a way that makes the wanted
associations explicit and does not contain the unwanted associations: