We introduce another item in the already large list of techniques for attribute evaluation. Our algorithm consists in computing attributes by reductions to normal forms using a transducer operating on tree encodings of a cyclic representation of zippers. A zipper is a data structure introduced by Gérard Huet for representing a subtree together with its context, i.e. it is a tree with a focus that points to some node inside it. We mention some potential applications of this representation of attribute grammars as zipper transformers
In this paper we present higher-order attributed tree transducers as a formal computational model fo...
Tese de doutoramento do Programa Doutoral em InformáticaAttribute grammars are a suitable formalism ...
The possibilities for defining predicate transformers, denotational semantics, and operational seman...
We introduce another item in the already large list of techniques for attribute evaluation. Our algo...
International audienceEvaluation of attributes w.r.t. an attribute grammar can be obtained by induct...
AbstractEvaluation of attributes w.r.t. an attribute grammar can be obtained by inductively computin...
International audienceEvaluation of attributes w.r.t. an attribute grammar can be obtained by induct...
Lecture Notes in Computer Science Volume 8129, 2013.Attribute grammars are a suitable formalism to e...
This research abstract describes the research plan for a Ph.D project. We plan to define a powerful ...
Attribute Grammars are a powerfull, well-known formalism to implement and reason about programs whic...
Attribute grammars are a powerfull, well-known formalism to implement and reason about programs whic...
Attribute coupled grammars and their descriptional composition were advocated by Ganzinger and Giege...
Attribute grammars are a suitable formalism to express complex software language analysis and manipu...
The authors have applied tree contraction to evaluate attribute expressions in parallel. Attribute e...
AbstractWe indicate how, using a classification technique adopted from Jonkers, a hierarchy of attri...
In this paper we present higher-order attributed tree transducers as a formal computational model fo...
Tese de doutoramento do Programa Doutoral em InformáticaAttribute grammars are a suitable formalism ...
The possibilities for defining predicate transformers, denotational semantics, and operational seman...
We introduce another item in the already large list of techniques for attribute evaluation. Our algo...
International audienceEvaluation of attributes w.r.t. an attribute grammar can be obtained by induct...
AbstractEvaluation of attributes w.r.t. an attribute grammar can be obtained by inductively computin...
International audienceEvaluation of attributes w.r.t. an attribute grammar can be obtained by induct...
Lecture Notes in Computer Science Volume 8129, 2013.Attribute grammars are a suitable formalism to e...
This research abstract describes the research plan for a Ph.D project. We plan to define a powerful ...
Attribute Grammars are a powerfull, well-known formalism to implement and reason about programs whic...
Attribute grammars are a powerfull, well-known formalism to implement and reason about programs whic...
Attribute coupled grammars and their descriptional composition were advocated by Ganzinger and Giege...
Attribute grammars are a suitable formalism to express complex software language analysis and manipu...
The authors have applied tree contraction to evaluate attribute expressions in parallel. Attribute e...
AbstractWe indicate how, using a classification technique adopted from Jonkers, a hierarchy of attri...
In this paper we present higher-order attributed tree transducers as a formal computational model fo...
Tese de doutoramento do Programa Doutoral em InformáticaAttribute grammars are a suitable formalism ...
The possibilities for defining predicate transformers, denotational semantics, and operational seman...