Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1109/TC.1986.1676748 | IEEE Trans. Computers |
Keywords | Field | DocType |
arithmetic infix grammar,arithmetic expression,decomposition schema,recursive interpretation actor,syntactic property,semantic task,asynchronous parallel interpreter,own subtree,derivation tree decomposition,arithmetic expressions,derivation tree,time measurement,concurrent computing,branching process,distributed systems,fixed point arithmetic,upper bound,distribution functions,distributed computing | S-attributed grammar,Expression (mathematics),Computer science,Tree decomposition,Parallel computing,Tree (data structure),Theoretical computer science,Parsing,Syntax,Parenthesis,Recursion | Journal |
Volume | Issue | ISSN |
35 | 3 | 0018-9340 |
Citations | PageRank | References |
5 | 0.54 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francois Baccelli | 1 | 812 | 86.80 |
| P. Mussi | 2 | 5 | 0.54 |