Upper Bounds for Speedup in Parallel Parsing

DOI10.1145/322307.322316MaRDI QIDQ3936224zbMATH OpenOpenAlexFDO

Authors Jacques Cohen, Timothy J. Hickey, Joel Katcoff

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)

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936224)