|optimal code from BURS: how? firstname.lastname@example.org (Thomas Johnsson) (1993-12-21)|
|From:||Thomas Johnsson <email@example.com>|
|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 (firstname.lastname@example.org)
Merry Xmas all!
Return to the
Search the comp.compilers archives again.