The Primordial Soup Algorithm: a systematic approach to the specification of parallel parsers

Authors:
Wil Janssen;Mannes Poel;Klaas Sikkel;Job Zwiers
Affiliations:
University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands
Venue:
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Year:
1992

Citing 3
Cited 1

An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm

Communications of the ACM
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory

A bibliography on parallel parsing

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general framework for parallel parsing is presented, which allows for a unified, systematic approach to parallel parsing. The Primordial Soup Algorithm creates trees by allowing partial parse trees to combine arbitrarily. By adding constraints to the general algorithm, a large class of parallel parsing strategies can be defined. This is exemplified by CYK, (bottom-up) Earley and de Vreught & Honig parsers. From such a parsing strategy algorithms for various machine architectures can be derived in a systematic way.