Upper Bounds for Speedup in Parallel Parsing

DOI10.1145/322307.322316zbMath0478.68088OpenAlexW2080455139MaRDI QIDQ3936224

Joel Katcoff, Timothy J. Hickey, Jacques Cohen

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322307.322316

zbMATH Keywords

difference equationsparallelismbottom-up shift-reduce parsersfat-short treessynchronous multiprocessors

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (4)

Parallel parsing on the connection machine ⋮ Parallel recognition and ranking of context-free languages ⋮ An NC algorithm for recognizing tree adjoining languages ⋮ Systolic parsing of context-free languages

This page was built for publication: Upper Bounds for Speedup in Parallel Parsing