On the complexity of parallel parsing of general context-free languages
type: Item
instance of: scholarly article
title: On the complexity of parallel parsing of general context-free languages
zbMATH Open document ID: 0632.68081
DOI: 10.1016/0304-3975(86)90155-6
author: Wojciech Rytter
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
full work available at URL: WRAP cs-rr-075.pdf
review text: Let T(n) be the time to recognize context-free languages on a parallel random-access machine without write conflicts (P-RAM) using a polynomial number of processors. We assume that \(T(n)=\Omega (\log n)\). Let P(n) be the time to compute a representation of a parsing tree for strings of length n using a polynomial number of processors. Then we prove \(P(n)=O(T(n))\). A related result is a parallel time log n computation of the transitive closure of directed graphs having special structure.
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4028937
zbMATH Keywords: context-free languages
zbMATH Keywords: parallel random-access machine
zbMATH Keywords: parsing tree
zbMATH Keywords: transitive closure of directed graphs
MaRDI profile type: Publication
OpenAlex ID: W1990225380
cites work: Q4197337
cites work: Tree-size bounded alternation
cites work: Q3700838
cites work: Q3742751
cites work: Q3692896
cites work: An Efficient Parallel Biconnectivity Algorithm
description: scientific article; zbMATH DE number 4028937