JS> I'm coming to the realization that I have to build sophisticated
 JS> parse trees and although I still can make it single pass, it will
 FAG> What is a "parse tree"?
 
It's a n-node tree containing the structure (including functions, 
procedures, expressions, loops, jumps, blocks of statements, etc) 
of the high-level code. From the parse tree, the object code is
generated.
You can actually make a tree-like graphic representation of any program.
That's what a parse tree would look like, if drawn. It's very helpful in 
knowing the order of executing the program. In a low-level language
compiler (ie assembler) it would be useless.
 
 FAG> Well, there's an article called "Let's make a compiler" in the
 FAG> comp.compilers web page... if my memory doesn't fail, it's URL is
 FAG> www.iecc.com .... There's the link to the tutorial.... You can browse
 FAG> it online, or download the full tutorial compressed file...
Thanks, this will hopefully be very helpful. (assuming it deals with
high-level languages, ie C or Pascal)
                                       - DarkFire 
[John Stephenson (an INTP), Fingerprint: 66BE3A3B6EEE9A5B-48001A32901ECA21]
[Composed at 7:51:00a on 1998-04-10 (UTC) using PGPWave v1.24a Beta]
--- Maximus 2.01wb
---------------