In .NET, compare words, strings, streams and files with a single line of C# or VB.NET code.
Detects added, deleted, and changed lines.
Recognizes code block begin and end tags.
Case Sensitive or Insensitive Matches.
Option to ignore horizontal and vertical white space differences .
Ability to exclude textual differences by contains, starts with, ends with, or regular expressions.
Output differences to CSV Streams and Files.
Output differences to HTML Streams and Files.
Output differences to Text Streams and Files.
Output differences to DataTables.
Works with .NET 3.5 or higher.
Distribute with your application royalty free.

RegexBuddy is your perfect companion for working with regular expressions. Easily create regular expressions that match exactly what you want. Clearly understand complex regexes written by others. Quickly test any regex on sample strings and files, preventing mistakes on actual data. Debug without guesswork by stepping through the actual matching process. Use the regex with source code snippets automatically adjusted to the particulars of your programming language. Collect and document libraries of regular expressions for future reuse. GREP (search-and-replace) through files and folders. Integrate RegexBuddy with your favorite searching and editing tools for instant access.

SQL Eval Function is a C# expression evaluator. You can evaluate arithmetic expressions, regex, and more directly in T-SQL.

RegexBuddy is your perfect companion for working with regular expressions. Easily create regular expressions that match exactly what you want. Clearly understand complex regexes written by others. Quickly test any regex on sample strings and files, preventing mistakes on actual data. Debug without guesswork by stepping through the actual matching process. Use the regex with source code snippets automatically adjusted to the particulars of your programming language. Collect and document libraries of regular expressions for future reuse. GREP (search-and-replace) through files and folders. Integrate RegexBuddy with your favorite searching and editing tools for instant access.

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.

iGrid plots drawing grid right over your desktop, so you can use it everywhere, with any drawing application without any special plugins for different graphic editors. Choose "Settings..." and you'll see the settings dialog, where you can choose grid type between orthogonal, axonometric and handwriting, preset for each grid type and common grid parameters, like color and opacity. All the changes will be displayed in the preview area immediately.

Includes syntax highlighting, code builders and sidekicks, clickable method and function navigators, code completion, tag completion, function lookup, powerful regular expression enabled search tools, bracket and tag matching, CSS, XML, and HTML validators, a CSS style builder, an HTML tag builder, HTML Tidy, a powerful file system browser, bookmarks, file compare, key ahead, color chooser, and much more.

Includes syntax highlighting, code builders and sidekicks, clickable method and function navigators, code completion, tag completion, function lookup, powerful regular expression enabled search tools, bracket and tag matching, CSS, XML, and HTML validators, a CSS style builder, an HTML tag builder, HTML Tidy, a powerful file system browser, bookmarks, file compare, key ahead, color chooser, and much more.

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.