Parallel parsing on the connection machine

DOI10.1016/0020-0190(89)90217-2zbMath0673.68048OpenAlexW1987327679MaRDI QIDQ1121034

David T. Barnard, David B. Skillicorn

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90217-2

zbMATH Keywords

parsingconnection machinelexing algorithm of HillisLL(1) grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Theory of software (68N99)

Related Items

Parallel \(LL\) parsing ⋮ Parallel recognition and ranking of context-free languages ⋮ Pipelining tree-structured algorithms on SIMD architectures ⋮ An NC algorithm for recognizing tree adjoining languages ⋮ Systolic parsing of context-free languages

Cites Work

• Upper Bounds for Speedup in Parallel Parsing
• Syntax-Directed Transduction
• Notes on top-down languages
• On the translation of languages from left to right
• Unnamed Item