Related articles |
---|
Re: Q: Definition of a scripting lang. lwall@netlabs.com (1995-03-27) |
Editing/storing syntax trees preston@tera.com (1995-05-28) |
Re: Editing/storing syntax trees stefan.monnier@epfl.ch (Stefan Monnier) (1995-06-05) |
Re: Editing/storing syntax trees hbaker@netcom.com (1995-06-23) |
Re: Editing/storing syntax trees daniels@cse.ogi.edu (1995-06-23) |
Re: Editing/storing syntax trees bevan@cs.man.ac.uk (1995-06-23) |
Re: Editing/storing syntax trees frode@news2.deltanet.com (Frode Odegard) (1995-06-24) |
Re: Editing/storing syntax trees hagerman@ece.cmu.edu (1995-06-24) |
Re: Editing/storing syntax trees preston@tera.com (1995-06-24) |
Re: Editing/storing syntax trees jhallen@world.std.com (1995-06-27) |
[3 later articles] |
Newsgroups: | comp.compilers |
From: | hbaker@netcom.com (Henry Baker) |
Keywords: | syntax, design |
Organization: | nil |
References: | 95-04-013 95-05-131 |
Date: | Fri, 23 Jun 1995 03:42:18 GMT |
Status: | RO |
preston@tera.com (Preston Briggs) wrote:
> > ... Wouldn't it be so much easier to store your source as a syntax-tree ?
> >
> >In theory I agree, ...
>
> I disagree. ASCII source is actually a fine representation, small and
> convenient. Syntax trees, on disk, are bulky and inconvenient.
ASCII is a terrible representation, because it has to be reparsed on
every reading.
The 'bulk' problem has now been solved with new compress/decompress-on-the-fly
disk drivers, which are highly optimized for compression, and the newer
HW will have specialized high performance chips for doing this that
I expect will significantly outperform any parsing routines.
> If you want general access to a syntax tree, say for use by several
> different tools, write a single scanner-parser combination that builds
> a tree form from the source form; but please don't multiply your editors.
Yes, this is usually called 'Lisp'. :-)
--
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.