Skip site navigation (1)Skip section navigation (2)
Date:      Fri, 29 Mar 2002 20:08:01 -0800
From:      Terry Lambert <tlambert2@mindspring.com>
To:        "Gary W. Swearingen" <swear@blarg.net>
Cc:        Ilia Chipitsine <ilia@cgu.chel.su>, questions@FreeBSD.ORG, hackers@FreeBSD.ORG
Subject:   Re: perfomance and regular expressions
Message-ID:  <3CA53A21.F041E72C@mindspring.com>
References:  <Pine.BSF.4.10.10203292117510.1096-100000@jane.poka.net> <3CA4FC84.BAB5B698@mindspring.com> <iy4riydamz.riy@localhost.localdomain>

next in thread | previous in thread | raw e-mail | index | archive | help
"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 yeah... Java.

	"And everything old is new again"
				-- The Bard

-- Terry

To Unsubscribe: send mail to majordomo@FreeBSD.org
with "unsubscribe freebsd-questions" in the body of the message




Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?3CA53A21.F041E72C>