DIRegEx is a library of components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl for Delphi (Embarcadero / CodeGear / Borland).

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

Mathematica is the most powerful general-purpose computing system in the world. Since its first release in 1988, it has had a profound impact on how computers are used in technology and other fields. Based on 20 years of world-class algorithm and software development, Mathematica has made a major breakthrough in expanding the scope and applicability and redefining our understanding of computing methods. Mathematica's unique symbolic structure enables Mathematica to bring us a new language and interface unity. This concept can make the automatic calculation of algorithms, the operation of man-machine dialogue, and the dynamic representation reach a new level, and at the same time, it can create a new way of connecting with the data world.

Best selling POP3/SMTP email .NET component for C#, VB.NET, and ASP.NET. Best selling Zip .NET component for C#, VB.NET, and ASP.NET. HTTP client component for communicating with HTTP servers.

Stimulsoft Ultimate is a universal set of tools for creating reports and dashboards. The product includes a complete set of tools for WinForms, ASP.NET, .NET Core, jаvascript, WPF, PHP, Java, and other environments. We provide easy-to-use and, at the same time, fully functional designer. You may create reports and dashboards for any of the supported platforms. Special wizards and editors will help you to cope with any task easily.

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

DIRegEx is a library of components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl for Delphi (Embarcadero / CodeGear / Borland).

One-click to remove watermarks or add text & image watermark to copyright protect your photos and videos. Get Rid of the Watermarks, logos, People, Objects, Date Stamps, Texts, Emojis Easily and Quickly with the Neural Network Algorithm.

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.

YuPcre2 is a library of Delphi components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl, with just a few differences. There are two matching algorithms, the standard Perl and alternative DFA algorithm:

The Perl algorithm is what you are used to from Perl and j@vascript. It is fast and supports the complete pattern syntax. You will likely be using it most of the time.
DFA is a special purpose algorithm. If finds all possible matches and, in particular, it finds the longest. It never backtracks and supports partial matching better, in particular multi-segment matching of very long subject strings.