Results 201 to 210 of about 184,770 (243)
Some of the next articles are maybe not open access.
An array grammar programming system
Communications of the ACM, 1973A package of Fortran programs has been developed that permits a user to interactively design and test array grammars. The user can control the rule selection procedure in a derivation or parse, using weighted programming matrices; he also has a choice of instance selection schemes (raster, random, parallel). Examples are given involving array languages
Andrew Mercer 0002, Azriel Rosenfeld
openaire +1 more source
PROGRAMMED GRAMMARS WITH RULE QUEUES
International Journal of Foundations of Computer Science, 2007We generalise the well-known notion of programmed grammars without appearance checking by introducing a buffer that could store sequences of rules, thus not necessarily describing the rule to be selected in the very next step, but rather in some future time.
openaire +1 more source
2005
Let [enum], [exp-i] and [pr-i] denote the class of recursively enumerable, typ-i expression and typ-i programmed graph languages respectively. The following hierarchy is known from [5]:
openaire +2 more sources
Let [enum], [exp-i] and [pr-i] denote the class of recursively enumerable, typ-i expression and typ-i programmed graph languages respectively. The following hierarchy is known from [5]:
openaire +2 more sources
Grammar-based program transformation
Proceedings. Conference on Software Maintenance, 1988., 1988A grammar-based technique is introduced for making sweeping changes, involving substantial restructuring, to large-scale software programs. Pervasive structural changes are often required to make changes in data structures, computational forms, or programming style during software maintenance. The concept of a grammar-based editor is introduced.
openaire +2 more sources
On the borderline between grammars and programs
1991We describe some of the engineering considerations and trade-offs in the design of a new Compiler Description Language, CDL3. The language is based on Extended Affix Grammars, where the affix rules are used to define tree types. The execution model is deterministic and depth-first, except that part of the work can be delayed until a second pass over ...
Cornelis H. A. Koster, Jean Beney
openaire +2 more sources
Direction controlled programmed grammars
Acta Informatica, 1972A generalization of the notion of a context-free grammar is presented here. It is based on the notion of a programmed grammar. When the underlying context-free rules do not contain erasing, the class of languages obtained is identical with the class of context-sensitive languages.
openaire +2 more sources
Automatic Grammar Induction for Grammar Based Genetic Programming
2015This paper discusses selected aspects of evolutionary search algorithms guided by grammars, such as Grammar Guided Genetic Programming or Grammatical Evolution. The aim of the paper is to demonstrate that, when the efficiency of the search process in such environment is considered, it is not only the language defined by a grammar that is important, but
Dariusz Palka, Marek Zachara
openaire +1 more source
Improving Determinization of Grammar Programs for Program Inversion
2013The inversion method proposed by Gluck and Kawabe uses grammar programs as intermediate results that comprise sequences of operations (data generation, matching, etc.). The determinization method used in the inversion method fails for a grammar program of which the collection of item sets causes a conflict even if there exists a deterministic program ...
Minami Niwa +2 more
openaire +1 more source
Grammar Bias and Initialisation in Grammar Based Genetic Programming
2012Preferential language biases which are introduced when using Tree-Adjoining Grammars in Grammatical Evolution affect the distribution of generated derivation structures, and as such, present difficulties when designing initialisation methods. Similar initial populations allow for a fairer comparison between different GP methods.
Eoin Murphy +4 more
openaire +2 more sources
Grammar-related transformations of logic programs
New Generation Computing, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brough, D. R., Hogger, C. J.
openaire +2 more sources