Re: Jack W. Crenshaw - Any clues how to optimize ?

XlatB <prinz@c2i.net> writes:
> I am working on simple compiler (currently only a "basic" to x86 asm
> converter). It is based on the model by Jack W. Crenshaw. (Author of
> "Let's build a compiler" or something very similar). I am having
> problems to accept the inefficiency on the expression calculations.
> ...


I too have read the Crenshaw series on building a compiler. I am
attempting to create an interpreter based on those articles. Yes,
even though there are already a plethora of interpreters, I am trying
my hand at it mostly as a learning experience. I know very little
about the structure of compilers and interpreters, and my question is
this: I have a look-ahead recursive descent parser for the interpreter
(based on the Crenshaw compiler) working, but it is becoming
increasingly difficult to implement the features I want with this
parser. Is this method a good one, and should I keep hacking away on
it, or is another method more suitable, such as parsing an entire line
(or file) into tokens, and then decoding those tokens? I guess the
question is a little vague, but I'd appreciate any words of wisdom
from the interpreter experts.


Regards,


-bob mallozzi
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Robert S. Mallozzi 256-544-0887
                                                                                                            Mail Code ES 84
Work: http://www.batse.msfc.nasa.gov/ Marshall Space Flight Center
Play: http://cspar.uah.edu/~mallozzir/ Huntsville, AL 35812

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