By Topic

An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Baccelli, F. ; INRIA, Domaine de Voluceau Rocquencourt ; Mussi, P.

We define some decomposition schema of the derivation trees of an arithmetic infix grammar into a set of subtrees. From the parenthesis nesting of an arithmetic expression this decomposition determines a cover of its derivation tree by a set of subtrees with known syntactic properties. We define from this a recursive interpretation actor. Roughly speaking, for a given arithmetic expression, this interpreter creates one actor for each of the subtrees in its derivation tree decomposition, each created actor being in charge of local (i.e., concerning its own subtree only) parsing and semantic tasks which involve synchronization with the other actors.

Published in:

Computers, IEEE Transactions on  (Volume:C-35 ,  Issue: 3 )