A comparison of storage optimizations in automatically-generated attribute evaluators
Attribute grammars are a value-oriented, non-procedural extension of context-free grammars that facilitate the specification of translations whose domain is described by the underlying context-free grammar. Just as parsers for context-free languages can be automatically constructed from a context-free grammar, so can translators, called attribute evaluators, be automatically generated from an attribute grammar. A major obstacle to generating efficient attribute evaluators is that they typically use large amounts of memory to represent the attributed parse tree. In this report we investigate the problem of efficient representation of the attributed parse tree by analyzing and comparing the strategies of two systems that have been used to automatically generate a translator from an attribute grammar: the GAG system developed at the University of Karlsruhe and the LINGUIST-86 system written at Intel Corporation. Our analysis will characterize the two strategies and highlight their respective strengths and weaknesses. Drawing on the insights given by this analysis, we propose a strategy for storage optimization in automatically generated attribute evaluators that not only incorporates the best features of both GAG and LINGUIST-86, but also contains novel features that address aspects of the problem that are handled poorly by both systems.
- A comparison of storage optimizations in automatically-generated attribute evaluators
- GAG: a practical compiler generator
- scientific article; zbMATH DE number 3642745 (Why is no real title available?)
- scientific article; zbMATH DE number 3976291 (Why is no real title available?)
- scientific article; zbMATH DE number 3564261 (Why is no real title available?)
- scientific article; zbMATH DE number 3594668 (Why is no real title available?)
- Pebble games for studying storage sharing
- Translation of attribute grammars into procedures
- A comparison of storage optimizations in automatically-generated attribute evaluators
- Attribute storage optimization by stacks
- On efficient implementation of LR-attributed grammars
- scientific article; zbMATH DE number 4143464 (Why is no real title available?)
- Sublinear-space evaluation algorithms for attribute grammars
- scientific article; zbMATH DE number 1015111 (Why is no real title available?)
This page was built for publication: A comparison of storage optimizations in automatically-generated attribute evaluators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061506)