9 citations found. Retrieving documents...
M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.

 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)

....to update such an attribute. Practical evaluators must avoid this inefficiency, either by extending the attribute grammar framework, e.g. Hedin s Door Attribute Grammars [32, 33] or by using a mechanism to recognize and bypass copy rules automatically, such as those of Hoover [34] and Pennings [59]. With the elimination of copy rules, an incremental attribute evaluator can achieve fully incremental behavior to the extent that the attribute dependencies fully expose the dependency structure of the computation. For simple (e.g. scalar) attribute values, this condition obtains. However, ....

Maarten Pennings. Generating Incremental Attribute Evaluators. Ph.D. dissertation, Utrecht University, 1994. 155


Graphical User Interfaces in an Event-Driven Environment Based.. - Oudejans (1996)   (Correct)

....are addressed. 3.1 Higher order attribute grammars Attribute grammars are a formalism for describing formal languages. An attribute grammar defines the structure of trees, associates objects with tree nodes, the attributes, and specifies how attributes of adjacent nodes depend on each other [7]. An attribute grammar therefore describes the computation of these attributes. An attribute evaluator takes a tree as input and computes the values of all attributes attached to the nodes of that tree. This process is known as decoration. After a modification of the input tree, an incremental ....

....theoretical aspect of HAG s is that any computation can be modeled through attribute evaluation in a higher order attribute grammar. It has been proven that higher order attribute grammars without semantic functions have the same expressive power as plain attribute grammars with semantic functions [7]. An evaluator for an attribute grammar can be constructed automatically with an evaluator generator. An example of such a generator is the LRC processor [7] LRC for short. LRC constructs an incremental evaluator from a higherorder attribute grammar. An important feature of the generated ....

[Article contains additional citation context not shown here]

M.C.Pennings, Generating incremental attribute evaluators, 1994, PhD thesis University of Utrecht.


Deterministic, Error-Correcting Combinator Parsers - Swierstra, Duponcheel (1996)   (1 citation)  (Correct)

....into: f1 = a1 expensive b1) where (a1, b1) g1 , h1 ) f2 x = a2 cheap b2) where (a2, b2 ) g2 x, h2 x) g1 = 5 h1 = 3 g2 x = x x h2 x = x x (z1, z2) f1, f27) but that is exactly what we have done in our parsing combinators. Using techniques from the area of attribute grammars [7, 6] such rewriting can be done automatically in many situations. The techniques used imply however some form of global analysis of the program, and are not easily added to existing implementations of functional languages. Exercise 13. This exercise is a little (but non trivial) programming project. ....

Maarten Pennings. Generating Incremental Attribute Evaluators. PhD thesis, Utrecht University, Dept. of Computer Science, 1994. www.cs.ruu.nl.


AML: Attribute Grammars in ML - Efremidis, Mughal, Reppy, al. (1997)   (2 citations)  (Correct)

....functional evaluator, based on neighbor functions, is described in [30, 39] Neighbor functions are comprised of both visit and suspend functions, and allow re evaluation to start at the node of subtree replacement rather than at the root of the syntax tree. Pennings in his Ph.D. thesis, [33], discusses how incremental evaluators can be generated by memoising visit functions. The only attributes of interest in his algorithms are those of the root of the syntax tree. The algorithms, however, do not lend themselves to interactive systems where all the attributes need to be stored. ....

PENNINGS, M.C. 1994. Generating incremental attribute evaluators. Ph.D. thesis, Computer Science, Utrecht University.


Selective Memoization - Umut Acar Guy (2003)   (1 citation)  (Correct)

No context found.

M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.


Selective Memoization - Acar, Blelloch, Harper (2003)   (1 citation)  (Correct)

No context found.

M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.


Selective Memoization - Umut Acar Guy (2003)   (1 citation)  (Correct)

No context found.

M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.


Selective Memoization - Acar, Blelloch, Harper (2003)   (1 citation)  (Correct)

No context found.

M. Pennings. Generating Incremental Attribute Evaluators. PhD thesis, University of Utrecht, Nov. 1994.


Deterministic, Error-Correcting Combinator Parsers - Swierstra, Duponcheel (1996)   (1 citation)  (Correct)

No context found.

Maarten Pennings. Generating Incremental Attribute Evaluators. PhD thesis, Utrecht University, Dept. of Computer Science, 1994. www.cs.ruu.nl.

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