ANN: Free-form-operators patch

T

ts

N> Have you _actually_ done any _real_ programming in APL,

Yes, I've even written APL with an ASCII character set (r for rho, i for
iota, etc)


Guy Decoux
 
C

Charles Hixson

Markus said:
That should be a trivial patch to the patch, if that seems to
increase the net happiness of the world. If others speak in favor of
the idea I'll work it up (*smile* or you are of course free to try your
hand at it if you prefer).

-- Markus

P.S. I am taking the "." in your regexp to mean "any operator character"
and not "any character" as the later would lead to untold complications.
That's the way I was thinking of it. It I meant something closer to
"anything", I'd need to have specified an explicit leading and trailing
space as a (shareable) part of the operator. Which would have meant
puntuation around parenthetical expressions would be QUITE unexpected.

OTOH, it would, occasionally, be nice to have a |CrossProduct| operator :).

More seriously, so many people object to operators being ambiguous, or
not self-identifying, that I can see a good argument for allowing such,
provided it was clearly demarkated. But that also strikes me as a bit
too far from the normal way that Ruby does things, so I'm sure not going
to push for it.

OTOH, were I designing a language from scratch, I would make spaces much
more syntactically necessary than Ruby does. Ruby, in fact, prohibits
spaces in many places where I find them esthetically desireable (say in
function expressions, after the function name and before the opening
parenthesis of the argument). And I would allow operators to be
syntactially marked variable names. In fact, for procedures with
arguments of the form (in, in, out) or (in, out) in any permutation, I
would allow the procedure name to be automatically converted into an
operator (possibly by enclosing it in vertical bars. But that's just my
esthetic, which I know to be quite different from those of many another.

For that matter, I'd go out of my way to make the language easily
parseable, and also to have a large subset that was readily compileable
(with easy linkage between the full language that required an
interpreter and the subset that was compileable.)

OTOH...I haven't built a language since college, and don't seem to have
any strong inclinations in that direction, so my choices aren't that
significant.
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

Forum statistics

Threads
474,159
Messages
2,570,881
Members
47,418
Latest member
NoellaXku

Latest Threads

Top