Results 91 to 100 of about 510 (156)
Some of the next articles are maybe not open access.

Parallel Communicating Graph Grammar

2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011
In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k)
M. Saravana Vadivu   +2 more
openaire   +2 more sources

Parallel evaluation of attribute grammars

IEEE Transactions on Parallel and Distributed Systems, 1992
Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach).
Alexander C. Klaiber, Maya Gokhale
openaire   +2 more sources

Parallel communicating grammar systems with negotiation

Fundamenta Informaticae, 1996
Summary: In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions ...
Lech Polkowski   +2 more
openaire   +3 more sources

Parallel Grammars and Computation

2017
Originally, computer programs were always executed strictly sequentially. Indeed, to perform a computational task, an algorithm was written and implemented as an instruction sequence executed on a central processing unit on a single computer. Only one instruction was executed at a time, so after this instruction was completed, the next instruction was ...
Alexander Meduna, Ondřej Soukup
openaire   +2 more sources

On the synchronization in parallel communicating grammar systems [PDF]

open access: possibleActa Informatica, 1993
The power of various types of synchronization in parallel communication grammar systems is investigated. These systems were introduced by the author and \textit{L. Santean} [Ann. Univ. Bucuresti, Series Matem.-Inform., 38, No. 2, 55-63 (1989; Zbl 0749.68048)] and consist of more Chomsky grammars working together for generating one language.
openaire   +2 more sources

Parallel Composition of Graph Grammars

Applied Categorical Structures, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Parallel schedule synthesis for attribute grammars

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming, 2013
We examine how to synthesize a parallel schedule of structured traversals over trees. In our system, programs are declaratively specified as attribute grammars. Our synthesizer automatically, correctly, and quickly schedules the attribute grammar as a composition of parallel tree traversals. Our downstream compiler optimizes for GPUs and multicore CPUs.
Rastislav Bodik   +3 more
openaire   +1 more source

Parallel parsing of operator precedence grammars

Information Processing Letters, 2013
Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face problems and to exploit technologies highly relevant in these days. In this paper we focus on their local parsability property, i.e., the fact that any substring s of a longer one x.s.y can be parsed independently of its ...
BARENGHI, ALESSANDRO   +3 more
openaire   +3 more sources

Parallel ordered attribute grammars

Proceedings of the 1992 International Conference on Computer Languages, 2003
Ordered attributed grammars (OAGs) are extended for use on parallel computers. A partition of the attributes of a tree leads to parallel evaluation if each partition is taken care of by a separate process. Visit sequences for parallel ordered attribute grammars (POAGs) are constructed, and it is shown that the POAG class is of the same power as the OAG
openaire   +2 more sources

ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING

International Journal of Foundations of Computer Science, 2007
We continue our investigation of the generative power of cooperating distributed grammar systems (CDGSs), using the previously introduced ≤k-, =k-, and ≥k-competence-based cooperation strategies and context-free components that rewrite the sentential form in a parallel manner.
Ter Beek M H   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy