Two pass compiler for a language similar to Java

=?ISO-8859-1?Q?Joan_Jes=FAs_Pujol_Espinar?= <joanpujol@gmail.com>
3 Sep 2004 12:41:38 -0400

          From comp.compilers
Related articles
Two pass compiler for a language similar to Java joanpujol@gmail.com (=?ISO-8859-1?Q?Joan_Jes=FAs_Pujol_Espinar?=) (2004-09-03)
Re: Two pass compiler for a language similar to Java kamalp@acm.org (2004-09-07)
Re: Two pass compiler for a language similar to Java jjan@cs.rug.nl (J.H.Jongejan) (2004-09-08)
Re: Two pass compiler for a language similar to Java lhp+news@toft-hp.dk (Lasse =?ISO-8859-1?Q?Hiller=F8e?= Petersen) (2004-09-13)
Re: Two pass compiler for a language similar to Java vidar@hokstad.name (2004-09-13)
Re: Two pass compiler for a language similar to Java joanpujol@gmail.com (Joan Pujol) (2004-09-13)
Re: Two pass compiler for a language similar to Java tzvetanmi@yahoo.com (2004-09-13)
[2 later articles]
| List of all articles for this month |
From: =?ISO-8859-1?Q?Joan_Jes=FAs_Pujol_Espinar?= <joanpujol@gmail.com>
Newsgroups: comp.compilers
Date: 3 Sep 2004 12:41:38 -0400
Organization: CESCA - Servidor de news de l'Anella Cientifica
Keywords: analysis, question
Posted-Date: 03 Sep 2004 12:41:38 EDT

Hi,


I'm doing a pseudocode language similar to Java (it is posible to use
things before are defined).
I know (or I think ;) ) that the best way to manage this is with two
pass using ASTs. And is the strategy that I'm using.


But only for curiosity, it's possible to do the semantic analysis of my
language in a syntatic directed compiler with only one pass. The
strategy will be to put in the symbol table what you are waiting to get
and when you find the definition compare if what are you waiting is what
is defined... It's a lot more dificult, but it's posible, or there are
problems that I can't see?


A lot of thanks in advance and excuseme for my little english.


---
Joan Jesús Pujol Espinar


Post a followup to this message

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