The Library
On the complexity of parallel parsing of general context-free languages
Tools
Tools
Tools
Rytter, Wojciech (1986) On the complexity of parallel parsing of general context-free languages. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
|
PDF
WRAP_cs-rr-075.pdf - Other - Requires a PDF viewer. Download (586Kb) | Preview |
Abstract
Let T(n) be the time to recognize context-free languages on a parallel random access machine without write conflicts (PRAM) using a polynomial number of processors. We assume that T(n) = Q(log n). Let P(n) be the time to compute a representation of a parsing tree tor 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.
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Parsing (Computer grammar), Programming languages (Electronic computers) | ||||
| Series Name: | Department of Computer Science Research Report | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Place of Publication: | Coventry, UK | ||||
| Official Date: | April 1986 | ||||
| Dates: |
|
||||
| Number: | Number 75 | ||||
| Number of Pages: | 10 | ||||
| DOI: | CS-RR-075 | ||||
| Institution: | University of Warwick | ||||
| Theses Department: | Department of Computer Science | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
