This question already has an answer here:
I am wondering if some symbols such as the ones in propositional logic have precedence over others in drawing parse trees.
For example, the sentence:
p ∧ q → r, would
∧ take precedence over
→ in becoming the root of the parse tree or vice versa?
Or is there no precedence meaning,
∧ could be used the root?