|Graph-based compiler implementation BENES@dcse.fee.vutbr.cz (Miroslav Bene) (1993-08-26)|
|From:||Miroslav Bene <BENES@dcse.fee.vutbr.cz>|
|Organization:||DCSE FEECS TU Brno|
|Date:||Thu, 26 Aug 1993 00:17:54 GMT|
I'm preparing my PhD thesis on graph approach to compiler construction
(for "classic" languages as Pascal or C, not for functional
I want to use combination of bottom-up LALR parsing with graph
attributes for syntax analysis and building an internal graph
model of the source program, followed with graph rewriting steps
for semantic checks, some optimizing transformations and finally
generation of the target code.
Does anyone have a suggestion concerning the subject or
references to related books and technical reports (?available
through the Internet)? I am particularly interested in root
graphs rewriting systems as implemented in DACTL or LEAN.
Technical University of Brno
Return to the
Search the comp.compilers archives again.