Results 221 to 230 of about 433 (250)

Learning Grammar Rules in Probabilistic Grammar-Based Genetic Programming

2016
Grammar-based Genetic Programming (GBGP) searches for a computer program in order to solve a given problem. Grammar constrains the set of possible programs in the search space. It is not obvious to write an appropriate grammar for a complex problem. Our proposed Bayesian Grammar-Based Genetic Programming with Hierarchical Learning (BGBGP-HL) aims at ...
Pak-Kan Wong, Man-Leung Wong, Kwong-Sak Leung   +2 more
openaire   +1 more source

Visual concurrent programming with Δ-grammars

Journal of Visual Languages & Computing, 1992
Abstract We have been investigating the use of visual graph rewriting languages as a framework for the programming of concurrent and distributed systems. In this paper, we present Δ-grammars, a general graph rewriting framework based on the theory of graph grammars, illustrate Δ programs, and show how static analysis techniques can be employed to ...
Joseph P. Loyall, Simon M. Kaplan
openaire   +1 more source

Extracting grammar from programs

ACM SIGPLAN Notices, 2005
The paper discusses context-free grammar (CFG) inference using genetic-programming with application to inducing grammars from programs written in simple domain-specific languages. Grammar-specific heuristic operators and non-random construction of the initial population are proposed to achieve this task.
Matej Crepinsek, Marjan Mernik, Faizan Javed, Barrett R. Bryant, Alan P. Sprague   +4 more
openaire   +1 more source

Grammar model-based program evolution

Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2004
In evolutionary computation, genetic operators, such as mutation and crossover, are employed to perturb individuals to generate the next population. However these fixed, problem independent genetic operators may destroy the sub-solution, usually called building blocks, instead of discovering and preserving them.
Yin Shan, Robert I. McKay, Rohan Baxter, Hussein A. Abbass, Daryl Essam, Nguyen Xuan Hoai   +5 more
openaire   +1 more source

Optimization of functional programs by grammar thinning

ACM Transactions on Programming Languages and Systems, 1995
We describe a new technique for optimizing first-order functional programs. Programs are represented as graph grammars, and optimization proceeds by counterexample: when a graph generated by the grammar is found to contain an unnecessary computation, the optimizer attempts to reformulates the grammar so that it never again generates any graph that ...
openaire   +1 more source

Detecting Ambiguity in Programming Language Grammars

2013
Ambiguous Context Free Grammars (CFGs) are problematic for programming languages, as they allow inputs to be parsed in more than one way. In this paper, we introduce a simple non-deterministic search-based approach to ambiguity detection which non-exhaustively explores a grammar in breadth for ambiguity.
Naveneetha Vasudevan, Laurence Tratt
openaire   +2 more sources

Program Synthesis with Generative Pre-trained Transformers and Grammar-Guided Genetic Programming Grammar

2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023
Ning Tao, Anthony Ventresque, Takfarinas Saber   +2 more
openaire   +1 more source

The Grammar Program

1990
openaire   +2 more sources

Grammars-as-programs versus grammars- as-data

Behavioral and Brain Sciences, 1983
openaire   +1 more source

Programming language grammar anthology

ACM SIGPLAN Notices, 1973
openaire   +1 more source