Scripsit ille ichael Campbell„© <michael_s_campbell / yahoo.com>:
> --- "Hal E. Fulton" <hal9000 / hypermetrics.com> wrote:
> > > > e6 = (1
> > > > + 2);

Let me guess...

it's parsed as:

  e6 =
  (
    1;
    + 2;
  );

which evaluates 1, then + 2 and returns the last value - +2.

Hey... that is, structure blocks (not meaning anything more) can be done
like this:

(
  something
  something else
)

or if one really wants code to look like Perl:

/some_regex/ and ((
  # ...
)) or
/some_regex/ and ((
  # ...
)) or
((
  # ...
))

(the ((parens)) are doubled to inhibit the "assignment in conditional"
 warning which is useless if you use ((...)) as replacement for Perl's
 do { ... } construct)

And no, I don't think that construct is really useful. But it allows
some sort of fall-through by letting the block return false or nil.

It looks like the rule is: if there may be a semicolon at the end of
the line, it is parsed as if there was one.

Am I right?

> > > I don't know why this is 2.
> > 
> > I agree, this is very odd.
> > 
> > What's going on?
> 
> 
> Since when is 2 odd?  Prime, yes, but odd?

| 2:  The Odd Prime --
|         It's the only even prime, therefore is odd.  QED.

but of that fortune cookie, I like best:

| 31: The Arbitrary Prime --
|         Determined by unanimous unvote.  We needed an arbitrary prime in
|         case the prof asked for one, and so had an election.  91 received
|         the most votes (well, it *looks* prime) and 3+4i the next most.
|         However, 31 was the only candidate to receive none at all.

Try to find all mistakes. I see two nonobvious mistakes in there...

BTW: 91 is the second composite number which looks prime. 1 is the first
one, of course.


-- 
What isn't remembered, never happened.
Memory is merely a record.
You just need to rewrite that record.