Results 21 to 30 of about 26,519 (281)
Our previous study showed that automatically generated attribute grammars were harder to comprehend than manually written attribute grammars, mostly due to unexpected solutions.
Tomaž Kosar+3 more
doaj +1 more source
On Comprehension of Genetic Programming Solutions: A Controlled Experiment on Semantic Inference
Applied to the problem of automatic program generation, Genetic Programming often produces code bloat, or unexpected solutions that are, according to common belief, difficult to comprehend.
Boštjan Slivnik+3 more
doaj +1 more source
Extended Attribute Grammars [PDF]
<p>Two new formalisms are introduced: extended attribute grammars, which are capable of defining completely the syntax of programming languages, and extended attributed trans!ation grammars, which are additionally capable of defining their semantics by translation.
Watt, David A., Madsen, Ole Lehrmann
openaire +4 more sources
A Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon [PDF]
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model transformations.
Anthony Anjorin, Marius Lauder
doaj +1 more source
From Grammar Inference to Semantic Inference—An Evolutionary Approach
This paper describes a research work on Semantic Inference, which can be regarded as an extension of Grammar Inference. The main task of Grammar Inference is to induce a grammatical structure from a set of positive samples (programs), which can sometimes
Željko Kovačević+3 more
doaj +1 more source
INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS [PDF]
Data acquisition using unmanned aerial vehicles (UAVs) has gotten more and more attention over the last years. Especially in the field of building reconstruction the incremental interpretation of such data is a demanding task.
Y. Dehbi+3 more
doaj +1 more source
The formal power of one-visit attribute grammars [PDF]
An attribute grammar is one-visit if the attributes can be evaluated by walking through the derivation tree in such a way that each subtree is visited at most once.
Engelfriet, Joost, Filè, Gilberto
core +3 more sources
Having extensible languages is appealing, but raises the question of how to construct extensible compilers and how to compose compilers out of a collection of pre-compiled components. Being able to deal with attribute grammar fragments as first-class values makes it possible to describe semantics in a compositional way; this leads naturally to a ...
Marcos Viera, S. Doaitse Swierstra
openaire +4 more sources
Ordered attributed grammars [PDF]
Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed grammars proposed by Knuth. An attributed grammar is ordered if for each symbol a partial order over the associated attributes can be given, such that in any context of the symbol the attributes are evaluable in an order which includes that partial order.
openaire +3 more sources
Incremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements [PDF]
Incremental algorithms for evaluating attribute grammars (AGs) have been extensively studied in recent years, primarily because of their application in language-based environments.
Micallef, Josephine
core +2 more sources