Search Results for "regular"

...It is designed to recursively find any source file matching specific rules and count the line breaks within that file. You may specify file suffixes to include or exclude as well as regular expressions for code lines that shall be excluded (e.g. to exclude comments). By default a heuristic algorithm skips binary files. You may configure the restrictiveness of this algorithm with command line options.

The CodeXCavator is a tool for source code indexing, tagging, and fast full-text search. It consists of two applications: The indexer is a configurable tool for creating an index for large amounts of source code or plain text files. The searcher is a GUI based tool for fast full text search within previously created indexes. The toolchain also supports code tagging, i.e. you can include special tags within comments inside the source code. These are indexed separately and can be...

Hack includes monospaced regular, bold, italic, and bold italic sets to cover all of your syntax highlighting needs. Over 1500 glyphs that include lovingly tuned extended Latin, modern Greek, and Cyrillic character sets. Powerline glyphs are included in the regular set. Patching is not necessary. Install and go. No frills. No gimmicks. Hack is hand groomed and optically balanced to be your go-to code face.

TODOs is a small command-line utility to search TODO, FIXME and similar comments in project files. It is written in Python 3 and licensed under the terms of GNU GPL 3 license. Supported output formats are TXT, HTML and XML.

.NET desktop app to find (and replace) text in folders and files.

RegexLord is the IDE for developing regular expression assemblies for .NET. Full stop. It provides syntax highlighting (via the sharpdevelop text editor, http://sharpdevelop.net/), bracket matching, namespace management, code folding, and an easy to

Java libraries with the functionality of indenting source code utilizing regular expresions. Currently C/C++, Java, HTML, and XML are supported.

DPRLE (decision procedure for regular language equations) solves subset constraints that involve language variables and concatenation.