Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative
- $E \rightarrow E -T\mid T$
- $T \rightarrow T/F\mid F$
- $F \rightarrow (E) \mid id$
($E$ is the start symbol)
Is the grammar unambiguous? Is so, what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.