[DotGNU]Library suggestion: incremental regular expression engine

[Thomas Aigner]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hi all,
I have the idear of an regular expression engine that can work for incomplete 
matches additional to the normal mode.
The background is input validation on keystrokes which could be quite 
powerful with such a beast, e.g. every feasible partial match is accepted. At 
end of input there can be an additional complete match.

My target would be the pnet-library => C# implementation at first.
Also my time is rather limited it can take longer until the first 
implementation could arrive.

Any comments to this idea are welcome.
- -- 

        Thomas Aigner
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.5 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE7eXlz6ioTx5FjkBQRAhZAAJ4v3WpSLrkiX7ip7q1F3NtLcJvoQgCg1qvx
NlmUuguHVgAPGv7kuSwKwn8=
=Yc3M
-----END PGP SIGNATURE-----