) Boyland, J. T., "Conditional Attribute Grammars," ACM Trans. Prog. Lang. Syst., 18, 1, pp. 73--108, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the following conditional semantic rule in R( h ; 0i = 8 : 1(h ; 1i) if hns; 1i = 1 and hns; 2i = 0, 2(h ; 2i) if hns; 1i = 0 and hns; 2i = 1, a otherwise. 46 The reason that we have not chosen for this model is that it leads to more complicated de nitions of noncircularity (cf. [Boy]) and the single use restriction. The usual notion of dependency graph takes a worst case view on dependencies in the sense that for a conditional semantic rule (4) it would assume h ; ii to depend on all attributes occurring in r 1 ; r n , whereas, for a particular input tree, h ; ii ....

J. T. Boyland; Conditional attribute grammars, TOPLAS 18 (1996), 73{ 108

....and constituents (aggregation of attribute values of distant nodes within the subtree) The extension shown by Boyland [4] allows both remote reference and remote de nition. He showed a technique that translates extended AGs to traditional AGs (actually, conditional AGs proposed by himself [3]) This is achieved by introducing the control attribute that is used only for scheduling, and the existing evaluator for conditional AGs can be applied to the transformed AGs. In the recent work by Hedin [7] the reference attributed grammars have been proposed as a natural and powerful ....

J. T. Boyland. Conditional attribute grammars. ACM Trans. Prog. Lang. Syst., 18(1):73-108, 1996.

....and the following conditional semantic rule in R(oe) hfi; 0i = 8 : 1(hfi; 1i) if hns; 1i = 1 and hns; 2i = 0, 2(hfi; 2i) if hns; 1i = 0 and hns; 2i = 1, a otherwise. The reason that we have not chosen for this model is that it leads to more complicated definitions of noncircularity (cf. [Boy]) and the single use restriction. The usual notion of dependency graph takes a worst case view on dependencies in the sense that for a conditional semantic rule (4) it would assume hff; ii to depend on all attributes occurring in r 1 ; r n , whereas, for a particular input tree, hff; ii ....

J. T. Boyland; Conditional attribute grammars, TOPLAS 18 (1996), 73-- 108

.... Such an example appears in Kastens s paper (1980) Boyland and Graham also pointed out that nonstrict conditional equations are useful for subexpression ordering (a code generation task in a compiler) Boyland and Graham, 1994) and in computing offsets in a compiler for a series of declarations (Boyland, 1996). Our technique of conditional evaluation is based on the visit oriented evaluation scheme (Engelfriet and File, 1982) There is one evaluation plan for each production rule in the grammar. A plan consists of instructions of the following four kinds: an if then else instruction, evaluation of an ....

....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 user can group together identical predicates manually. In addition to this minor syntactic difference, Boyland s technique splits a production with k conditional attribution equations into ....

Boyland, J.T. (1996) Conditional attribute grammars. ACM Trans. Programming Languages and Systems, 18(1), 73-108.

No context found.

) Boyland, J. T., "Conditional Attribute Grammars," ACM Trans. Prog. Lang. Syst., 18, 1, pp. 73--108, 1996.

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