Re: parse tree --> running program/script...

Tom Fjellstrom <tomcf@connect.ab.ca>
26 Apr 2000 02:42:23 -0400

          From comp.compilers

Related articles
parse tree --> running program/script... tomcf@connect.ab.ca (Tom Fjellstrom) (2000-04-20)
Re: parse tree --> running program/script... Herwig.Huener@pgtm0035.mch.sni.de (Herwig Huener) (2000-04-21)
Re: parse tree --> running program/script... tomcf@connect.ab.ca (Tom Fjellstrom) (2000-04-26)
Re: parse tree --> running program/script... tomcf@connect.ab.ca (Tom Fjellstrom) (2000-04-26)
| List of all articles for this month |

From: Tom Fjellstrom <tomcf@connect.ab.ca>
Newsgroups: comp.compilers
Date: 26 Apr 2000 02:42:23 -0400
Organization: Compilers Central
References: 00-04-142 00-04-153
Keywords: parse, interpreter

Herwig Huener wrote:
> In your case, I would do both, 1 first. You will have a kind
> of a tree anyway if you generate code for a virtual
> machine, an then, having both implementations, you can
> check them against each other when doing some error
> diagnosis.
>
> The kind of virtual machine and it's design depends on
> what your language is best suited to, I guess.


I've been thinking about this... The things that this language will do
will not make it easy to write any kind of (not too slow) machine
code.


ie: dynamic arrays, 'eval's, dynamic variables (the second one is seen
it is valid)


hopefully i can come up with something. :)


thanks,
Tom Fjellstrom


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.