**** initial

  pairCount = 0 ;
  oddCount = 0 ;
  for (i=0; i<size; i=i+1) {
    if (V[i] == V[i+1]) {
      pairCount = pairCount + 1;
    } else if (V[i] & 1) {
      oddCount = oddCount + 1;
    }
  }

**** translation of for to while
  pairCount = 0 ;
  oddCount = 0 ;
  i = 0 ;
  while (i<size) {
    if (V[i] == V[i+1]) {
      pairCount = pairCount + 1;
    } else if (V[i] & 1) {
      oddCount = oddCount + 1;
    }
    i = i + 1 ;
  }
  
**** translation of while using goto (version 2)
  pairCount = 0 ;
  oddCount = 0 ;
  i = 0 ;
  goto LwhileTest ;
Lwhilestart:
  if (V[i] == V[i+1]) {
    pairCount = pairCount + 1;
  } else if (V[i] & 1) {
    oddCount = oddCount + 1;
  }
  i = i + 1 ;
LwhileTest:
  if (i<size) goto Lwhilestart;

**** translation of first if
  pairCount = 0 ;
  oddCount = 0 ;
  i = 0 ;
  goto LwhileTest ;
Lwhilestart:
  if (V[i] == V[i+1]) goto L1else:
  pairCount = pairCount + 1;
  goto L1join ;
L1else:
  if (V[i] & 1) {
    oddCount = oddCount + 1;
  }
L1join:
  i = i + 1 ;
LwhileTest:
  if (i<size) goto Lwhilestart;

**** translation of second if
  pairCount = 0 ;
  oddCount = 0 ;
  i = 0 ;
  goto LwhileTest ;
Lwhilestart:
  if (! (V[i] == V[i+1])) goto L1else:
  pairCount = pairCount + 1;
  goto L1join ;
L1else:
  if (! (V[i] & 1)) goto L2join;
  oddCount = oddCount + 1;
L2join:
L1join:
  i = i + 1 ;
LwhileTest:
  if (i<size) goto Lwhilestart;

**** tests with assignments
  pairCount = 0 ;
  oddCount = 0 ;
  i = 0 ;
  goto LwhileTest ;
Lwhilestart:
  Teq = V[i] == V[i+1] ;
  if (! Teq) goto L1else:
  pairCount = pairCount + 1;
  goto L1join ;
L1else:
  Tand = (V[i] & 1)
  if (! Tand) goto L2join;
  oddCount = oddCount + 1;
L2join:
L1join:
  i = i + 1 ;
LwhileTest:
  if (i<size) goto Lwhilestart;