program pptest6;

  const base = 10;

  var
    i,j: integer;
    ch: char;
    b: boolean;
    a: array [1 .. 10] of integer;

  begin
  { simple operations }
    i := i + j;
    i := i - j;
    i := i mod j;
    i := i div j;
    i := i * j;

    { integer comparisons }
    b := i = j;
    b := i <> j;
    b := i > j;
    b := i < j;
    b := i >= j;
    b := i <= j;

    { special cases }
    i := i + 1; { increment operation }
    i := 1 + i; { " }
    i := i - 1; { decrement operation }
    i := i + 32000;
    i := -(-i); { sign folding }
    i := sqr(i); { optimised square }
    i := i * i;

    { constant folding }
    i := base + 10;
    i := base mod 3;
    i := base div 3 + 1;

    { deeply nested operations }
    i := i + (i + (i + (i + (i + (i + (i + (i + (i + (i + j)))))))));
    a[i + (i + (i + (i + (i + (i + (i + (i + (i + (i + j)))))))))] := 1;

    { array adjustments }
    a[i + 1] := 0;
    a[i + 32000] := 0;
    a[i - 1] := 0;
    a[i] := a[i] + 1;

    { standard operations }
    i := succ(5);
    i := succ(i);
    i := pred(5);
    i := pred(i);
    i := abs(-6);
    i := abs(i);
    i := ord(ch);
    ch := chr(i);
  end { pptest6 }.