Помогите найти ошибку

[Dormammu]

Здравствуйте. Выдает ошибку в 16 строке:"ChM_KR.pas(16) : Ожидалось имя процедуры или функции". Что не так?

program ChM_KR;
const n=4;
type RMATR=array[1..n,1..n] of real;
IVECT=array[1..n] of integer;
RVECT = array [1..n] of real;

Procedure DECOMP(n:integer; var A:rmatr; var eps: real; var ip:ivect;
var det:real; 
var ifsolve: Boolean);
Label  10;
Var I, j, k, km, ipm : integer;
S, norm, am : real;
Begin 
Ifsolve := true;
Det := 1.0;
For I :=1 to n do ip(i):=I;


Norm:=0.0;
For it:=1 to n do
Begin s := 0.0;
For j := 1 to n do s:= s+abs
(A[i, j]);
If norm<s then norm:=s
End;
Eps := eps*norm;
For k:= 1 to n=1 do
Begin 
Am := abs(A[k, k]); km:=k;
For I := k+1 to n do
If abs (A[I, k])>am then
Begin am := abs(A[I, k]); km:=I end;
If km<>k then 
Begin 
Det := -det; ipm := ip(km);
Ip (km) := ip(k); ip (k):= ipm;
For j:= 1 to n do 
Begin am:= A[km, j];
A[km, j]:= A[k, j];
A[k, j]:= am
End
End;
If abs (A[k, k])< eps then 
Begin ifsolve := false; goto10 end;
For it:=1 to n do 
Begin am := A[I, k] / A[k, k] ; A[It, k]:= am;
For j:=1 to n do A[I, j] := A[I, j] - am * A[k, j];
End;
End;
10: if ifsolve and (abs(A[n, n])>=eps) then
For k := 1 to n do det := det * A[k, k]
Else
Det := 0.0
End;

Procedure SOLVE ( n:integer; var A:rmatr; var ip:ivect; var s:rvect);
Var I, j, k:integer;
S:real;
Y:rvect;
Begin 
For k :=1 to n do y[k] :=s(ip[k]);
For k:= n downto 2 do 
Begin 
S:=Y[k];
For j := 1 to k-1 do 
s:= s-A[k, j] * Y[ j];
Y[k]:=s;
end;
S[n] := y[n] / A[n, n];
For k:= n-1 downto i do
Begin 
S:= Y[k];
For j := k+1 to n do
S:= (S - A[k, j]) * S[j];
S[k] := s / A[k, k]
End;end;

begin

end.

[gantzboss]

Сообщение от Dormammu

ip(i):=I

Что это? Может тут массив

[Dormammu]

Это массив типа integer. Объявлен. IVECT=array[1..n] of integer;

[gantzboss]

Сообщение от Dormammu

Это массив типа integer. Объявлен. IVECT=array[1..n] of integer;

так как к массиву обращаться надо?
так ip(i):=I
или так ip[i]:=I

я правлю ваш код поверьте у вас десяток ошибок

так он хотя бы компилиться

program ChM_KR;
const n=4;
type RMATR=array[1..n,1..n] of real;
  IVECT=array[1..n] of integer;
  RVECT = array [1..n] of real;

Procedure DECOMP(n:integer; var A:rmatr; var eps: real; var ip:ivect; var det:real; var ifsolve: Boolean);
Label  10;
Var I, j, k, km, ipm : integer;
  S, norm, am : real;
Begin
  Ifsolve := true;
  Det := 1.0;
  For I :=1 to n do ip[i]:=I;
  Norm:=0.0;
  For i:=1 to n do
  Begin s := 0.0;
    For j := 1 to n do s:= s+abs(A[i, j]);
    If norm<s then norm:=s
  End;
  Eps := eps*norm;
  For k:= 1 to n+1 do
  Begin
    Am := abs(A[k, k]); km:=k;
    For I := k+1 to n do
      If abs (A[I, k])>am then
      Begin am := abs(A[I, k]); km:=I end;
    If km<>k then
    Begin
      Det := -det; ipm := ip[km];
      Ip [km] := ip[k]; ip[k]:= ipm;
      For j:= 1 to n do
      Begin am:= A[km, j];
        A[km, j]:= A[k, j];
        A[k, j]:= am
      End;
    End;
    If abs (A[k, k])< eps then
    Begin ifsolve := false; goto 10 end;
    For i:=1 to n do
    Begin am := A[I, k] / A[k, k] ; A[I, k]:= am;
      For j:=1 to n do A[I, j] := A[I, j] - am * A[k, j];
    End;
  End;
  10: if ifsolve and (abs(A[n, n])>=eps) then
    For k := 1 to n do det := det * A[k, k]
    Else
      Det := 0.0
End;

Procedure SOLVE ( n:integer; var A:rmatr; var ip:ivect; var s1:rvect);
Var I, j, k:integer;
  S:real;
  Y:rvect;
Begin
  For k :=1 to n do y[k] :=s1[ip[k]];
  For k:= n downto 2 do
  Begin
    S:=Y[k];
    For j := 1 to k-1 do
      s:= s-A[k, j] * Y[ j];
    Y[k]:=s;
  end;
  S1[n] := y[n] / A[n, n];
  For k:= n-1 downto i do
  Begin
    S:= Y[k];
    For j := k+1 to n do
      S:= (S - A[k, j]) * S1[j];
    S1[k] := s / A[k, k]
  End;
end;

begin

end.

[Dormammu]

Большое спасибо за помощь.