Optimal parallel parsing of bracket languages (Q1093379)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4022661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel parsing of bracket languages |
scientific article; zbMATH DE number 4022661 |
Statements
Optimal parallel parsing of bracket languages (English)
0 references
1987
0 references
We prove that the parsing problem for bracket context-free languages can be solved in log n time using n/log n processors on a parallel random access machine without write conflicts (P-RAM). On the way we develop a new general technique for tree compression based on the bracket structure of the tree.
0 references
optimal parallel algorithm
0 references
bracket context-free languages
0 references
parallel random access machine
0 references
tree compression
0 references
0 references
0.8693776726722717
0 references
0.8255743980407715
0 references
0.8247922658920288
0 references
