Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Automated selective caching for reference attribute grammars

  • Brian Malloy
  • Steffen Staab
  • Mark van den Brand
Publiceringsår: 2011
Språk: Engelska
Sidor: 2-21
Publikation/Tidskrift/Serie: Lecture Notes in Computer Science
Volym: 6563
Dokumenttyp: Konferensbidrag
Förlag: Springer


Reference attribute grammars (RAGs) can be used to express semantics as super-imposed graphs on top of abstract syntax trees (ASTs). A RAG-based AST can be used as the in-memory model providing semantic information for software language tools such as compilers, refactoring tools, and meta-

modeling tools. RAG performance is based on dynamic attribute evaluation with caching. Caching all attributes gives optimal performance in the sense that each attribute is evaluated at most once. However, performance can be further improved by a selective caching strategy, avoiding caching overhead where it does not pay off. In this paper we present a profiling-based technique for automatically finding a good caching configuration. The technique has been evaluated on a generated Java compiler, compiling programs from the Jacks test suite and the DaCapo benchmark suite.


  • Computer Science


SLE'10: 3rd International Conference on Software Language Engineering
  • EASE
  • ISBN: 978-3-642-19439-9

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen