This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation
March 1986 (vol. 35 no. 3)
pp. 245-256
F. Baccelli, INRIA, Domaine de Voluceau Rocquencourt
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.
Index Terms:
stochastic grammars, Branching process, distributed systems, parallel compiling, paraDlel parsing, performance evaluation
Citation:
F. Baccelli, P. Mussi, "An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation," IEEE Transactions on Computers, vol. 35, no. 3, pp. 245-256, March 1986, doi:10.1109/TC.1986.1676748
Usage of this product signifies your acceptance of the Terms of Use.