J. Engelfriet and W. de Jong, Attribute storage optimization by stacks, Acta Informatica 27 pp. 567-581 (1990). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Discovering Anomalies In Access Modifiers In Java With A Formal.. - Yang (1998) (Correct)
....is indispensable in designing a new language. 1. Introduction Attribute grammars, proposed by Knuth in 1968 [10] were intended for specifying the semantics of programming languages. Most research in attribute grammars is focused on the evaluation strategies [1, 9, 12, and storage management [2, 7, 8, 11] of the attribute evaluators. Some researchers works on extending the language of attribute grammar for specifications [4, 6] Only a few reports [13, 14] are available that demonstrate the actual use of attribute grammar in specifying (parts of) the semantics of a practical programming language. ....
J. Engelfriet and W. de Jong, Attribute storage optimization by stacks, Acta Informatica 27 pp. 567-581 (1990).
SSCC: A Software Tool Based on Extended Ordered Attribute Grammars - Yang, Liu (1998) (Correct)
....Since SSCC does not parse these C functions, type consistency between the attribution equations and the C functions is not checked and is deemed as a user s responsibility. 3 It has been pointed out that storage utilization is a serious problem in practical attribute grammar systems (Engelfriet and de Jong, 1990; Farrow and Yellin, 1986; Kastens, 1987; op den Akker and Sluiman, 1991) Large data structures, such as symbol tables in compilers, are usually defined as attributes of symbols. Because there may be many slightly different copies of the data structures in the syntax tree during evaluation, a ....
....data structure during evaluation. By contrast, in the pure attribute grammar formalism, these data structures must be defined as attributes of symbols. There are usually many copies of the data structures attached to the nodes of the syntax tree during evaluation. Complicated lifetime analysis (Engelfriet and de Jong, 1990; Farrow and Yellin, 1986; Kastens, 1987; op den Akker and Sluiman, 1991) might help in identifying global data structures. Since a user is usually aware of data structures used in his specifications that could or should be implemented as global structures, SSCC provides a much simpler solution ....
Engelfriet, J. and W. de Jong (1990) Attribute storage optimization by stacks. Acta Informatica, 27, 567-581.
Conditional Evaluation in Simple Multi-Visit Attribute-Grammar.. - Yang (1997) (1 citation) (Correct)
....in this paper is a static one. It works by carefully analyzing attribute dependencies during the generation of evaluation sequences. Though there have been many other research papers on attribute evaluation methods (Alblas, 1991; Jourdan, 1991) and on storage optimization (Akker and Sluiman, 1991; Engelfriet and Jong, 1990), these works did not address the issue of conditional evaluation. 4 Our conditional evaluation scheme is somewhat similar to Boyland s conditional attribute grammars (Boyland, 1996) Due to the undecidability of the predicate equivalence problem, Boyland proposed a new syntax with which a ....
Engelfriet, J. and W. de Jong (1990) Attribute storage optimization by stacks. Acta Informatica, 27, 567-581.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC