optimal code from BURS: how?

Thomas Johnsson <johnsson@cs.chalmers.se>
Tue, 21 Dec 1993 16:21:33 GMT

          From comp.compilers

Related articles
optimal code from BURS: how? johnsson@cs.chalmers.se (Thomas Johnsson) (1993-12-21)
| List of all articles for this month |

Newsgroups: comp.compilers
From: Thomas Johnsson <johnsson@cs.chalmers.se>
Keywords: tools, question
Organization: Compilers Central
Date: Tue, 21 Dec 1993 16:21:33 GMT

I find it mind-boggling that it is possible to construct a tree pattern
matcher (eg BURS) that is able to do the all the dynamic programming and
cost manipulation to get locally optimal code at automata-generation time.
All the papers I've looked at are very technical and void of explanatory

Thus I'm looking for references to papers (reports/theses) that can
explain this. Perhaps someone on the net would venture to explain it?

-- Thomas Johnsson (johnsson@cs.chalmers.se)

Merry Xmas all!

Post a followup to this message

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