Messages - dme [ switch to compact view ]

Pages: [1] 2 3next
1
I recommend spamihilator. Although I don't use Outlook I know that it works with it. See:

http://wiki.spamihilator.com/doku.php?id=en:configclient

Spamihilator is tested for years and is developed further permanently. In addition, there is a support which is competent and reacting fast:

http://www.spamihilator.com/forum/viewforum.php?f=22

The program can be trained easily and the recognition rate will reach a level of about 95% soon. This rate can be improved by many good filter plugins further. I am dependent on a good spam filter, because I get approximately 150 spam mails daily. I use the spamihilator for several years now and am very satisfied with it.

2
Borland C++ Builder Contest / Re: Minimal Website
« on: May 23, 2008, 04:07 AM »
There is used a commercial editor component and a commercial grid component in Minimal Website. Also the supporting code for the parsers generated with the TextTransformer program is commercial. However, just at the end of the week new free TextTransformer components will be released, by which these parser could be substituted.
I like to give you - or anybody else - all parts of the code, which are not bounded to commercial licenses. Please contact me at dme(at)texttransformer.com and I will send it to you per e-mail.

Detlef

3
I now have a contribution to the NANY 2008 programming challenge. I'm sorry, it's a program of less general interest than the program, which I have announced three weeks ago. I couldn't complete that program in time. I have wrapped an existing TextTransformer project into a very simple graphical user interface instead.

"c_pp" is a program for applying, testing or learning C preprocessor directives. C/C++ code can be remodeled into the preprocessed form with c_pp: preprocessor directives are removed, definitions are replaced, not defined areas are removed and macros are expanded.

c_pp can be downloaded from

http://www.texttransformer.org/c_pp_en.html

There are some additional explanations too.

The TextTransformer project, on which the c_pp is based, will also be available, as soon as TextTransformer 1.4.1. is published. You then can adapt this project to your personal needs and use it for example in combination with the TextTransformer components. The TextTransformer components, which were presented here for the BCB contest last year, also will be updated and extended very soon.


4
N.A.N.Y. 2008 / Re: The N.A.N.Y. Programming Challenge for 2008
« on: December 14, 2007, 04:27 PM »
I just have a new programming project in my pipe line: system wide assignment of hot keys to different small text converters. I hope, that I can finish a first version this year and participate at the N.A.N.Y. Programming Challenge.

Detlef

5

You are right: as far as I know, there is no other tool, which can produce regular expressions for different languages. (Until now I thought such a feature would be useless.)

Especially for Perl-compatible expressions there is a great tool at:

http://weitz.de/regex-coach

The Regex Coach is a graphical application for Windows which can be used to experiment with (Perl-compatible) regular expressions interactively. It has the following features:
It shows whether a regular expression matches a particular target string.
It can also show which parts of the target string correspond to captured register groups or to arbitrary parts of the regular expression.
It can "walk" through the target string one match at a time.
It can simulate Perl's split and s/// (substitution) operators.
It tries to describe the regular expression in plain English.
It can show a graphical representation of the regular expression's parse tree.
It can single-step through the matching process as performed by the regex engine.
Everything happens in "real time", i.e. as soon as you make a change somewhere in the application all other parts are instantly updated.

You also may have a look at my TextTransformer at:

http://www.texttransformer.com

There is a free regex test dialog for POSIX regular expressions integrated, which shows all sub-expressions and what was matched by them. In contrast to a Perl regex a POSIX regex always matches the longest possible string. Using this criterion, TextTransformer produces complete parsers and translators. E.g. you could make a parser for regular expressions of one language and translate it into expressions of another language.
If you or anybody else would make such a thing, and let me publish it on

http://www.texttransformer.org

I would spend him a free standard version of TextTransformer. But caution: this is not so easy.

Regards

Detlef

Pages: [1] 2 3next
Go to full version