Results 1 to 10 of about 1,546 (250)
Modeling structure-function relationships in synthetic DNA sequences using attribute grammars. [PDF]
Recognizing that certain biological functions can be associated with specific DNA sequences has led various fields of biology to adopt the notion of the genetic part.
Yizhi Cai +3 more
doaj +2 more sources
Finding circular attributes in attribute grammars [PDF]
The problem of finding the circular attributes in an grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially expontial. It is also shown that finding the circular attributes is harder than testing circularity.
Michael Rodeh, Mooly Sagiv
openalex +3 more sources
<p>An attribute grammar G is k-visit if for any derivation tree t of G it is possible to evaluate all the attributes associated with t by walking through t in such a way that no node in t is visited more than k times.</p><p>We show in this paper that any well-defined attribute grammar G is k-visit for some k.
Hanne Riis, Sven Skyum
openalex +5 more sources
Aspect-Oriented Attribute Grammars
Despite the efforts of several researchers modularization, reusability and extensibility remain a problem within the area of language specification. Attribute Grammars (AGs) present a well-known formal approach for defining programming languages.
Marjan Mernik, D. Rebernak
openalex +4 more sources
Knowledge Representation with Attribute Grammars [PDF]
Summary: The use of attribute grammars for knowledge representation is examined in the present paper. It is shown how data knowledge and knowledge-base knowledge can be represented using syntactic and semantic notation. Control knowledge is represented by the parsing mechanism of the interpreter used.
G. Papakonstantinou
openalex +3 more sources
Simple multi-visit attribute grammars
AbstractAn attribute grammar is simple multi-visit if each attribute of a nonterminal has a fixed visit-number associated with it such that, during attribute evaluation, the attributes of a node which have visit-number j are computed at the jth visit to the node. An attribute grammar is l-ordered if for each nonterminal a linear order of its attributes
Joost Engelfriet, Gilberto Filé
openalex +3 more sources
Grammar-Based Specification and Parsing of Binary File Formats
The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of
William Underwood
doaj +11 more sources
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

