Name
Abstract | ||
|---|---|---|
Reduction of attribute storage is a vital requirement for attribute evaluators. We present a new method for the analysis of lifetime of attribute instances. It is assumed that attribute evaluation is performed by a visit-oriented evaluator. Its evaluation sequence for any input can be described by a contex-free grammar derived from the visit-sequences. Conditions on that CFG decide for each attribute whether all its instances can be stored in a single global variable. Furthermore one can decide whether several different attributes can be mapped to a single global variable. Similarly conditions for stack implementation are given. All decisions can be made efficiently at evaluator generation time. Hence the method is well suited for compiler generation. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/BF00282619 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Information theory,Information system,Data mining,Data structure,Telecommunications network,Computer science,Variable and attribute,Compiler,Attribute domain,Global variable | Journal |
Volume | Issue | ISSN |
24 | 6 | 0001-5903 |
Citations | PageRank | References |
16 | 1.92 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uwe Kastens | 1 | 406 | 55.65 |