Re: Compiling expressions

On Dec 29 2012, 11:33 pm, glen herrmannsfeldt <g...@ugcs.caltech.edu>
wrote:
> James Harris <james.harri...@gmail.com> wrote:


> > Compiling expressions ...


> > ... I'm not after a prebuilt solution but would be interested to
> > hear from other folks who have had similar issues to address. The
> > requirements are:


> > 1. Hand-written, not the output of a parser generator.
>
> An interesting requirement.
>
> I can understand need for speed, size, and such, and maybe one
> of those requires a hand-written (hand optimized) parser.
>
> If you are so restricted, do you allow your parser to be written
> in a high-level language? To be compiled by a non-handwritten
> compiler?


The parser for the rest of the language is handwritten and top-down.
Therefore it makes sense to parse expressions the same way. I don't
want to have generated code just to recognise expressions. It doesn't
feel like a restriction per se, just a choice.


HLL is fine. How the compiler is compiled doesn't matter.


...


> > 3. Precedences (and possibly associativities) defined in tables.
>
> Tables most easily generated automatically, by a parser generator?


I would rather the result is easy to understand but I don't mind too
much how the tables are generated.


James

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