FOR v := beg TO end BY inc DO S END  

v := beg; WHILE v <= end DO S; v := v + inc END 

v := beg; WHILE v >= end DO S; v := v + inc END

  v := beg; t:=end; WHILE v <= t DO S; v := v + inc END 

  v := beg; t:=end; WHILE v >= t DO S; v := v + inc END 

for(v=beg;v<=end;v+=inc); for(v=beg;v>=end;v+=inc);

for (;;);
for(int i = 1; i < N && i[a] != 0; i *= 2);
for(float one; two < N; three++);
for(r > 8.0; rand() * 0.5 != 17; i < 8.0) printf("что хочу, то ворочу\n");
... чуть ли не любой вариант по вкусу
 

FOR v := beg TO end BY inc DO S END

for(v=beg;v<=end;v+=inc){S}; 
for(v=beg;v>=end;v+=inc){S}; 

PROCEDURE ForOriginal;
		BEGIN
			OPS.Get(sym);
			IF sym = ident THEN qualident(id);
				IF ~(id^.typ^.form IN intSet) THEN err(68) END ;
				CheckSym(becomes); Expression(y); pos := OPM.errpos;
				x := OPB.NewLeaf(id); OPB.Assign(x, y); SetPos(x);
				CheckSym(to); Expression(y); pos := OPM.errpos;
				IF y^.class # Nconst THEN
					name := "@@"; OPT.Insert(name, t); t^.name := OPT.NewName("@for");	(* avoid err 1 *)
					t^.mode := Var; t^.typ := x^.left^.typ;
					obj := OPT.topScope^.scope;
					IF obj = NIL THEN OPT.topScope^.scope := t
					ELSE
						WHILE obj^.link # NIL DO obj := obj^.link END;
						obj^.link := t
					END;
					z := OPB.NewLeaf(t); OPB.Assign(z, y); SetPos(z); OPB.Link(stat, last, z);
					y := OPB.NewLeaf(t)
				ELSIF (y^.typ^.form IN {Undef, Bool, Char}) THEN err(113)
				ELSE OPB.CheckAssign(x^.left^.typ, y)
				END;
...

PROCEDURE ForOriginal;
		BEGIN
			OPS.Get(sym);
			IF sym = ident THEN qualident(id);
				IF ~(id^.typ^.form IN intSet) THEN err(68) END ;
				CheckSym(becomes); Expression(y); pos := OPM.errpos;
				x := OPB.NewLeaf(id); OPB.Assign(x, y); SetPos(x);
				CheckSym(to); Expression(y); pos := OPM.errpos;
				IF (y^.typ^.form IN {Undef, Bool, Char}) THEN err(113)
				ELSE OPB.CheckAssign(x^.left^.typ, y)
				END;
...

MODULE ASCII; (** portable *)
IMPORT Console;
VAR
  n,b: INTEGER;
BEGIN (*$MAIN*)
b:=127;
  FOR n := 35 TO b DO b:=0; Console.WriteCh(CHR(n)) END;
END ASCII.

v := beg; WHILE v <= end DO S; v := v + inc END 

v := beg; lim := end; WHILE v <= lim DO S; v := v + inc END

ForStatement = FOR ident ":=" expression TO expression [BY ConstExpression] DO StatementSequence END