Re: Easiest way to use redular expressions?

[Emmanuel Briot <briot.emmanuel@gmail.com>]

On Sunday, December 27, 2020 at 9:36:51 AM UTC+1, J-P. Rosen wrote:
> AdaControl uses Gnat.Regpat, and is quite happy with it... 

GNAT.Regpat is a package I wrote 18 years ago or so (time flies..), basically manually translating C code from the Perl implementation of regular expressions.
Nowadays, I think it would be better to write a small binding to the pcre library (which has quite a simple API, so the binding should not be too hard). This will
provide much better performance, support for unicode, and a host of regexp features that are not supported by GNAT.Regpat.

Never did that while I was working for AdaCore because we would have ended up with too many regexp packages (there is also GNAT.Regexp, which is very
efficient but limited in features because it is based on a definite state machine).

I think libpcre might even be distributed with gcc nowadays, although I did not double-check so might be wrong.

This binding would be a nice small project for someone who wants to get started with writing Ada bindings

Emmanuel