Date: 29 Mar 2002 22:26:35 -0800 From: swear@blarg.net (Gary W. Swearingen) To: Terry Lambert <tlambert2@mindspring.com> Cc: "Gary W. Swearingen" <swear@blarg.net>, Ilia Chipitsine <ilia@cgu.chel.su>, questions@FreeBSD.ORG, hackers@FreeBSD.ORG Subject: Re: perfomance and regular expressions Message-ID: <bevgbebmg4.gbe@localhost.localdomain> In-Reply-To: <3CA53A21.F041E72C@mindspring.com> References: <Pine.BSF.4.10.10203292117510.1096-100000@jane.poka.net> <3CA4FC84.BAB5B698@mindspring.com> <iy4riydamz.riy@localhost.localdomain> <3CA53A21.F041E72C@mindspring.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Terry Lambert <tlambert2@mindspring.com> 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.) > > LISP. Forth. Smalltalk. Prolog. BASIC. Oh yeah... Java. Can any of those execute or interpret some code and then compile the results of that into a non-interpreted executable? That's what I had desired, if it wasn't clear before. Otherwise, you're still doing the special computations at run time, only slower. Maybe I HAVE heard of some interpreters (Python?) saving an excecutable image of themselves after running a while. Is that what you're thinking of? Will all of those language systems above do that? It's not quite what I was thinking of, but I guess it meets my (poor) specifications. 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?bevgbebmg4.gbe>