Path: utzoo!attcan!uunet!wuarchive!cs.utexas.edu!yale!mintaka!spdcc!ima!esegue!compilers-sender From: chou@CS.UCLA.EDU (Ching-Tsun Chou) Newsgroups: comp.compilers Subject: Parallel Parsing? Keywords: parse, parallel Message-ID: <1990Oct15.202912.12815@esegue.segue.boston.ma.us> Date: 15 Oct 90 19:15:11 GMT Sender: compilers-sender@esegue.segue.boston.ma.us Reply-To: chou@CS.UCLA.EDU (Ching-Tsun Chou) Organization: UCLA Computer Science Department Lines: 12 Approved: compilers@esegue.segue.boston.ma.us 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 . - 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.