regular expressions
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 940
regular expression parser 1.1
regular expression parser is a C++ regexp parser that accomplishes The Open Group specification Issue 6. more>>
regular expression parser is a C++ regexp parser that accomplishes The Open Group specification Issue 6, IEEE Std 1003.1, 2004 Edition.
regular expression parser allows you to parse input using regular expressions, and to retrieve parsed sub-expression matches in a few steps.
<<lessregular expression parser allows you to parse input using regular expressions, and to retrieve parsed sub-expression matches in a few steps.
Download (0.33MB)
Added: 2006-11-27 License: GPL (GNU General Public License) Price:
624 downloads
Regular Expression Graphing Program 0.2
Regular Expression Graphing Program project is a regular expression graphing program. more>>
Regular Expression Graphing Program project is a regular expression graphing program.
This program is designed to take a regular expression and produce a graph of the state machine that is used to parse the regular expression.
It is useful for teaching regular expressions and state machines.
The program comes with a built-in tutorial and sample set of regular expressions.
Main features:
- This will not graph all the regular expressions. Some of the more advanced features of the engine are just not handled.
- We currently ``graph the ``group, no $1 (?:..) operator by displaying nothing. A box should be put around the expression.
- The boxes drawn by the program are a fixed with not related to the size of the text they contain. Text can easily overflow the box.
- The system is UNIX/Linux specific. This is caused by only one small section of code should anyone want to port this to a braindamaged operating system.
- Better use of color can be made. Specifically all the nodes do not have to be green. Come to think of it they call dont have to be rectangles either.
- Sometimes the lines connecting one section to another take some strange twists.
<<lessThis program is designed to take a regular expression and produce a graph of the state machine that is used to parse the regular expression.
It is useful for teaching regular expressions and state machines.
The program comes with a built-in tutorial and sample set of regular expressions.
Main features:
- This will not graph all the regular expressions. Some of the more advanced features of the engine are just not handled.
- We currently ``graph the ``group, no $1 (?:..) operator by displaying nothing. A box should be put around the expression.
- The boxes drawn by the program are a fixed with not related to the size of the text they contain. Text can easily overflow the box.
- The system is UNIX/Linux specific. This is caused by only one small section of code should anyone want to port this to a braindamaged operating system.
- Better use of color can be made. Specifically all the nodes do not have to be green. Come to think of it they call dont have to be rectangles either.
- Sometimes the lines connecting one section to another take some strange twists.
Download (4.3MB)
Added: 2006-10-10 License: GPL (GNU General Public License) Price:
1113 downloads
Python Regular Expression Builder 0.1.6
Python Regular Expression Builder is a wxPython GUI to the re python module. more>>
Python Regular Expression Builder is a wxPython GUI to the re python module; it will speed up the development of Python regular expression (similar to PCRE).
The GUI is simple and features 3 parts:
- A text box where the text to be analyzed is displayed
- A text box where the regular expression to be applied is displayed
- A tree control where the results are displayed
When one of the two textboxes change the regex is compiled and applied. Errors in the regex are shown in a statusbar.
Pyreb ships with a simple XMLRPC server that can be used to control pyreb from an external application. It must be started using the
Tools/Start XMLRPC Server
menu item. The XMLRPC server understands 4 methods:
- Pyreb.setText(Txt)
- Pyreb.getText()
- Pyreb.setRegex(Txt)
- Pyreb.getRegex()
The first two get/set the text in the uppermost section; the last two get/set the regex in the medium section. Once the text/regex is set the match is recalculated and shown, as it would happen in interactive usage.
A sample session:
>>> import xmlrpclib
>>> a = xmlrpclib.ServerProxy("http://localhost:17787")
>>> a.system.listMethods()
[Pyreb.getRegex, Pyreb.getText, Pyreb.setRegex, Pyreb.setText, system.listMethods, system.methodHelp, system.methodSignature]
>>> a.Pyreb.setText("abc")
setText
>>> a.Pyreb.getText()
abc
>>> a.Pyreb.setRegex(a?(bc){1,})
setRegex
These commands set the text abc in the "Text to analyze" edit box, the regex in the "Regex to apply" edit box and recomputes the match, shown in the lower "Results" tree.
<<lessThe GUI is simple and features 3 parts:
- A text box where the text to be analyzed is displayed
- A text box where the regular expression to be applied is displayed
- A tree control where the results are displayed
When one of the two textboxes change the regex is compiled and applied. Errors in the regex are shown in a statusbar.
Pyreb ships with a simple XMLRPC server that can be used to control pyreb from an external application. It must be started using the
Tools/Start XMLRPC Server
menu item. The XMLRPC server understands 4 methods:
- Pyreb.setText(Txt)
- Pyreb.getText()
- Pyreb.setRegex(Txt)
- Pyreb.getRegex()
The first two get/set the text in the uppermost section; the last two get/set the regex in the medium section. Once the text/regex is set the match is recalculated and shown, as it would happen in interactive usage.
A sample session:
>>> import xmlrpclib
>>> a = xmlrpclib.ServerProxy("http://localhost:17787")
>>> a.system.listMethods()
[Pyreb.getRegex, Pyreb.getText, Pyreb.setRegex, Pyreb.setText, system.listMethods, system.methodHelp, system.methodSignature]
>>> a.Pyreb.setText("abc")
setText
>>> a.Pyreb.getText()
abc
>>> a.Pyreb.setRegex(a?(bc){1,})
setRegex
These commands set the text abc in the "Text to analyze" edit box, the regex in the "Regex to apply" edit box and recomputes the match, shown in the lower "Results" tree.
Download (0.018MB)
Added: 2006-12-11 License: GPL (GNU General Public License) Price:
619 downloads
RegExplorer 0.1.6
RegExplorer project is a regular Expression Explorer. more>>
RegExplorer project is a regular Expression Explorer.
It allows for writing regular expressions and visually see the matches, thus making regular expression much easier to write and maintain.
<<lessIt allows for writing regular expressions and visually see the matches, thus making regular expression much easier to write and maintain.
Download (0.028MB)
Added: 2006-11-03 License: QPL (QT Public License) Price:
1086 downloads
GRegExp Explorer 0.4.0
GRegExp Explorer is a graphical regular expression explorer based on the PCRE regular expression library. more>>
GRegExp Explorer is a graphical regular expression explorer based on the PCRE regular expression library. It is possible to test regular expressions on the fly and check the result in detail.
<<less Download (0.12MB)
Added: 2007-06-12 License: GPL (GNU General Public License) Price:
864 downloads
RegURL 0.2
RegURL is an extension which applies a regular expression on the URL. more>>
RegURL is an extension which applies a regular expression on the URL.
A regular expression is a string that is used to describe or match a set of strings, according to certain syntax rules. For example, the regular expression bex can be used to describe (and search for) all of the instances of the string "ex" that occur at word breaks (signified by the b).
Thus in the phrase, "Texts for expert experimenters," the regular expresssion bex returns the "ex" in "expert" and "experimenters," but not in "Texts" (because the "ex" occurs inside the word there and not at the word break).
Regular expressions are used by many text editors and utilities to search and manipulate bodies of text based on certain patterns. Many programming languages support regular expressions for string manipulation.
For example, Perl and Tcl have a powerful regular expression engine built directly into their syntax. The set of utilities (including the editor ed and the filter grep) provided by Unix distributions were the first to popularize the concept of regular expressions.
"Regular expression" is often shortened in speech to regex, and in writing to regexp or regex (singular) or regexps, regexes, or regexen (plural).
<<lessA regular expression is a string that is used to describe or match a set of strings, according to certain syntax rules. For example, the regular expression bex can be used to describe (and search for) all of the instances of the string "ex" that occur at word breaks (signified by the b).
Thus in the phrase, "Texts for expert experimenters," the regular expresssion bex returns the "ex" in "expert" and "experimenters," but not in "Texts" (because the "ex" occurs inside the word there and not at the word break).
Regular expressions are used by many text editors and utilities to search and manipulate bodies of text based on certain patterns. Many programming languages support regular expressions for string manipulation.
For example, Perl and Tcl have a powerful regular expression engine built directly into their syntax. The set of utilities (including the editor ed and the filter grep) provided by Unix distributions were the first to popularize the concept of regular expressions.
"Regular expression" is often shortened in speech to regex, and in writing to regexp or regex (singular) or regexps, regexes, or regexen (plural).
Download (0.004MB)
Added: 2007-04-14 License: MPL (Mozilla Public License) Price:
927 downloads
regexxer 0.9
regexxer project is a nifty search/replace tool featuring Perl-style regular expressions. more>>
regexxer project is a nifty search/replace tool featuring Perl-style regular expressions.
It features recursive search through directory trees and Perl-style regular expressions (using libpcre). The user interface is similar to the project-wide search/replace dialog in the Sniff+ IDE, but regexxer aims to surpass it.
<<lessIt features recursive search through directory trees and Perl-style regular expressions (using libpcre). The user interface is similar to the project-wide search/replace dialog in the Sniff+ IDE, but regexxer aims to surpass it.
Download (0.29MB)
Added: 2007-02-21 License: GPL (GNU General Public License) Price:
977 downloads
Regexp::Assemble 0.28
Regexp::Assemble is Perl module to assemble multiple Regular Expressions into a single RE. more>>
Regexp::Assemble is Perl module to assemble multiple Regular Expressions into a single RE.
SYNOPSIS
use Regexp::Assemble;
my $ra = Regexp::Assemble->new;
$ra->add( ab+c );
$ra->add( ab+- );
$ra->add( awd+ );
$ra->add( ad+ );
print $ra->re; # prints a(?:w?d+|b+[-c])
Regexp::Assemble takes an arbitrary number of regular expressions and assembles them into a single regular expression (or RE) that matches all that the individual REs match.
As a result, instead of having a large list of expressions to loop over, a target string only needs to be tested against one expression. This is interesting when you have several thousand patterns to deal with. Serious effort is made to produce the smallest pattern possible.
It is also possible to track the original patterns, so that you can determine which, among the source patterns that form the assembled pattern, was the one that caused the match to occur.
You should realise that large numbers of alternations are processed in perls regular expression engine in O(n) time, not O(1). If you are still having performance problems, you should look at using a trie. Note that Perls own regular expression engine will implement trie optimisations in perl 5.10 (they are already available in perl 5.9.3 if you want to try them out). Regexp::Assemble will do the right thing when it knows its running on a a tried perl. (At least in some version after this one).
<<lessSYNOPSIS
use Regexp::Assemble;
my $ra = Regexp::Assemble->new;
$ra->add( ab+c );
$ra->add( ab+- );
$ra->add( awd+ );
$ra->add( ad+ );
print $ra->re; # prints a(?:w?d+|b+[-c])
Regexp::Assemble takes an arbitrary number of regular expressions and assembles them into a single regular expression (or RE) that matches all that the individual REs match.
As a result, instead of having a large list of expressions to loop over, a target string only needs to be tested against one expression. This is interesting when you have several thousand patterns to deal with. Serious effort is made to produce the smallest pattern possible.
It is also possible to track the original patterns, so that you can determine which, among the source patterns that form the assembled pattern, was the one that caused the match to occur.
You should realise that large numbers of alternations are processed in perls regular expression engine in O(n) time, not O(1). If you are still having performance problems, you should look at using a trie. Note that Perls own regular expression engine will implement trie optimisations in perl 5.10 (they are already available in perl 5.9.3 if you want to try them out). Regexp::Assemble will do the right thing when it knows its running on a a tried perl. (At least in some version after this one).
Download (0.080MB)
Added: 2007-04-03 License: Perl Artistic License Price:
935 downloads

RegexSR for liunx 1.0.0
A tool to create and test complex regular expressions. more>> RegexSR is a very easy-to-use and powerful tool (written in Java) to create and test complex regular expressions.
The plugin system provides extra functionalities, such as transforming expressions into Java code, and allows the user to create his own extensions.
Features include testing regular expressions, handling text through regular expressions or plugins, renaming files, developing plugins, and managing expressions in the repository.<<less
Download (502KB)
Added: 2009-04-10 License: Freeware Price: Free
196 downloads
Regexp::Wildcards 0.06
Regexp::Wildcards is a Perl module that converts wildcard expressions to Perl regular expressions. more>>
Regexp::Wildcards is a Perl module that converts wildcard expressions to Perl regular expressions.
SYNOPSIS
use Regexp::Wildcards qw/wc2re/;
my $re;
$re = wc2re a{b?,c}* => unix; # Do it Unix style.
$re = wc2re a?,b* => win32; # Do it Windows style.
$re = wc2re *{x,y}? => jokers; # Process the jokers & escape the rest.
$re = wc2re %a_c% => sql; # Turn SQL wildcards into regexps.
In many situations, users may want to specify patterns to match but dont need the full power of regexps. Wildcards make one of those sets of simplified rules. This module converts wildcard expressions to Perl regular expressions, so that you can use them for matching. It handles the * and ? shell jokers, as well as Unix bracketed alternatives {,}, but also % and _ SQL wildcards. Backspace () is used as an escape character. Wrappers are provided to mimic the behaviour of Windows and Unix shells.
VARIABLES
These variables control if the wildcards jokers and brackets must capture their match. They can be globally set by writing in your program
$Regexp::Wildcards::CaptureSingle = 1;
# From then, "exactly one" wildcards are capturing
or can be locally specified via local
{
local $Regexp::Wildcards::CaptureSingle = 1;
# In this block, "exactly one" wildcards are capturing.
...
}
# Back to the situation from before the block
This section describes also how those elements are translated by the functions.
$CaptureSingle
When this variable is true, each occurence of unescaped "exactly one" wildcards (i.e. ? jokers or _ for SQL wildcards) are made capturing in the resulting regexp (they are be replaced by (.)). Otherwise, they are just replaced by .. Default is the latter.
For jokers :
a???b?? is translated to a(.)(.)(.)b?(.) if $CaptureSingle is true
a...b?. otherwise (default)
For SQL wildcards :
a___b__ is translated to a(.)(.)(.)b_(.) if $CaptureSingle is true
a...b_. otherwise (default)
$CaptureAny
By default this variable is false, and successions of unescaped "any" wildcards (i.e. * jokers or % for SQL wildcards) are replaced by one single .*. When it evalutes to true, those sequences of "any" wildcards are made into one capture, which is greedy ((.*)) for $CaptureAny > 0 and otherwise non-greedy ((.*?)).
For jokers :
a***b** is translated to a.*b*.* if $CaptureAny is false (default)
a(.*)b*(.*) if $CaptureAny > 0
a(.*?)b*(.*?) otherwise
For SQL wildcards :
a%%%b%% is translated to a.*b%.* if $CaptureAny is false (default)
a(.*)b%(.*) if $CaptureAny > 0
a(.*?)b%(.*?) otherwise
$CaptureBrackets
If this variable is set to true, valid brackets constructs are made into ( | ) captures, and otherwise they are replaced by non-capturing alternations ((?: | )), which is the default.
a{b},{c} is translated to a(b}|{c) if $CaptureBrackets is true
a(?:b}|{c) otherwise (default)
<<lessSYNOPSIS
use Regexp::Wildcards qw/wc2re/;
my $re;
$re = wc2re a{b?,c}* => unix; # Do it Unix style.
$re = wc2re a?,b* => win32; # Do it Windows style.
$re = wc2re *{x,y}? => jokers; # Process the jokers & escape the rest.
$re = wc2re %a_c% => sql; # Turn SQL wildcards into regexps.
In many situations, users may want to specify patterns to match but dont need the full power of regexps. Wildcards make one of those sets of simplified rules. This module converts wildcard expressions to Perl regular expressions, so that you can use them for matching. It handles the * and ? shell jokers, as well as Unix bracketed alternatives {,}, but also % and _ SQL wildcards. Backspace () is used as an escape character. Wrappers are provided to mimic the behaviour of Windows and Unix shells.
VARIABLES
These variables control if the wildcards jokers and brackets must capture their match. They can be globally set by writing in your program
$Regexp::Wildcards::CaptureSingle = 1;
# From then, "exactly one" wildcards are capturing
or can be locally specified via local
{
local $Regexp::Wildcards::CaptureSingle = 1;
# In this block, "exactly one" wildcards are capturing.
...
}
# Back to the situation from before the block
This section describes also how those elements are translated by the functions.
$CaptureSingle
When this variable is true, each occurence of unescaped "exactly one" wildcards (i.e. ? jokers or _ for SQL wildcards) are made capturing in the resulting regexp (they are be replaced by (.)). Otherwise, they are just replaced by .. Default is the latter.
For jokers :
a???b?? is translated to a(.)(.)(.)b?(.) if $CaptureSingle is true
a...b?. otherwise (default)
For SQL wildcards :
a___b__ is translated to a(.)(.)(.)b_(.) if $CaptureSingle is true
a...b_. otherwise (default)
$CaptureAny
By default this variable is false, and successions of unescaped "any" wildcards (i.e. * jokers or % for SQL wildcards) are replaced by one single .*. When it evalutes to true, those sequences of "any" wildcards are made into one capture, which is greedy ((.*)) for $CaptureAny > 0 and otherwise non-greedy ((.*?)).
For jokers :
a***b** is translated to a.*b*.* if $CaptureAny is false (default)
a(.*)b*(.*) if $CaptureAny > 0
a(.*?)b*(.*?) otherwise
For SQL wildcards :
a%%%b%% is translated to a.*b%.* if $CaptureAny is false (default)
a(.*)b%(.*) if $CaptureAny > 0
a(.*?)b%(.*?) otherwise
$CaptureBrackets
If this variable is set to true, valid brackets constructs are made into ( | ) captures, and otherwise they are replaced by non-capturing alternations ((?: | )), which is the default.
a{b},{c} is translated to a(b}|{c) if $CaptureBrackets is true
a(?:b}|{c) otherwise (default)
Download (0.009MB)
Added: 2007-06-29 License: Perl Artistic License Price:
849 downloads
NewsGrab 0.5.0 Pre4
NewsGrab provides a tool to retrieve binary files from an NNTP server. more>>
NewsGrab provides a tool to retrieve binary files from an NNTP server.
NewsGrab is a small tool that uses regular expressions to download and uudecode/ydecode binary files from USENET.
Enhancements:
- Bumped version to 0.5.0pre4
- Another directory permission changed, thanks to Niels Heinen.
<<lessNewsGrab is a small tool that uses regular expressions to download and uudecode/ydecode binary files from USENET.
Enhancements:
- Bumped version to 0.5.0pre4
- Another directory permission changed, thanks to Niels Heinen.
Download (0.021MB)
Added: 2007-02-21 License: GPL (GNU General Public License) Price:
976 downloads
GNUMail.app 1.2.0pre3
GNUMail.app is the complete and fast mail application for GNUstep. more>>
GNUMail.app is a fully featured mail application running on Linux (or FreeBSD, OpenBSD, etc) and Apple Mac OS X.
GNUMail.app uses the GNUstep development framework or Apple Cocoa, which is based on the OpenStep specification provided by NeXT, Inc.. GNUMail.app is licensed under the GPL, and the full sources of the application are available.
GNUMail.app was written from scratch. It uses Pantomime as its mail handling framework.
Main features:
- Multiple POP3 (with APOP support) accounts with local cache support (for leaving messages on server);
- Multiple delivery agents (SMTP or local mailer);
- Mail spool file support for receiving;
- Good IMAP support with local caching;
- Full RFC822 and RFC2822 support;
- Read, compose, bounce, reply and forward mails;
- Mailbox management (create, delete, locking and transfer messages) using the Berkeley mbox format;
- Personal preferences management;
- MIME support (decode and encode);
- A full MIME types manager;
- Quoted Printable and BASE64 support;
- Address Book with groups support;
- Find Panel with regular expressions support;
- Automatic or manual fetching of your mails (users choice);
- Powerful filters that supports regular expressions;
- GPG (PGP) support through a bundle;
- Messages threading;
- And more...
<<lessGNUMail.app uses the GNUstep development framework or Apple Cocoa, which is based on the OpenStep specification provided by NeXT, Inc.. GNUMail.app is licensed under the GPL, and the full sources of the application are available.
GNUMail.app was written from scratch. It uses Pantomime as its mail handling framework.
Main features:
- Multiple POP3 (with APOP support) accounts with local cache support (for leaving messages on server);
- Multiple delivery agents (SMTP or local mailer);
- Mail spool file support for receiving;
- Good IMAP support with local caching;
- Full RFC822 and RFC2822 support;
- Read, compose, bounce, reply and forward mails;
- Mailbox management (create, delete, locking and transfer messages) using the Berkeley mbox format;
- Personal preferences management;
- MIME support (decode and encode);
- A full MIME types manager;
- Quoted Printable and BASE64 support;
- Address Book with groups support;
- Find Panel with regular expressions support;
- Automatic or manual fetching of your mails (users choice);
- Powerful filters that supports regular expressions;
- GPG (PGP) support through a bundle;
- Messages threading;
- And more...
Download (1.1MB)
Added: 2007-02-06 License: GPL (GNU General Public License) Price:
991 downloads
Regexx 0.98.1
Regexx is a complete regular expressions C++ solution. more>>
Regexx is a complete regular expressions C++ solution.
Regexx implements easy expression execution, global searching, replace with atom substitution, customized replaces, easy match/atom string retrieving, and splitting strings with strings or regular expressions.
<<lessRegexx implements easy expression execution, global searching, replace with atom substitution, customized replaces, easy match/atom string retrieving, and splitting strings with strings or regular expressions.
Download (0.41MB)
Added: 2006-08-23 License: LGPL (GNU Lesser General Public License) Price:
1157 downloads
glark 1.8.0
glark offers grep-like searching of text files. more>>
glark offers grep-like searching of text files, with very powerful, complex regular expressions (e.g., "/foow+/ and /bar[^d]*baz$/ within 4 lines of each other").
glark offers: Perl compatible regular expressions, highlighting of matches, context around matches, complex expressions (``and and ``or), and automatic exclusion of non-text files.
<<lessglark offers: Perl compatible regular expressions, highlighting of matches, context around matches, complex expressions (``and and ``or), and automatic exclusion of non-text files.
Download (0.034MB)
Added: 2007-02-11 License: LGPL (GNU Lesser General Public License) Price:
985 downloads
Search::Tools::RegExp::Keywords 0.06
Search::Tools::RegExp::Keywords is a Perl module to access regular expressions for keywords. more>>
Search::Tools::RegExp::Keywords is a Perl module to access regular expressions for keywords.
SYNOPSIS
my $regexp = Search::Tools::RegExp->new();
my $kw = $regexp->build(the quick brown fox);
for my $w ($kw->keywords)
{
my $r = $kw->re( $w );
}
Search::Tools::RegExp::Keywords provides access to the regular expressions for a query keyword.
A Search::Tools::RegExp::Keywords object is returned by the Search::Tools::RegExp build() method. This class is typically not used in isolation.
<<lessSYNOPSIS
my $regexp = Search::Tools::RegExp->new();
my $kw = $regexp->build(the quick brown fox);
for my $w ($kw->keywords)
{
my $r = $kw->re( $w );
}
Search::Tools::RegExp::Keywords provides access to the regular expressions for a query keyword.
A Search::Tools::RegExp::Keywords object is returned by the Search::Tools::RegExp build() method. This class is typically not used in isolation.
Download (0.048MB)
Added: 2006-10-18 License: Perl Artistic License Price:
1101 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above regular expressions search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed