On Parsing and Compiling Arithmetic Expressions on Vector Computers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An event-driven compiling technique
Communications of the ACM
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)
ACM '78 Proceedings of the 1978 annual conference
Formal languages and their relation to automata
Formal languages and their relation to automata
Model, Design, and Evaluation of a Compiler for a Parallel Processing Environment
IEEE Transactions on Software Engineering
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
HPar: A practical parallel parser for HTML--taming HTML complexities for parallel parsing
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 14.98 |
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.