YES

TRS:

  rev(a()) -> a()
  rev(b()) -> b()
  rev(++(x,y)) -> ++(rev(y),rev(x))
  rev(++(x,x)) -> rev(x)

linear polynomial interpretations on N:

  rev_A(x1) = x1
  rev#_A(x1) = x1
  a_A = 1
  a#_A = 1
  b_A = 1
  b#_A = 1
  ++_A(x1,x2) = x1 + x2 + 1
  ++#_A(x1,x2) = x1 + x2 + 1

precedence:

  rev = a = b = ++