{
  double z;
  z = f(x,23.0 + 9.3*y);
  x = z - 42.56;
}
{
  int z;
  for (z = 0; z < MAX; z++) {
	/* ... */
  }
}

enum {even=0, odd=1};

switch (n % 2) {
case even :
  n = n / 2;
  break;
case odd :
  n = (3*n + 1) / 2;
  break;
}


switch (c) {
case 'a': case 'b': case 'c' :
	putchar('1');
	break;
/*...*/
case 'w': case 'x': case 'y' :
	putchar('9');
	break;
case 'q': case 'z':
	fprintf(stderr, "%c is illegal\n",
                c);
	exit(1);
	break;
default:
	putchar(c);
	break;
}

#include <ctype.h>

int atoi(const char s[])
     /* ensures: result is the number
        represented by s */

{
  int i, n, sign;
 
  for (i = 0; isspace(s[i]); i++) {
    ;
  }
  sign = (s[i] == '-') ? -1 : 1;
  if (s[i] == '+' || s[i] == '-') {
    i++;
  }
  for (n = 0; isdigit(s[i]); i++) {
    n = 10 * n + (s[i] - '0');
  }
  return sign * n;
}

int pathlen(int n)
   /* requires: n is odd and n>1 */
   /* ensures: iterate(T, result, n)==1 */
{
  int count = 0;

  do {
    n = T(n);
    count++;
  } while (n > 1);
  /* n == 1 */
  return count;
}

for (i = 0; i < MAX_X; i++) {
  for (j = 0; j < MAX_Y; j++) {
	/* ... */
	break;
	/* ... */
  }
  some_stuff(i);
}


for (i=0, j=0; i<MAX_X;
     (j < MAX_Y-1) ? j++ : (i++, j=0))
  a[i][j] = b[i][j];