Results 201 to 210 of about 433 (250)
Some of the next articles are maybe not open access.
On context-free programmed grammars
Computer Languages, Systems and Structures, 1989Abstract We develop a definition of a deterministic and decidable class of context-free programmed grammars, the SPG class. A table-driven parsing algorithm that operates in quadratic time and an algorithm to produce the parsing table from a given grammar are included.
exaly +2 more sources
Attributed elementary programmed graph grammars [PDF]
, 1992 A new mechanism for generating graph languages is introduced which is based on the controlled rewriting of graphs using only six elementary types of graph productions, namely the addition, the deletion and the renaming of a node or an edge. Although these elementary graph productions are acting strictly locally and no embedding transformations are ...
Rudolf Freund, Brigitte Haberstroh
openaire +2 more sources
The power of programmed grammars with graphs from various classes [PDF]
Journal of Applied Mathematics and Computing, 2006 Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs.
Jürgen Dassow +2 more
exaly +2 more sources
Programmed grammars and their relation to the LBA problem [PDF]
Acta Informatica, 2006 We consider generating and accepting programmed grammars with bounded degree of non-regulation, that is, the maximum number of elements in success or in failure fields of the underlying grammar.
Henning Bordihn +2 more
exaly +2 more sources
Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation, 2003
Syntactic analysis forms a foundation of many source analysis and reverse engineering tools. However, a single grammar is not always appropriate for all source analysis and manipulation tasks. Small changes to the grammar can make the programs used to accomplish these tasks simpler and more straightforward.
Thomas R. Dean +3 more
openaire +1 more source
Syntactic analysis forms a foundation of many source analysis and reverse engineering tools. However, a single grammar is not always appropriate for all source analysis and manipulation tasks. Small changes to the grammar can make the programs used to accomplish these tasks simpler and more straightforward.
Thomas R. Dean +3 more
openaire +1 more source
Extending Program Synthesis Grammars for Grammar-Guided Genetic Programming
2018Program synthesis is a problem domain that due to its importance is tackled by many different fields, one being Genetic Programming. Two variants, Grammar-Guided Genetic Programming (G3P) and PushGP, have been applied to a vast general program synthesis benchmark suite and solved a variety of problems although with varying success rates.
Stefan Forstenlechner +3 more
openaire +1 more source
Graph grammars and logic programming
2005In this paper we investigate the relationship between the algebraic definition of graph grammars and logic programming. In particular, we show that the operational semantics of any logic program can be faithfully simulated by a particular context-free hypergraph grammar.
CORRADINI, ANDREA +4 more
openaire +2 more sources
Modelling platform-based product configuration using programmed attributed graph grammars [PDF]
Journal of Engineering Design, 2003 The rationale of platform-based product configuration has been well recognized for the implementation of mass customization. A product platform refers to the conceptual structure and logical organization of product families from both customer and ...
Jianxin Jiao
exaly +2 more sources
Grammar-based immune programming
Natural Computing, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heder S. Bernardino, Helio J. C. Barbosa
openaire +2 more sources
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