PowerGREP is a powerful Windows grep tool. Quickly search through large numbers of files on your PC or network, including text and binary files, compressed archives, MS Word documents, Excel spreadsheets, PDF files, OpenOffice files, etc. Find the information you want with powerful text patterns (regular expressions) specifying the form of what you want, instead of literal text. Search and replace with one or many regular expressions to comprehensively maintain web sites, source code, reports, etc. Extract statistics and knowledge from logs files and large data sets.

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).

Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.

Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.

Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.

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.

Database Searcher is like Google for your SQL Server database. It will search all columns for all tables over multiple databases. It will return a summary of matches, the generated SQL and the detailed matches per table. It will also search the schema by the table names or column names. Knowledge of SQL queries is not required.

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.

Instantly find every occurrence of a word, phrase, function, variable, API, error code or anything else in your source code, with a single keystroke. Entrian Source Search is a search engine for your source code. It builds a full-text index of your files, and searches it instantly, giving syntax-colored results. It indexes everything, not just code, and includes powerful Fuzzy and Loose searching.

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.