Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Automated selective caching for reference attribute grammars

Författare

Redaktör

  • Brian Malloy
  • Steffen Staab
  • Mark van den Brand

Summary, in English

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.

Publiceringsår

2011

Språk

Engelska

Sidor

2-21

Publikation/Tidskrift/Serie

Lecture Notes in Computer Science

Volym

6563

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Science

Conference name

SLE'10: 3rd International Conference on Software Language Engineering

Conference date

2010-10-12

Status

Published

Projekt

  • Embedded Applications Software Engineering

ISBN/ISSN/Övrigt

  • ISBN: 978-3-642-19439-9