R. Jullig and Frank DeRemer. Regular right-part attribute grammars. SIGPLAN Symposium on Compiler Construction, 171--178, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Incremental Static Semantic Analysis - Maddox, III (1997) (5 citations) (Correct)
....drastic improvement for one important case. There is a constant factor penalty due the the presence of singleton nodes, but even this may be eliminated at the cost of a small increase in implementation complexity. 4 These are taken from a set of six such patterns identified by Jullig and DeRemer [45] in connection with a notation for attributing regular right part grammars. The two patterns not shown here reflect constraints as well as attribute propagation, as Jullig and DeRemer were working in the framework of Extended Attribute Grammars [81] a restricted variant of two level grammars. ....
Richard K. Jullig and Frank DeRemer. Regular right-part attribute grammars. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, pages 171--178, 1984.
Domain Specific Language Extensions - Backhouse (2000) (Correct)
....on the structure of the production, but not on the content. As an example, they discuss the process of passing environments around the tree. Compilers often need to pass an environment down the tree while passing new variable definitions up the tree. This operation, for which Jullig and DeRemer [14] coined the phrase Bucket Brigade , is a left to right traversal of the tree. Dueck and Cormack use pattern notation to describe the operation as follows: module env (1) goal # A . A.env = 0; 2) A # B . B.env = A.env; 3) A # . B C . C.env = B.def; module def (4) ....
Jullig, R. K. and DeRemer, F. (June 1984) "Regular right-part attribute grammars." ACM SIGPLAN Notices , 19(6): pages 171--178.
Adding Semantics to XML - Psaila, Crespi-Reghizzi (1999) (4 citations) (Correct)
....of bibliographic items BIBITEM, that have only generic text as content. Rules are contained in the SRD block rules for element= BIBITEM father of= #PCDATA . rules for 1 Similar problems are encountered when one tries to associate an attribute grammar to an Extended BNF syntax (see [12, 5]) Unfortunately, there is not a leading proposal for solving this problem. 125 Giuseppe Psaila and Stefano Crespi Reghizzi Another case to consider is represented by empty elements. If the DTD allows an element X to be empty, the relationship X father of #EMPTY is relevant for semantic rules. ....
R. K. Jullig and F. DeRemer. Regular right-part attribute grammars. In ACM SIGPLAN-84, 1984.
A Reusable Object-Oriented Approach to Formal Specifications of .. - Mernik, al. (2000) (Correct)
....matching process which is very difficult to follow. These difficulties with MAG were already observed by authors. On the other hand, MAG also does not have a counterpart to our multiple inheritance approach. The last observation is also true in the case of regular right part attribute grammars [JUL 84] In regular right part attribute grammars regular operators for concatenation, alternation and repetition are extended with the constancy operator and the distributed bucket brigade operator to describe frequently patterns in semantic rules. Our templates are more general since designers can ....
Julling K., DeRemer F., "Regular right-part attribute grammars", Proceedings of SIGPLAN'84 Symposium on Compiler Construction, ACM SIGPLAN Notices, Vol. 19, No. 6, pp. 171 - 178, 1984.
The Template and Multiple Inheritance Approach into .. - Mernik, Lenic.. (1998) (Correct)
....by the pattern matching process which is very difficult to follow. These difficulties with MAG were already observed by authors. On the other hand, MAG has no counterpart to our multiple inheritance approach. The last observation is also true in the case of regular right part attribute grammars [10]. In regular rightpart attribute grammars regular operators for concatenation, alternation and repetition are extended with constancy operator and the distributed bucket brigade operator to describe frequently patterns in semantic rules. Our templates are more general since designers can create ....
Julling K., DeRemer F. Regular right-part attribute grammars. Proceedings of SIGPLAN'84 Symposium on Compiler Construction, ACM SIGPLAN Notices, Vol. 19, No. 6, pp. 171 - 178, 1984.
Attribute Grammars for Unranked Trees as a query language for.. - Neven (Correct)
No context found.
R. Jullig and Frank DeRemer. Regular right-part attribute grammars. SIGPLAN Symposium on Compiler Construction, 171--178, 1984.
Modularity and Reusability in Attribute Grammars - Kastens, Waite (1992) (38 citations) (Correct)
No context found.
Jullig, R. K. & DeRemer, F., "Regular Right-Part Attribute Grammars," SIGPLAN Notices 19 (June 1984), 171--178.
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