Computer Science Colloquium
Prof. Dr. John Gough
Oracle Labs, Brisbane, Queensland University of Technology
Reconceptualising Bottom-Up Tree Rewriting
Wed 17.07.2013, 16:00, 60 minutesS3 218
Abstract
Bottom-up tree rewriting is a widely used method for code selection in programming language compilers. The use of dynamic programming allows such rewriters to emit code sequences that are optimal with respect to some prescribed cost metric, at least for tree-structured computations. The semantics of rewriting are specified by the production rules of a tree grammar.In this talk, I show that a suitable reinterpretation of the meaning of the non-terminal symbols of such grammars provides a significant increase in the expressivity of the rewriting system. In particular, the generation of instructions for flow of control may be subsumed into the rewriter. Likewise, transformation rules normally associated with peephole optimization are also conveniently expressible.
Bio
John Gough is a professor emeritus at Queensland University of Technology in Brisbane and and a researcher at Oracle Labs, Brisbane. His research interests include programming languages, compilers and virtual machines. He is also the author of several books on these topics.Invited by Prof. Dr. Hanspeter Mössenböck, Institut für Systemsoftware
The Computer Science Colloquium is organized by the Department of Coputer Science at JKU, the Österreichische Gesellschaft für Informatik (ÖGI) and the Österreichische Computergesellschaft (OCG).