Distribute Parse Trees, Not Bytecode

[mzukowski@bco.com]

-----Original Message-----
From: Bill Frantz
To: mzukowski@bco.com; e-lang@eros.cis.upenn.edu
Sent: 6/23/99 10:51 AM
Subject: RE: Distribute Parse Trees, Not Bytecode

At 10:18 AM 6/23/99 -0700, mzukowski@bco.com wrote:
>In my
>mind you want the first basic passes done like parsing, getting symbols
into
>the table, but don't go as far as removing information needed to
reconstruct
>the source.  

>[#] If you separate the data needed to reconstruct the source from that
>needed to run the program, then you can compress the download by only
>sending the "run" data.

[#]  Of course then you can't reconstruct the source, like Ka-Ping wants to
for a human to analyze.  But then again, how many people are going to really
want to look at the source?  Hmmm, two files instead of one?  But with that
approach then just make the second file the ascii source, signed so you know
they go together.  Just distributing the AST would give all you need to do
the source analysis, unless you end up with things in comments like
preconditions or other machine readable information which some people are
putting into javadoc comments nowadays.

Monty