S. D. Swierstra and H. Vogt. Higher order attribute grammars. Attribute Grammars, Applications and Systems, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....programmer to refer to non local parts of the tree in a semantically transparent way. The importance of this feature was rst put forward in the reference attribute grammars of Hedin [Hed99] Our solution is, however, more akin to that of the higherorder attribute grammars of Swierstra et al. SV91] A non terminal need not de ne all its attributes explicitly: some attribute values may be inherited from another node in the tree. We call this phenomenon forwarding. The idea was rst put forward by Paul Kwiatkowski of Simonyi s team at Microsoft. Similar (but less powerful) features can ....

D. Swierstra and H. Vogt. Higher-order attribute grammars. In H. Albas and B. Melichar, editors, International Summer School on Attribute Grammars Applications and Systens: SAGA, volume 545 of Lecture Notes in Computer Science, pages 256-296. Springer-Verlag, 1991.

....6 describes transformations, especially partial evaluation and deforestation. Related Works : There exists a lot of extensions to attribute grammars. A common goal for them is to enlarge the expressiveness of standard attribute grammars. We want to mention here higher order attribute grammars [14], tree transducers [8] and dynamic attribute grammars [11] Since all of them are able to encode Gammacalculus, we will not expose in this article why and how their equivalence holds. We are interested here in showing an extension of an attribute grammar transformation method, the descriptional ....

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci., pages 256--296, New York--Heidelberg--Berlin, June 1991. Springer-Verlag.

....may be used to model functions, allowing the dynamic call tree to be reified as an explicit data structure, which, in conjunction with caching, permits re use of computation in a manner similar to our use of maintained functional attributes. Swierstra and Vogt have explored this technique [71], including an application to incremental name resolution. Pugh [61] explores function caching as a general technique for incremental computation. Although he discusses the application of function caching to classical incremental attribute evaluation, he is concerned principally with general ....

Doaitse Swierstra and Harald Vogt. Higher order attribute grammars. In H. Alblas and B. Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 256--296. Springer-Verlag, 1991.

....6 describes transformations, especially partial evaluation and deforestation. Related Works : There exists a lot of extensions to attribute grammars. A common goal for them is to enlarge the expressiveness of standard attribute grammars. We want to mention here higher order attribute grammars [14], tree transducers [8] and dynamic attribute grammars [11] Since all of them are able to encode Gammacalculus, we will not expose in this article why and how their equivalence holds. We are interested here in showing an extension of an attribute grammar transformation method, the descriptional ....

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci., pages 256--296, New York--Heidelberg--Berlin, June 1991. Springer-Verlag.

....a nonterminal attribute occurrence. Then the usual attribute evaluation is performed on the extended derivation tree. This concept is useful in practical applications such as multi pass compilers (cf. VSK89] syntax directed programming environments ( TC90] or compilers for supercombinators ([SV91]) It is obvious that these higher order features increase the programming comfort of the attribute grammar formalism. In this paper we raise the question whether they also have any impact on its computational power. We will answer it in the a#rmative by showing that there # Most of the work has ....

S.D. Swierstra and H.H. Vogt. Higher order attribute grammars. In H. Alblas and B. Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 256--296. Springer--Verlag, June 1991.

....into phases. Between each phase, the internal representation of the program changes with the final representation being the translation. In the framework of attribute grammars, this kind 43 of modularity can be supported by using attribute coupled grammars [9] or higher order attribute grammars [28]. In an attribute coupled grammar, each phase of the compiler is described by a new AG. The AGs that describe intermediate phases of the compiler return the syntax tree for the next phase as a synthesised attribute on the root node. Higher order AGs are a generalisation of attribute coupled ....

Swierstra, D. and Vogt, H. (June 1991) "Higher order attribute grammars." In: Alblas, H. and Melichar, B. (editors), Proceedings of International Summer School on Attribute Grammars, Applications and Systems , volume 545 of Lecture Notes in Computer Science. Springer Verlag, (pages 256--296).

....6 describes transformations, especially partial evaluation and deforestation. Related Works : There exists a lot of extensions to attribute grammars. A common goal for them is to enlarge the expressiveness of standard attribute grammars. We want to mention here higher order attribute grammars [14], tree transducers [8] and dynamic attribute grammars [11] Since all of them are able to encode Gammacalculus, we will not expose in this article why and how their equivalence holds. We are interested here in showing an extension of an attribute grammar transformation method, the descriptional ....

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci., pages 256--296, New York-- Heidelberg--Berlin, June 1991. Springer-Verlag.

.... ags, and multi visit ags (cf. EF89] AM91] absolutely noncircular ags (cf. KW76] ordered ags (cf. Kas80] and partionable ordered ags (cf. WG84] A number of extensions of ags have been proposed, e.g. attribute coupled grammars (cf. GG84] Gie88] and higher order ags (cf. [KSV89]) In attribute coupled grammars and higher order ags the value of an attribute can be a derivation tree, whose attribute values are subsequently evaluated. In [Mad97] a metalanguage for the specification of the static semantic of programming languages is introduced. The metalanguage, which is ....

.... for ordered ags based on selective recomputation was developed and implemented by Reps, Teitelbaum, and Demers (cf. DRT83] RT89] An efficient incremental evaluator for ordered higher order ags, which applies nested visit functions to traverse and decorate a derivation tree, is described in [KSV89]. Based on the original algorithm for ordered ags we will first develop an incremental evaluator for ordered mags, which is coarse grain (cf. Jok96] for a version of this incremental evaluator) Our coarse grain evaluator serves as starting point to develop a fine grain incremental evaluator for ....

M.F. Kuiper, S.D. Swierstra, and H.H. Vogt. Higher order attribute grammars. In Proc. SIGPLAN '89, pages 131--145. ACM Press, 1989. Symp. Language Design and Implementation.

....is not very suitable for practical applications. There has been a lot of research on augmenting the basic paradigm with extensions 1 to overcome certain problems such as the lack of modularity, extensibility and reusability; refer e.g. to [Wat75, Kas76, Lor77, Gie88, Hed89, DC90, Paa91, Kos91, SV91, Hed91, Kas91, FMY92, KLMM93, LJPR93, KW94, Boy96, DPRJ96, ZKM97, DPRJ97, Boy98, MZ98] Several concepts such as remote access, object orientation, templates, rule models, symbol computations, etc. have been implemented in one or another AG specification language such as Lido (Eli) Kas91, KW94] ....

Doaitse Swierstra and Harald Vogt. Higher Order Attribute Grammars. In Alblas and Melichar

....for the development of real applications and methods for their static analysis could not be transposed to other formalisms. Some works have attempted to respond to this problem by proposing extensions to the classical Attribute Grammar formalism, for instance Higher Order Attribute Grammars [SV91] Circular Attribute Grammars [Far86] or Multi Attributed Grammars [Att89] The main difference between these works and ours is the methodology used to attack the problem. All of them, in a first step, propose a linguistic extension designed to make the expression of a particular application ....

....the evaluator be able to store all attributes outside the tree. Fnc 2, in particular, uses sophisticated analysis techniques based on attribute lifetimes that allow most attributes to be stored in global variables or stacks [JP90b] resorting to a more systematic technique such as binding trees [SV91] for the very few that remain. Conditional productions introduce a new way to choose between the various alternatives applicable at a given point. To take this into account, the back end should generate a new production selector. The selection of a production which has been renamed from a ....

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Alblas and Melichar

....utilis ees pour leur analyse statique ne pouvaient pas etre transpos ees a d autres formalismes. Des travaux ont essay e de r epondre a ce probl eme en proposant diverses extensions au formalisme original des Grammaires Attribu ees, par exemple les Grammaires Attribu ees d ordre sup erieur [SV91] les Grammaires Attribu ees Circulaires [Far86] ou les Grammaires Multi Attribu ees [Att89] Nous avons le meme but, mais la diff erence la plus marquante entre ces travaux et les notres est la m ethodologie utilis ee pour aborder le probl eme. En effet, pour chacune d elles, la premi ere etape ....

.... Le syt eme Fnc 2 utilise des techniques d analyse sophistiqu ees, fond ees sur la dur ee de vie des attributs [JP90b] qui lui permettent de stocker la plupart des attributs dans des variables globales ou des piles ; en ayant recours a une technique plus syst ematique comme les Binding Trees [SV91] les quelques attributs restants peuvent aussi etre stock es hors de l arbre. Les productions conditionnelles permettent de diriger d une nouvelle fa con le choix entre diff erents syst emes de d efinitions d attributs applicables a un point donn e. En tenant compte de cela, le g en erateur de ....

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Alblas and Melichar [AM91], pages 256--296.

....based on attribute grammars. To make a programming environment suitable for language development it must include an incremental transformation or rewriting system. Recent extensions of attribute grammars, namely attribute coupled grammars[GG84, Gie88] and higherorder attribute grammars[VSK89, SV91, Vog93] have figured prominently in the realisation of program transformation systems. An incremental version of the latter is available[VSK91] To date, several important programming environment generators are available or under construction. Centaur and GIPE[Kli89] apply term rewriting for ....

S.D. Swierstra and H.H. Vogt. Higher order attribute grammars. In H. Alblas and B. Melichar, editors, International Summer School SAGA: Attribute Grammars and Systems, number 545 in LNCS, pages 256--296, Prague, 1991. Springer-Verlag.

.... class are, e.g. attribute grammars [Knu68] affix grammars [Kos71] tree walking automata [AU71] checking tree pushdown transducers [ERS80] attributed tree transducers [Ful81] nested stack tree to string transducers [EV86] attribute coupled grammars [Gie88] higher order attribute grammars [KSV89], and macro attributed tree transducers [KV94] Many investigations have been carried out to compare the translation power of the mentioned formalisms; some of them concern nondeterministic formalisms, others deterministic or even total deterministic formalisms. Here we are only concerned with ....

M.F. Kuiper, S.D. Swierstra, and H.H. Vogt. Higher order attribute grammars. In Proc. SIGPLAN '89, pages 131--145. ACM Press, 1989. Symp. Language Design and Implementation.

....grammars into this class of circular programs. Those acquainted with catamorphisms will furthermore recognise a catamorphims which returns a higher order type in the above program [MFP91] In recent years we have been interested in the incremental evaluation of (higher order) attribute grammars [VSK91, SV91, PSV92, Pen94]. The main aspect of the method being used is that attribute grammars are transformed into large sets of mutually recursive strict functions, the calls to which are being cached in order to avoid unnecessary reevaluations. The fact that the arguments to these functions can be evaluated before the ....

Doaitse Swierstra and Harald Vogt. Higher order attribute grammars. In H. Alblas and B. Melichar, editors, International Summer School on Attribute Grammars, Applications and Systems, volume 545 of LNCS, pages 48--113. Springer-Verlag, 1991.

....of the paper in the CSN 91 proceedings. tSupport has been received from the Netherlands Organisation for Scientific Research N.W.O. under NFI project STOP, project Specification and Transformations Of Programs. Higher order AGs ( Vogt, Swierstra and Kuiper 89, Teitelbaum and Chapman 90] and [Swierstra and Vogt 91] remove the artificial distinction between the syntactic level (context free grammar) and the semantic level (attributes) in attribute grammars. This strict separation is removed in two ways: First trees can be used directly as a value within an attribute equation. Second, a part of the tree ....

Swierstra, S.D. and H.H. Vogt. Higher Order Attribute Grammars. In the proceedings of the International Summer School on Attribute Grammars, Applications and Systems, (To Appear), Prague, June 4-13, 1991.

....grammars into this class of circular programs. Those acquainted with catamorphisms will furthermore recognise a catamorphims which returns a higher order type in the above program [MFP91] In recent years we have been interested in the incremental evaluation of (higher order) attribute grammars [VSK91, SV91, PSV92, Pen94]. The main aspect of the method being used is that attribute grammars are transformed into large sets of mutually recursive strict functions, the calls to which are being cached in order to avoid unnecessary reevaluations. The fact that the arguments to these functions can be evaluated before the ....

Doaitse Swierstra and Harald Vogt. Higher order attribute grammars. In H. Alblas and B. Melichar, editors, International Summer School on Attribute Grammars, Applications and Systems, volume 545 of LNCS, pages 48--113. Springer-Verlag, 1991.

No context found.

S. D. Swierstra and H. Vogt. Higher order attribute grammars. Attribute Grammars, Applications and Systems, 1991.

No context found.

S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci., pages 256--296, New York-- Heidelberg--Berlin, June 1991. Springer-Verlag.

No context found.

M.F. Kuiper, S.D. Swierstra, and H.H. Vogt. Higher order attribute grammars. In Proceedings of the 1989 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp 131-145, 1989.

No context found.

M.F. Kuiper, S.D. Swierstra, and H.H. Vogt. Higher order attribute grammars. In Proceedings of the 1989 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp 131-145, 1989.

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