Results 211 to 220 of about 184,770 (243)
Some of the next articles are maybe not open access.
Programming the PTQ Grammar in XSB
1995The XSB language is an implementation of the Prolog programming language that supports tabling. Since tabling introduces a bottom-up component to the computation, it is essentially an in-memory implementation of a deductive database system. In particular, it is an implementation of SLG-def resolution, a subsystem of SLG resolution [1].The resulting ...
openaire +3 more sources
Visual concurrent programming with Δ-grammars
Journal of Visual Languages & Computing, 1992Abstract 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
Learning Grammar Rules in Probabilistic Grammar-Based Genetic Programming
2016Grammar-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 +2 more
openaire +2 more sources
Extracting grammar from programs
ACM SIGPLAN Notices, 2005The 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 +4 more
openaire +2 more sources
Detecting Ambiguity in Programming Language Grammars
2013Ambiguous 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
Attributed elementary programmed graph grammars
1992A 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
Optimization of functional programs by grammar thinning
ACM Transactions on Programming Languages and Systems, 1995We 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
2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023
Ning Tao +2 more
openaire +1 more source
Ning Tao +2 more
openaire +1 more source
Multi-Objective Grammar-Guided Genetic Programming for Grammar-Obeying Program Synthesis
Grammar-obeying program synthesis is a subfield of program syn- thesis (i.e., the task of automatically discovering an executable piece of code) that requires generated code to follow a Backus-Naur Form (BNF) grammar. Having code that obeys a grammar limits the structure of the code and the set of callable functions/method- s/libraries, thus having an ...Tao, Ning +3 more
openaire +3 more sources