Abstract | ||
---|---|---|
The main tasks in compiler construction are solved by systematic algorithms. Tools are available which generate compiler modules from specifications. They are often developed as closed stand-alone systems difficult to combine with other tools. Integration of their products requires considerable engineering work and may loose efficiency because the tools fix all implementation decisions.
In order to improve the applicability of generating tools we suggest in this paper a modular tool structure: The central part of the generator translates an abstract representation of a specification into an abstract algorithm. These interfaces are open to meet the requirements of the tools environment by variations of the frontends and backends. Especially the implementation decisions for the generated products are separated from the generation of the abstract algorithm. We demonstrated this design principle applied to the development of a CFG toolset and an attribute evaluator generator.
Further work should be devoted to the development of other compiler tools on that base and to increase the variants of the existing tools. Furthermore we believe that the design principle is as well applicable to tools of areas different from compiler construction.
|
Year | DOI | Venue |
---|---|---|
1988 | 10.1007/3-540-51364-7_8 | CC |
Keywords | Field | DocType |
abstract interfaces,compiler generating tools,compiler construction | Inline expansion,Programming language,Functional compiler,Computer science,Compiler correctness,Loop optimization,Compiler,Optimizing compiler,Compiler construction,Intrinsic function | Conference |
Volume | ISSN | ISBN |
371 | 0302-9743 | 3-540-51364-7 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Uwe Kastens | 1 | 406 | 55.65 |