Graph-based compiler implementation

I'm preparing my PhD thesis on graph approach to compiler construction
(for "classic" languages as Pascal or C, not for functional
languages).
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.


                    Thanks.


                                Miroslav Benes
                                Technical University of Brno
                                Czech Republic
                                benes@dcse.fee.vutbr.cz
--

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