anchor.diff:  
   |===
   
  +[IMPORTANT]
  +.Rule of precedence levels
  +====
  +Operations on level _X_ take precedence over any operation on level _Y_, when _X_ > _Y_, i.e. are of higher precedence.
  +Operations can only directly accept operations of higher precedence as operands.
  +====
  +
  +The rule of precedence levels is enforced by the grammar.
  +
  +The rule of precedence levels does not apply to all operands, though.
  +The table points out to which operands (left-hand or left-hand and right-hand) the rule of precedence levels apply.
  +
  +If an operation has operands to which the precedence levels do not apply according to the table, these operands are syntactically delineate such that there is no ambiguity with regard to the nesting tree.
  +For instance, the syntax of the list element access clear delineates the list element index operand by brackets, e.g. `myList[5]`.
  +Such clear delinated operands grammatically allow an expression of any precedence level, i.e. grammar encodes the operand as https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=Expression[<Expression>].
  +
  +A prominent expression with a clearly delineated operand is the _parenthesized expression_.
  +The parenthesized expression, has a single operand delineated by parentheses, i.e. `( n.prop+6 )` where `n.prop+6` is the delineated operand.
  +The parenthesized expression has no other purpose than grammatically allowing expression are operands that do not meet the rule of precedence levels.
  +For instance, an arithmetic addition cannot be directly an operand to an arithmetic multiplication by the rule of precedence levels, since addition is of lower precedence than multiplication.
  +However, with the help of a parenthesized expression, the user can denote the
  +----
  +3+(2*4)
  +----
  +as a valid expression.
  +This achieves the desire nesting tree
  +----
  +    *
  +   / \
  + ( )  4
  +  |
  +  +
  + / \
  +3   2
  +----
  +where the arithmetic addition is an operand to the arithmetic multiplication and, hence, results in 20 (rather than 11).
  +
  +=== Left-to-right precedence
   
   == What others do
   
  
positive.code: * https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=ParenthesizedExpression[existential subqueries]
  * https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=ParenthesizedExpression[parenthesized expression]
  
  |1
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=PropertyOrLabelsExpression[Graph element operations]
  |
  
  * property lookup
  * label expressions
  
  .3+|2
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=StringOperatorExpression[String operations] (left-hand operand)
  |
  
  
negative.code: * Less
  * Less or Equal
  
  |4
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=NotExpression[Boolean negation] (left-hand and right-hand operand)
  |
  
  * Negation
  
  |3
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=AndExpression[Boolean conjunction] (left-hand and right-hand operand)
  |
  
  * Conjunction
  
  |2
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=XorExpression[Boolean exclusive disjunction] (left-hand and right-hand operand)
  |
  
  * Exclusive disjunction
  
  |1
  |https://raw.githack.com/openCypher/openCypher/master/tools/grammar-production-links/grammarLink.html?p=OrExpression[Boolean inclusive disjunction] (left-hand and right-hand operand)
  |
  
  