Results 241 to 250 of about 433 (250)

Inferability of context-free programmed grammars

International Journal of Computer & Information Sciences, 1984
K S Fu, Fu K S
exaly  

On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

Lecture Notes in Computer Science, 2001
Rudolf Freund, Freund Rudolf, Pǎun Gheorghe   +2 more
exaly  

On the languages generated by context-sensitive fuzzy grammars

International Journal of Computer Mathematics, 1981
Irina Bucurescu
exaly  

A general approach to inference of context-free programmed grammars

IEEE Transactions on Systems, Man, and Cybernetics, 1984
exaly  

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 ...
openaire   +1 more source

1. Three Types of Regulation: Matrix, Programmed, and Random Context Grammars

1989
exaly  

Programmed grammars -- A new device for generating formal languages

1967
exaly  

On Nondeterminism in Programmed Grammars.

Alexander Meduna, Lukás Vrábel, Petr Zemek   +2 more
openaire  

Programming language specification by a grammar with contexts

2013
openaire   +1 more source

Programmed Grammar Systems.

openaire