Name Parser is the most advanced name splitter in the world. Name Parser can be used to split names for storage into separate database fields. It can also match root names when matching names from different systems; Mike will match with Michael, Bob will match with Robert. Name Parser supports all .NET project types including ASP.NET MVC, WPF, Webforms, Winforms, WCF, Windows Services, and Web Services. It can be used with any .NET language including VB.NET and C#.

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.

Designed by developers for developers, SlickEdit’s award-winning source code and text editor is respected for its rich set of coding tools and powerful time-saving programming features. A true cross-platform, multi-language editor, SlickEdit gives programmers the ability to code in over 40 languages on 9 platforms.

WeBuilder is revolutionary all-in-one web code editor for all your web document editing needs. Clean and convenient interface, quick startup, true flexibility and powerful features allow you to create and edit HTML, CSS, jаvascript, VBScript, PHP, ASP, SSI, Perl code faster and easier than ever, while integrated tools enable you to validate, reuse, navigate and deploy your code in an efficient and sophisticated manner.

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.

[justify]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.