In computer science, a Wirth–Weber relationship between a pair of symbols
In such a case, the simple precedence parser can be used.
The relationship is named after computer scientists Niklaus Wirth and Helmut Weber.
The goal is to identify when the viable prefixes have the pivot and must be reduced.
means that a potential pivot is starting, and a
means that a relationship remains in the same pivot.
We will define three sets for a symbol: The pseudocode for computing relations is: