On Fri, Mar 29, 2002 at 09:21:03PM +0500, Ilia Chipitsine wrote:
Dear Sirs,
I'm currently implementing a program which will run thousands and
thousands times. It uses regular expressions.
hi
Port: re2c-0.9.1
Path: /usr/ports/devel/re2c
Info: Compile regular expression to C (much
Gary W. Swearingen wrote:
Terry Lambert [EMAIL PROTECTED] writes:
Gary W. Swearingen wrote:
Anybody know any languages that allow compile-time (and/or link-time)
computations using (most of?) the same language? I've often desired the
feature. (I suppose some preprocessor like m4
On Sat, Mar 30, 2002 at 01:39:14AM -0800, Terry Lambert wrote:
Gary W. Swearingen wrote:
Terry Lambert [EMAIL PROTECTED] writes:
Gary W. Swearingen wrote:
Anybody know any languages that allow compile-time (and/or link-time)
computations using (most of?) the same language? I've
Terry Lambert [EMAIL PROTECTED] writes:
Don't they teach History of Computing to people any more?!?
They didn't offer it to me when I was studing for my BSEE in the 70s.
(And I haven't been paying nearly as much attention as you have.)
I hate to think what my alma mata is teaching for HoC
On Sat, Mar 30, 2002 at 10:22:37AM -0800, Gary W. Swearingen wrote:
Terry Lambert [EMAIL PROTECTED] writes:
Don't they teach History of Computing to people any more?!?
They didn't offer it to me when I was studing for my BSEE in the 70s.
(And I haven't been paying nearly as much
Gary W. Swearingen wrote:
Terry Lambert [EMAIL PROTECTED] writes:
Don't they teach History of Computing to people any more?!?
They didn't offer it to me when I was studing for my BSEE in the 70s.
(And I haven't been paying nearly as much attention as you have.)
I hate to think what my
Dear Sirs,
I'm currently implementing a program which will run thousands and
thousands times. It uses regular expressions.
something really simple, like
regex_t re;
regcomp(re,^[0123456789abcdefghijklmnopqrstuvwxyz]{1,8}$,
REG_EXTENDED+REG_ICASE);
Ilia Chipitsine wrote:
I'm currently implementing a program which will run thousands and
thousands times. It uses regular expressions.
something really simple, like
regex_t re;
regcomp(re,^[0123456789abcdefghijklmnopqrstuvwxyz]{1,8}$,
Ilia Chipitsine wrote:
I'm currently implementing a program which will run thousands and
thousands times. It uses regular expressions.
something really simple, like
regex_t re;
regcomp(re,^[0123456789abcdefghijklmnopqrstuvwxyz]{1,8}$,
Terry Lambert [EMAIL PROTECTED] writes:
That said, if you feel a moral imperative to save and load
precompiled regular expressions. you can do it by serializing
the structure contents to disk, and then reading them back in.
It'd be best to use Terry's single process idea, but if I was going
Gary W. Swearingen wrote:
Anybody know any languages that allow compile-time (and/or link-time)
computations using (most of?) the same language? I've often desired the
feature. (I suppose some preprocessor like m4 could handle some of it.)
LISP. Forth. Smalltalk. Prolog. BASIC. Oh
Terry Lambert [EMAIL PROTECTED] writes:
Gary W. Swearingen wrote:
Anybody know any languages that allow compile-time (and/or link-time)
computations using (most of?) the same language? I've often desired the
feature. (I suppose some preprocessor like m4 could handle some of it.)
12 matches
Mail list logo
