rilpoint_mw113

RIL DelphiToPHP Converter

Under development

RIL DelphiToPHP Converter is for Pascal programmers, like me, who wants to reuse some algorithms in PHP scripts.

Now the Internet doesn't seem to be littered with Pascal to PHP converters, so therefore I made one. Well, the first version supports conversion of only basic Pascal syntax. In my solution I extended the work of others by using a converter from Pascal to C++ named delphitocpp, and from the result of this converter (C++) I go on to convert the C++ code into ready to run PHP script.

Method signatures littered with unknown types (unknown to both PHP and to Delphi btw) may need to be listed in a config file so that the converter can strip such things out of the code. But except for that, this Pascal to PHP converter should be able to do much trivial work, with need for no or little manual correction.

The amount of work needed to "manually postprocess" the PHP code to make it doing exactly the same thing as the original Pascal code, will of course be determined by how well the original code complies with the PHP-way of doing things. But the point is, you may get up to 90%+ of the conversion job done for low level code, at the click of a button.

Original Delphi Pascal code


Small example code (sharp) which was 100% converted with the RIL DelphiToPHP Converter:

  1. unit SomeParser;

  2.  

  3. //...

  4.  

  5. function FindClosingBracket(const S: String; StartPos: Integer; MaxBrackCnt:Byte; out 

  6.                           FoundPos:Integer; out FoundBrackCnt: Integer): Boolean;

  7. //

  8. // Description: Look up double square brackets ']]', or only a single bracket

  9. //              ']', which is enforced if MaxBracktCnt is set to = 1. 

  10. //              The FoundPos and FoundBracketCnt values are undefined if the 

  11. //              function returns false (thus, do not attempt read/used them).

  12. // FromPos    : Position to start searching from.

  13. // MaxBrackCnt: If for certain there's no more than one bracket at where from

  14. //              the call is made, then the result must not exceed 1, regardless.

  15. // FoundPos:    Position when a matching closing Brack was found.

  16. // FoundBrackCnt: Number of found brackets that fit the conditions.

  17. //

  18. var

  19.     i, Brack: Integer;

  20. begin

  21.     Result := false;

  22.     Brack  := 1;

  23.  

  24.     // Only lookbehind is allowed

  25.     for i := StartPos+1 to Length(S) do

  26.     begin

  27.         if S[i]='[' then

  28.             Inc(Brack)

  29.  

  30.         else if S[i]=']' then begin

  31.             Dec(Brack);

  32.             if Brack=0 then

  33.             begin

  34.                 FoundPos := i;  // We already found it, but we may still adjust it ...

  35.                 FoundBrackCnt := 1;

  36.                 if (MaxBrackCnt = 2) and (S[i-1]=']') then begin {MaxBrackCnt = 2 }

  37.                     FoundPos := i-1;

  38.                     FoundBrackCnt := 2;

  39.                 end;

  40.                 Result := True;

  41.                 Break;

  42.             end;

  43.         end;

  44.     end;

  45. end; {FindClosingBracket}

  46.  

  47. end.


And here's the 100% automatically converted PHP code


  1.     function FindClosingBracket( &$S, $StartPos, $MaxBrackCnt, &$FoundPos, &$FoundBrackCnt)

  2.     //#

  3.     //# Description: Look up double square brackets ']]', or only a single bracket

  4.     //#              ']', which is enforced if MaxBracktCnt is set to = 1. 

  5.     //#              The FoundPos and FoundBracketCnt values are undefined if the 

  6.     //#              function returns false (thus, do not attempt read/used them).

  7.     //# FromPos    : Position to start searching from.

  8.     //# MaxBrackCnt: If for certain there's no more than one bracket at where from

  9.     //#              the call is made, then the result must not exceed 1, regardless.

  10.     //# FoundPos:    Position when a matching closing Brack was found.

  11.     //# FoundBrackCnt: Number of found brackets that fit the conditions.

  12.     //#

  13.     {   /**$result;**/

  14.         /**$i;**/ /**$Brack;**/

  15.  

  16.         $result = false;

  17.         $Brack = 1;

  18.  

  19.         //# Only lookbehind is allowed

  20.         { $i_end = strLen( $S )+1 ;

  21.         for( $i = $StartPos+1 ; $i < $i_end ; $i++ )

  22.         {

  23.             if(  $S[$i]=="[" )

  24.                 $Brack++;

  25.             else if(  $S[$i]=="]" ) {

  26.                 $Brack--;

  27.                 if(  $Brack==0 )

  28.                 {

  29.                     $FoundPos = $i;  //# We already found it, but we may still adjust it ...

  30.                     $FoundBrackCnt = 1;

  31.                     if(  ( $MaxBrackCnt == 2 ) && ( $S[ $i-1 ]=="]" ) ) { /*$MaxBrackCnt = 2 */

  32.                         $FoundPos = $i-1;

  33.                         $FoundBrackCnt = 2;

  34.                     }

  35.                     $result = true;

  36.                     break;

  37.                 }

  38.             }

  39.         }}

  40.         return $result;

  41.     } /*FindClosingBracket*/

 :::: Parsed using GeSHi 1.0.8  ::::


To be continued.

Retrieved from "http://wiki.rilnet.com/wiki/RIL_DelphiToPHP_Converter"
Skin by RIL Partner