anchor.diff:  
   == Proposal
   
  -The precedence in openCypher is defined by _precedence levels_ and _left-to-right precedence_.
  +The precedence in openCypher is defined by (1) _precedence levels_ and (2) _left-to-right precedence_.
  +Both are defined in the following.
   
   === Precedence levels
   
  -The precedence levels are listed in descreasing order in the following <<precedenceLevels,table>>.
  +The precedence levels are listed in descending order in the following <<precedenceLevels,table>>.
   
   .[[precedenceLevels]]Precedence levels
   [cols="<.<1a,<.<4a,<.<4a", options="header"]
  
positive.code: [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.
  
negative.code: 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 operator has operands to which the precedence levels do not apply, these operands are syntactically delineate such that there is no ambiguity with regard to the operator tree.
  For instance, the syntax of the list element access clearly delineates the list element index operand by brackets, e.g. `myList[5]`.
  Such clearly delineated 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 expressions as 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
  ----
  3+(2*4)
  ----
  as a valid expression.
  This achieves the desire operator tree
  ----
      *
     / \
  