I would be happy if you could take a look to my project (C to PAS converter)

[Tommi]

I need to convert some C subroutine into Lazarus Pascal. So i developed this application that I think is the only one open source that do this. All that I found before this was just some string replacer, insted mine is a syntax interpreter.

Main goal was to help me converting C algorithms contained in R source code into Lazarus.
It supports FOR, WHILE, IF, pointers, and all main statements. Expressions are converted respecting priority between operators.

It doesnt't support CASE statement.

Here some example:

Code: [Select]

Original C code (taken from R source codes)

void kmeans_Lloyd(double *x, int *pn, int *pp, double *cen, int *pk, int *cl,
  int *pmaxiter, int *nc, double *wss)
{
    int n = *pn, k = *pk, p = *pp, maxiter = *pmaxiter;
    int iter, i, j, c, it, inew = 0;
    double best, dd, tmp;
    Rboolean updated;

    for(i = 0; i < n; i++) cl[i] = -1;
    for(iter = 0; iter < maxiter; iter++) {
updated = FALSE;
for(i = 0; i < n; i++) {
    /* find nearest centre for each point */
    best = R_PosInf;
    for(j = 0; j < k; j++) {
dd = 0.0;
for(c = 0; c < p; c++) {
    tmp = x[i+n*c] - cen[j+k*c];
    dd += tmp * tmp;
}
if(dd < best) {
    best = dd;
    inew = j+1;
}
    }
    if(cl[i] != inew) {
updated = TRUE;
cl[i] = inew;
    }
}
if(!updated) break;
/* update each centre */
for(j = 0; j < k*p; j++) cen[j] = 0.0;
for(j = 0; j < k; j++) nc[j] = 0;
for(i = 0; i < n; i++) {
    it = cl[i] - 1; nc[it]++;
    for(c = 0; c < p; c++) cen[it+c*k] += x[i+c*n];
}
for(j = 0; j < k*p; j++) cen[j] /= nc[j % k];
    }

    *pmaxiter = iter + 1;
    for(j = 0; j < k; j++) wss[j] = 0.0;
    for(i = 0; i < n; i++) {
it = cl[i] - 1;
for(c = 0; c < p; c++) {
    tmp = x[i+n*c] - cen[it+k*c];
    wss[it] += tmp * tmp;
}
    }
}

void kmeans_MacQueen(double *x, int *pn, int *pp, double *cen, int *pk,
     int *cl, int *pmaxiter, int *nc, double *wss)
{
    int n = *pn, k = *pk, p = *pp, maxiter = *pmaxiter;
    int iter, i, j, c, it, inew = 0, iold;
    double best, dd, tmp;
    Rboolean updated;

    /* first assign each point to the nearest cluster centre */
    for(i = 0; i < n; i++) {
best = R_PosInf;
for(j = 0; j < k; j++) {
    dd = 0.0;
    for(c = 0; c < p; c++) {
tmp = x[i+n*c] - cen[j+k*c];
dd += tmp * tmp;
    }
    if(dd < best) {
best = dd;
inew = j+1;
    }
}
if(cl[i] != inew) cl[i] = inew;
    }
   /* and recompute centres as centroids */
    for(j = 0; j < k*p; j++) cen[j] = 0.0;
    for(j = 0; j < k; j++) nc[j] = 0;
    for(i = 0; i < n; i++) {
it = cl[i] - 1; nc[it]++;
for(c = 0; c < p; c++) cen[it+c*k] += x[i+c*n];
    }
    for(j = 0; j < k*p; j++) cen[j] /= nc[j % k];

    for(iter = 0; iter < maxiter; iter++) {
updated = FALSE;
for(i = 0; i < n; i++) {
    best = R_PosInf;
    for(j = 0; j < k; j++) {
dd = 0.0;
for(c = 0; c < p; c++) {
    tmp = x[i+n*c] - cen[j+k*c];
    dd += tmp * tmp;
}
if(dd < best) {
    best = dd;
    inew = j;
}
    }
    if((iold = cl[i] - 1) != inew) {
updated = TRUE;
cl[i] = inew + 1;
nc[iold]--; nc[inew]++;
/* update old and new cluster centres */
for(c = 0; c < p; c++) {
    cen[iold+k*c] += (cen[iold+k*c] - x[i+n*c])/nc[iold];
    cen[inew+k*c] += (x[i+n*c] - cen[inew+k*c])/nc[inew];
}
    }
}
if(!updated) break;
    }

    *pmaxiter = iter + 1;
    for(j = 0; j < k; j++) wss[j] = 0.0;
    for(i = 0; i < n; i++) {
it = cl[i] - 1;
for(c = 0; c < p; c++) {
    tmp = x[i+n*c] - cen[it+k*c];
    wss[it] += tmp * tmp;
}
    }
}



Code: [Select]

//Converted code


procedure kmeans_Lloyd (
x:pDouble;
pn:pInteger;
pp:pInteger;
cen:pDouble;
pk:pInteger;
cl:pInteger;
pmaxiter:pInteger;
nc:pInteger;
wss:pDouble
);

var
n:integer;
k:integer;
p:integer;
maxiter:integer;
iter:integer;
i:integer;
j:integer;
c:integer;
it:integer;
inew:integer;
best:double;
dd:double;
tmp:double;
updated:Rboolean;
A0b0ca04e75:boolean;
A48ec43d6f10:boolean;
A0b0ca04e714:boolean;
A17719338e18:boolean;
A4f2166fb422:boolean;
Ae9c5e806450:boolean;
A17719338e55:boolean;
A0b0ca04e760:boolean;
A4f2166fb466:boolean;
Ae9c5e806472:boolean;
A17719338e80:boolean;
A0b0ca04e785:boolean;
A4f2166fb489:boolean;
begin
n := pn^;
k := pk^;
p := pp^;
maxiter := pmaxiter^;
inew := 0;
i := 0;
A0b0ca04e75 := false;
while ( true ) do
begin
if (A0b0ca04e75=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e75 := true;
cl[i] := -1;
end;
iter := 0;
A48ec43d6f10 := false;
while ( true ) do
begin
if (A48ec43d6f10=true ) then
begin
inc(iter);
end;
if not (iter<maxiter) then break;
A48ec43d6f10 := true;
updated := FALSE;
i := 0;
A0b0ca04e714 := false;
while ( true ) do
begin
if (A0b0ca04e714=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e714 := true;
best := R_PosInf;
j := 0;
A17719338e18 := false;
while ( true ) do
begin
if (A17719338e18=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e18 := true;
dd := 0.0;
c := 0;
A4f2166fb422 := false;
while ( true ) do
begin
if (A4f2166fb422=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb422 := true;
tmp := x[i+n*c] - cen[j+k*c];
dd += tmp * tmp;
end;
if ((dd<best)) then
begin
best := dd;
inew := j+1;
end;
end;
if (((cl[i])<>(inew))) then
begin
updated := TRUE;
cl[i] := inew;
end;
end;
if ((not(updated))) then
begin
break;
end;
j := 0;
Ae9c5e806450 := false;
while ( true ) do
begin
if (Ae9c5e806450=true ) then
begin
inc(j);
end;
if not (j<k*p) then break;
Ae9c5e806450 := true;
cen[j] := 0.0;
end;
j := 0;
A17719338e55 := false;
while ( true ) do
begin
if (A17719338e55=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e55 := true;
nc[j] := 0;
end;
i := 0;
A0b0ca04e760 := false;
while ( true ) do
begin
if (A0b0ca04e760=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e760 := true;
it := cl[i] - 1;
inc(nc[it]);
c := 0;
A4f2166fb466 := false;
while ( true ) do
begin
if (A4f2166fb466=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb466 := true;
cen[it+c*k] += x[i+c*n];
end;
end;
j := 0;
Ae9c5e806472 := false;
while ( true ) do
begin
if (Ae9c5e806472=true ) then
begin
inc(j);
end;
if not (j<k*p) then break;
Ae9c5e806472 := true;
cen[j] /= nc[j mod k];
end;
end;
pmaxiter^ := iter + 1;
j := 0;
A17719338e80 := false;
while ( true ) do
begin
if (A17719338e80=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e80 := true;
wss[j] := 0.0;
end;
i := 0;
A0b0ca04e785 := false;
while ( true ) do
begin
if (A0b0ca04e785=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e785 := true;
it := cl[i] - 1;
c := 0;
A4f2166fb489 := false;
while ( true ) do
begin
if (A4f2166fb489=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb489 := true;
tmp := x[i+n*c] - cen[it+k*c];
wss[it] += tmp * tmp;
end;
end;
end;

procedure kmeans_MacQueen (
x:pDouble;
pn:pInteger;
pp:pInteger;
cen:pDouble;
pk:pInteger;
cl:pInteger;
pmaxiter:pInteger;
nc:pInteger;
wss:pDouble
);

var
n:integer;
k:integer;
p:integer;
maxiter:integer;
iter:integer;
i:integer;
j:integer;
c:integer;
it:integer;
inew:integer;
iold:integer;
best:double;
dd:double;
tmp:double;
updated:Rboolean;
A0b0ca04e7108:boolean;
A17719338e112:boolean;
A4f2166fb4116:boolean;
Ae9c5e8064137:boolean;
A17719338e142:boolean;
A0b0ca04e7147:boolean;
A4f2166fb4153:boolean;
Ae9c5e8064159:boolean;
A48ec43d6f164:boolean;
A0b0ca04e7168:boolean;
A17719338e172:boolean;
A4f2166fb4176:boolean;
A4f2166fb4201:boolean;
A17719338e218:boolean;
A0b0ca04e7223:boolean;
A4f2166fb4227:boolean;
begin
n := pn^;
k := pk^;
p := pp^;
maxiter := pmaxiter^;
inew := 0;
i := 0;
A0b0ca04e7108 := false;
while ( true ) do
begin
if (A0b0ca04e7108=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e7108 := true;
best := R_PosInf;
j := 0;
A17719338e112 := false;
while ( true ) do
begin
if (A17719338e112=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e112 := true;
dd := 0.0;
c := 0;
A4f2166fb4116 := false;
while ( true ) do
begin
if (A4f2166fb4116=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb4116 := true;
tmp := x[i+n*c] - cen[j+k*c];
dd += tmp * tmp;
end;
if ((dd<best)) then
begin
best := dd;
inew := j+1;
end;
end;
if (((cl[i])<>(inew))) then
begin
cl[i] := inew;
end;
end;
j := 0;
Ae9c5e8064137 := false;
while ( true ) do
begin
if (Ae9c5e8064137=true ) then
begin
inc(j);
end;
if not (j<k*p) then break;
Ae9c5e8064137 := true;
cen[j] := 0.0;
end;
j := 0;
A17719338e142 := false;
while ( true ) do
begin
if (A17719338e142=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e142 := true;
nc[j] := 0;
end;
i := 0;
A0b0ca04e7147 := false;
while ( true ) do
begin
if (A0b0ca04e7147=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e7147 := true;
it := cl[i] - 1;
inc(nc[it]);
c := 0;
A4f2166fb4153 := false;
while ( true ) do
begin
if (A4f2166fb4153=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb4153 := true;
cen[it+c*k] += x[i+c*n];
end;
end;
j := 0;
Ae9c5e8064159 := false;
while ( true ) do
begin
if (Ae9c5e8064159=true ) then
begin
inc(j);
end;
if not (j<k*p) then break;
Ae9c5e8064159 := true;
cen[j] /= nc[j mod k];
end;
iter := 0;
A48ec43d6f164 := false;
while ( true ) do
begin
if (A48ec43d6f164=true ) then
begin
inc(iter);
end;
if not (iter<maxiter) then break;
A48ec43d6f164 := true;
updated := FALSE;
i := 0;
A0b0ca04e7168 := false;
while ( true ) do
begin
if (A0b0ca04e7168=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e7168 := true;
best := R_PosInf;
j := 0;
A17719338e172 := false;
while ( true ) do
begin
if (A17719338e172=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e172 := true;
dd := 0.0;
c := 0;
A4f2166fb4176 := false;
while ( true ) do
begin
if (A4f2166fb4176=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb4176 := true;
tmp := x[i+n*c] - cen[j+k*c];
dd += tmp * tmp;
end;
if ((dd<best)) then
begin
best := dd;
inew := j;
end;
end;
if ((((iold=cl[i]-1))<>(inew))) then
begin
updated := TRUE;
cl[i] := inew + 1;
dec(nc[iold]);
inc(nc[inew]);
c := 0;
A4f2166fb4201 := false;
while ( true ) do
begin
if (A4f2166fb4201=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb4201 := true;
cen[iold+k*c] += (cen[iold+k*c] - x[i+n*c])/nc[iold];
cen[inew+k*c] += (x[i+n*c] - cen[inew+k*c])/nc[inew];
end;
end;
end;
if ((not(updated))) then
begin
break;
end;
end;
pmaxiter^ := iter + 1;
j := 0;
A17719338e218 := false;
while ( true ) do
begin
if (A17719338e218=true ) then
begin
inc(j);
end;
if not (j<k) then break;
A17719338e218 := true;
wss[j] := 0.0;
end;
i := 0;
A0b0ca04e7223 := false;
while ( true ) do
begin
if (A0b0ca04e7223=true ) then
begin
inc(i);
end;
if not (i<n) then break;
A0b0ca04e7223 := true;
it := cl[i] - 1;
c := 0;
A4f2166fb4227 := false;
while ( true ) do
begin
if (A4f2166fb4227=true ) then
begin
inc(c);
end;
if not (c<p) then break;
A4f2166fb4227 := true;
tmp := x[i+n*c] - cen[it+k*c];
wss[it] += tmp * tmp;
end;
end;
end;

here there is the link to the project (on sourceforge):

http://ctopas.sourceforge.net/

I think that this project opens a world of math routines developed in C to lazarus users.

I will not develope this project anymore because it just do what I need, but if some one is interested in I will be happy to answer to any question.

I would be delighted if you say me what do you think about this project

[Fred vS]

I would be delighted if you say me what do you think about this project

I think it is a excellent project. 

But what are the plus vs other translators ? (c2pas, h2pas, c2delphi, ...) =>
http://forum.lazarus.freepascal.org/index.php/topic,17576.msg97094.html#msg97094

Many thanks.

[Tommi]

The plus is that :
c2pas: simply replace strings, it doesn't analize syntax. It just replace for example 'int' with 'integer' and so on. With c2pas you have to work very much time to convert a routine. Mine create code almost ready to be compiled.
h2pas. converts .h files, not the code.
c2delphi: I don't know what it does, but it is not free (79$ fee). Mine is open source and free.

[Fred vS]

The plus is that :
c2pas: simply replace strings, it doesn't analize syntax. It just replace for example 'int' with 'integer' and so on. With c2pas you have to work very much time to convert a routine. Mine create code almost ready to be compiled.
h2pas. converts .h files, not the code.
c2delphi: I don't know what it does, but it is not free (79$ fee). Mine is open source and free.

Excellent ! 

Hum, you have a good challenger : c2pas32 (for me, the best, but only for Windows)
http://www.astonshell.com/freeware/c2pas32/

I will test your ctopas solution and compare it to c2pas32 , i hope that ctopas will win 

Many thanks.

[Fred vS]

Hello.

Hum, how to use ctopaStom ?
When i run it, i have a form divided in 2 (see attachment).

[Tommi]

I just tried c2pas32,
the first thing that I see is that if in the for boolean formula there is a ++ or --, it doesn't convert.
It doesn't convert also if into the third field of the for statement there is something more than just ++ or --.
For example:

for(j = 0; j < k++; j++)

becomes:

Code: [Select]

      for{while} j:=0 to Pred(k{++} inc(k); ) { j++}
      do

ctopastom instead:

Code: [Select]

j := 0;
Ab5ee08d8a18 := false;
while ( true ) do
begin
if (Ab5ee08d8a18=true ) then
begin
  inc(j);
end;
  if not (j<k) then break;
inc(k);
Ab5ee08d8a18 := true;
....
....

To do this it uses auxiliary variables that is not elegant, but it works.

This:

 for(j = 0; --j< k++; j++) {

becomes:

Code: [Select]

j := 0;
A8fcc1348318 := false;
while ( true ) do
begin
if (A8fcc1348318=true ) then
begin
inc(j);
end;
dec(j);
if not (j<k) then break;
inc(k);
A8fcc1348318 := true;
....
....


[Tommi]

Hello.

Hum, how to use ctopaStom ?
When i run it, i have a form divided in 2 (see attachment).

Just copy original copy in the left and take the converted from the right.

[Fred vS]

Just copy original copy in the left and take the converted from the right.

Yep, c code in left, but nothing in right... (see attachment) 

[Tommi]

I don't know,
I just replaced your experiment and it works.
Here my screenshot.
May be is because in linux Memo1Change event are managed in different way ?
I never tested in linux.

Try  to add a button to generate the event instead the procedure TForm1.Memo1Change(Sender: TObject);

Into button pressed event just put:
memo2.text:=convertCtoPAS(memo1.text);

[Fred vS]

May be is because in linux event are managed in different way ?

Maybe, i do not know 

But why dont you add a button, like "Do Translation" ?

[Tommi]

I just did it. It is in attachment.

[Fred vS]

I just did it. It is in attachment.

Sorry but it does not work here on Linux 64 bit. I click on button but nothing appear at right side...

[skalogryz]

threads like this inspire me to create pages like that

It appears that Pascal developers have been obsessed with the idea of creating C to Pascal  conversion utility for a long time. As well as developers don't have much fantasy about how to name it

[Tommi]

I just did it. It is in attachment.

Sorry but it does not work here on Linux 64 bit. I click on button but nothing appear at right side...

I don't know why. The code doesn't use any OS relevant API. I cannot install linux because I cannot partition my laptop Hard Disk. I will make some test in future.