World's most popular travel blog for travel bloggers.

Is there any precedence for symbols for constructing parse trees?

, , No Comments
Problem Detail: 

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?

Asked By : Ethan
Answered By : Raphael

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.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/60755

3200 people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback