Results 141 to 150 of about 26,922 (200)

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

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).
A. Klaiber, M. Gokhale
openaire   +1 more source

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, CsuhajVarju E, Holzer M, Vaszil G   +3 more
openaire   +3 more sources

On Insertion Grammars with Maximum Parallel Derivation

Fundamenta Informaticae, 2009
In this paper we investigate insertion grammars and explore their capacity to generate words parallelly by introducing parallel derivation (where more than one rule can be applied to the string in parallel) and maximum parallel derivation (where as many rules as possible are applied to the string in parallel).
openaire   +1 more source

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

Parallel Communicating Grammar Systems As Language Analyzers

Grammars, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bordihn, Henning, Dassow, Jürgen, Vaszil, György   +2 more
openaire   +2 more sources

Parallel communicating grammar systems with negotiation

Fundamenta Informaticae, 1996
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 formulated on the ...
Păun, Gheorghe, Polkowski, Lech, Skowron, Andrzej   +2 more
openaire   +2 more sources

On parallel evaluation of ordered attribute grammars

Journal of Computer Science and Technology, 1991
In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well.
Shunqian Wang, Daxing Ye
openaire   +1 more source

Parallel stochastic grammar induction

Proceedings of International Conference on Neural Networks (ICNN'97), 2002
This paper examines the problem of stochastic grammar induction and gives a formal analysis of observed limitations of a classical algorithm. It then describes a parallel approach to the problem which avoids these limitations. Finally, a proof is presented which shows that a popular training algorithm already in use for recurrent connectionist networks
openaire   +1 more source

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.
Leo A. Meyerovich, Matthew E. Torok, Eric Atkinson, Rastislav Bodik   +3 more
openaire   +1 more source