Free regular hotmail software for linux

Gotmail is a utility to non-interactively download email from a Hotmail account. Gotmail project can download messages from all folders, messages from certain folders, or new messages only.
There are options to delete downloaded messages or mark them as read.
Gotmail can forward messages to other email addresses or save them as local mbox-style mailboxes.
Enhancements:
- Changelog AUTHORS gotmail.man Makefile.dist Makefile
- Makefile.dist NEWS PRESSRELEASE gotmail.spec
- Combined AUTHORS file and man page and removed AUTHORS file
- from package
- Updated Makefile and Makefile.dist to remove man page and
- AUTHORS file construction
- Removed PRESSRELEASE and NEWS code and files from the package
- Removed unused gotmail.spec.in file
- Fixed timestamp preservation issues in Makefiles using touch -r

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

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.

Grepmail searches for emails in a normal or compressed mailbox using a regular expression or date constraint.
To install this package, change to the directory where you unarchived this distribution and do the following steps:
perl Makefile.PL
make
make test
make install
Main features:
- Gzip, bzip2, tzip support
- Piped input supported (compressed or not)
- Supports complex dates like "between Jan 15, 1999 and 5 weeks ago"
- Can ignore non-text MIME attachments
- Can search only the header or only the body of an email
- Can recurse subdirectories
- Automatically optimizes for speed vs. flexibility when searching based on date constraints.

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.

WebMail is a www-frontend to IMAP/POP3 mailboxes. You can compare it to the systems Hotmail, YahooMail etc use.
Main features:
- gives a user complete access to his POP3 or IMAP mailboxes via an easy-to-use web interface
- neither Java nor Javascript on the Clientside
- runs as Java Servlet (and Servlet 2.2 WebApp)
- pluggable services (IMAP, POP3, ...) through the Java Mail API
- configurable looknfeel through templates
- user configurable mailboxes: each folder may be on a different IMAP host
- sophisticated folder support
- support for multiple languages
- MIME support: images, html- and textfiles are shown via the webbrowser (configurable), all other files may be downloaded with a click
- fancy mail formatting: link highlighting, umlaut conversion, "smiley-substitution"
- Very fast compared to CGI scripts
- Modular concept with plugin support
- Easy administration (webinterface) and installation

Ragel State Machine Compiler compiles finite state machines from regular languages into executable C/C++/Objective-C code. Ragel state machines can not only recognize byte sequences as regular expression machines do, but can also execute code at arbitrary points in the recognition of a regular language.
Ragel can also be thought of as a finite state transducer compiler where output symbols represent blocks of code that get executed instead of written to the output stream.
When you wish to write down a regular language you start with some simple regular language and build a bigger one using the regular language operators union, concatenation, kleene star, intersection and subtraction.
This is precisely the way you describe to Ragel how to compile your finite state machines. Ragel also understands operators that embed actions into machines and operators that control any non-determinism in machines.
Ragel FSMs are closed under all of Ragels regular language, action specification and priority assignment operators. This property allows arbitrary regular languages to be described. Complexity is limited only by available processing resources.
For example, you can make one machine that picks out specially formatted comments in C code, another machine that builds a list all function declarations and a third that identifies string constants then "or" them all together to make a single machine that performs all of these tasks concurrently and independently on one pass of the input.
Main features:
- Describe arbitrary state machines using regular language operators and/or state tables.
- NFA to DFA conversion.
- Hopcrofts state minimization.
- Embed any number of actions into machines at arbitrary places.
- Control non-determinism using priorities on transitions.
- Visualize output with Graphviz.
- Use byte, double byte or word sized alphabets.
- Generate C/C++/Objective-C code with no dependencies.
- Choose from table or control flow driven output.
Enhancements:
- The documentation and the Ruby code generator were improved.