Re: Writing a FAST compiler.

In article 91-08-022, beard@ux5.lbl.gov (Patrick C
Beard) writes:
|> Most compiler efficiency issues revolve around creating highly optimized
|> code. However, good code generation with fast turn-around time is often
|> more important for the software engineer. Who cares how good the code
|> generated is if it's just going to change as the development process
|> proceeds?


The same trade-off appears in parser generation. If you are develloping a
grammar, you are not that much interested in extremely fast parsers if
their generation takes a long time. Therefore we have develloped the lazy
and incremental parser generator IPG.
I mainly mention this for your related work section, as I do not think that
the same principles can be applied to compiler generation easilly.


Some references:
@article{HKR90,
    key = {HKR90},
    author = {J. Heering and P. Klint and J. Rekers},
    title = {Incremental generation of parsers},
    journal = {IEEE Transactions on Software Engineering},
    volume = {16},
    number = {12},
    pages = {1344-1351},
    year = {1990}}


@techreport{HKR91,
    author = {J. Heering and P. Klint and J. Rekers},
    title = {Principles of lazy and incremental program generation},
    institution = {Centrum voor Wiskunde en Informatica (CWI)},
    type = {Report {CS}-{R9124}}
    address = {Amsterdam},
    year = {1991}}


Jan Rekers (rekers@cwi.nl) Centrum voor Wiskunde en Informatica (CWI)
P.O. Box 4079, 1009 AB Amsterdam, The Netherlands
--

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