Parallel parsing of programming languages
From MaRDI portal
Publication:1094886
DOI10.1016/0020-0255(87)90031-4zbMath0631.68071OpenAlexW1996734455MaRDI QIDQ1094886
Publication date: 1987
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(87)90031-4
parallel algorithmsprogramming languagessyntaxdeterministic context-free languagesparallel parsinghierarchical language specificationsparallel random-access machinesemi-Dyck sets
Related Items
Almost fully-parallel parentheses matching ⋮ Parallel recognition and ranking of context-free languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new parallel algorithm for parsing arithmetic infix expressions
- Parallel Generation of Postfix and Tree Forms
- Optimal parallel generation of a computation tree form
- A Multiprocessing Approach to Compile-Time Symbol Resolution
- A parallel algorithm for the minimization of finite state automata
- New Parallel-Sorting Schemes
This page was built for publication: Parallel parsing of programming languages