Is there any precedence for symbols for constructing parse trees? [duplicate]

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, → or ∧ could be used the root?

marked as duplicate by Hendrik Jan, Community♦Jul 19 '16 at 11:55

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

1 Answer

Operator precendences have to be specified, either in the grammar or using other means. There is no inherent precendence to rules, but you can fix one arbitrarily.