Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!world!iecc!compilers-sender
From: sankar@Neon.Stanford.EDU (Sriram Sankar)
Newsgroups: comp.compilers
Subject: Looking for parsing references
Keywords: parse, question
Message-ID: <91-06-026@comp.compilers>
Date: 18 Jun 91 17:25:46 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: sankar@Neon.Stanford.EDU (Sriram Sankar)
Organization: Computer Science Department, Stanford University, Ca , USA
Lines: 25
Approved: compilers@iecc.cambridge.ma.us

Hello!

I'm interested in references/pointers and also your views and opinions
on the following:

1. Tools/algorithms for parsing of general context free grammars

2. LL-parsing tools/algorithms

3. Advantages and disadvantages of LL and LR parsing as compared to each
   other.

I'll post a summary if there is a good response and sufficient interest.

Please mail your response to sankar@cs.stanford.edu even if you think
your contribution is trivial.

Thank you very much.

Sriram.
[The only algorithm I know of for parsing general context-free grammars is
Earley's.  LL and LR(n) algorithms are too weak. -John]
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.