Instantly convert code snippets from Perl to Delphi with our free online code converter. Transform your code easily and accurately.
Learn how to use Claude Code the right way with our guide — so you can:
Eliminate Debugging Headaches
Claude understands entire codebases and delivers code that works the first time.
Write Code You Can Trust
Every snippet is production-grade, maintainable, and ready to ship.
Finish Projects 10x Faster
Move from idea to working product without weeks of trial and error.
Complete AI Coding Guide with Claude Code: $19(was $49)
Limited-time launch pricing—save 60%.
We prioritize your code's security and privacy. Your code is not stored on our servers and is only temporarily processed for conversion. We use OpenAI's secure servers for the conversion process, ensuring your code remains confidential.
Perl is a family of two high-level, general-purpose, interpreted programming languages.
Delphi is an event-driven programming language based on Object Pascal.
sub is_palindrome {
my $str = shift;
$str =~ s/[^a-zA-Z0-9]//g;
$str = lc($str);
return $str eq reverse($str);
}
# Example usage
print is_palindrome("A man, a plan, a canal: Panama") ? "true\n" : "false\n";
print is_palindrome("race a car") ? "true\n" : "false\n";
function IsPalindrome(const S: string): Boolean;
var
CleanStr: string;
I: Integer;
begin
// Remove non-alphanumeric characters and convert to lowercase
CleanStr := '';
for I := 1 to Length(S) do
if S[I].IsLetterOrDigit then
CleanStr := CleanStr + S[I].ToLower;
// Check if the string is equal to its reverse
Result := CleanStr = ReverseString(CleanStr);
end;
// Example usage
WriteLn(IsPalindrome('A man, a plan, a canal: Panama')); // True
WriteLn(IsPalindrome('race a car')); // False
sub bubble_sort {
my @arr = @_;
my $n = scalar @arr;
for my $i (0..$n-1) {
for my $j (0..$n-$i-2) {
if ($arr[$j] > $arr[$j+1]) {
@arr[$j,$j+1] = @arr[$j+1,$j];
}
}
}
return @arr;
}
my @arr = (64, 34, 25, 12, 22, 11, 90);
print join(" ", bubble_sort(@arr)) . "\n";
procedure BubbleSort(var Arr: array of Integer);
var
I, J, Temp: Integer;
begin
for I := High(Arr) downto Low(Arr) do
for J := Low(Arr) to I - 1 do
if Arr[J] > Arr[J + 1] then
begin
Temp := Arr[J];
Arr[J] := Arr[J + 1];
Arr[J + 1] := Temp;
end;
end;
// Example usage
var
Arr: array of Integer;
begin
SetLength(Arr, 7);
Arr[0] := 64; Arr[1] := 34; Arr[2] := 25; Arr[3] := 12;
Arr[4] := 22; Arr[5] := 11; Arr[6] := 90;
WriteLn('Original array:');
PrintArray(Arr);
BubbleSort(Arr);
WriteLn('Sorted array:');
PrintArray(Arr);
end;
Convert Perl to Python
Open ConverterConvert Perl to JavaScript
Open ConverterConvert Perl to TypeScript
Open ConverterConvert Perl to Java
Open ConverterConvert Perl to C
Open ConverterConvert Perl to C++
Open ConverterConvert Perl to C#
Open ConverterConvert Perl to Go
Open ConverterConvert Perl to Dart
Open ConverterConvert Perl to Ruby
Open ConverterConvert Perl to Swift
Open ConverterConvert Perl to Kotlin
Open ConverterConvert Perl to Rust
Open ConverterConvert Perl to Scala
Open ConverterConvert Perl to PHP
Open ConverterConvert Perl to R
Open ConverterConvert Perl to Haskell
Open ConverterConvert Perl to Julia
Open ConverterConvert Perl to MATLAB
Open ConverterConvert Perl to Lua
Open ConverterConvert Perl to Assembly
Open ConverterConvert Perl to Groovy
Open ConverterConvert Perl to Elixir
Open ConverterConvert Perl to F#
Open ConverterConvert Perl to Clojure
Open Converter