chou@CS.UCLA.EDU (Ching-Tsun Chou) (10/16/90)
Does anyone know of any works, either theoretical or practical, on
parsing context-free languages with parallel algorithms?
I would greatly appreciate any pointers and will post a summary of responses.
Please mail your response to <chou@cs.ucla.edu>.
- Ching Tsun
[Ned Irons told me over 10 years ago that he looked at it and didn't find
much that he could speed up. Perhaps someone has had more luck since. -John]
--
Send compilers articles to compilers@esegue.segue.boston.ma.us
{ima | spdcc | world}!esegue. Meta-mail to compilers-request@esegue.rekers@cwi.nl (Jan Rekers) (10/16/90)
In article <1990Oct15.202912.12815@esegue.segue.boston.ma.us>, chou@CS.UCLA.EDU (Ching-Tsun Chou) writes: |> Does anyone know of any works, either theoretical or practical, on |> parsing context-free languages with parallel algorithms? Anton Nijholt made quite a study of parallel parsing algorithms. I have here three reports of him which all cover the subject. The best reference is maybe: R. op den Akker, H. Albas, A, Nijholt & P. Oude Luttighuis An annotated Bibliography on Parallel Parsing Memoranda Informatica 89-67, 1989 University of Twente, Dept. of Computer Science P.O. box 217 7500 AE Enschede the Netherlands Anton Nijholt can be reached by email: anijholt@utwente.nl Good luck! Jan Rekers (rekers@cwi.nl) Centrum voor Wiskunde en Informatica (CWI) P.O. Box 4079, 1009 AB Amsterdam, The Netherlands -- Send compilers articles to compilers@esegue.segue.boston.ma.us {ima | spdcc | world}!esegue. Meta-mail to compilers-request@esegue.