Optimal parallel parsing of bracket languages

DOI10.1016/0304-3975(87)90070-3zbMath0628.68063OpenAlexW2139106437MaRDI QIDQ1093379

Wojciech Rytter, Raffaele Giancarlo

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/60781/12/WRAP_cs-rr-085.pdf

zbMATH Keywords

tree compressionparallel random access machineoptimal parallel algorithmbracket context-free languages

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (3)

Parallel recognition and ranking of context-free languages ⋮ Efficient parallel and incremental parsing of practical context-free languages ⋮ On optimal parallel computations for sequences of brackets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
• On the complexity of parallel parsing of general context-free languages
• Bracket-languages are recognizable in logarithmic space
• Optimal parallel generation of a computation tree form
• Parallelism in random access machines

This page was built for publication: Optimal parallel parsing of bracket languages