The precedence rules allow efficient representation of polynomial expressions in a concise normal expanded form. If you reversed the precedence of multiplication then the notation would be more efficient for factored polynomial expressions. But, generally, polynomial operations are much less efficient in factored form (compare, e.g. equality testing and addition).
The reason that polynomial rings are ubiquitous is their universality (they are free R
R
-algebras). So, for example, any polynomial identity that you prove true in ℤ[x]
Z
[
x
]
will hold true over any ring, e.g. the binomial theorem.