🚀 go-pugleaf

David Cok writes:
>>>>>> Compiling takes too long. I want runtime syntax checking! <<<<<

I know I'm going to hate myself for this in the morning, but ...

Check out J, it's got that.

CAUTION: the current implementation of J uses an incredibly
self-referential implementation, and ranges from 1-6 orders of
magnitude slower than it should (and I'm being optimistic about that
1).  Also, the language definition is not very stable, and commands
get moved around (renamed), and the parser changes, and so on between
versions.  Further, the on-line docs ought to make any algol docs look
verbose and repetitive.

That said, you could get a copy from watserv1.waterloo.edu
(129.97.129.140) in languages/apl/j/ (subdirectory by architecture).  

And, I hasten to add, J NEEDS runtime syntax checking.  Example:

   x =: 1
   1 + x
2
   x =: +
   1 + x
syntax error

   (Yes, folks, you can cream yourself in J in ways that nobody ever
thought of...  On the other hand, the underlying design is more than a
little elegant.  I've just got to try making a toy compiler for the
language...)

Raul Rockwell