Looking for parsing references

sankar@Neon.Stanford.EDU (Sriram Sankar)
Tue, 18 Jun 1991 17:25:46 GMT

          From comp.compilers
Related articles
Looking for parsing references sankar@Neon.Stanford.EDU (1991-06-18)
Re: Looking for parsing references mauney@eos.ncsu.edu (1991-06-20)
| List of all articles for this month |
Newsgroups: comp.compilers
From: sankar@Neon.Stanford.EDU (Sriram Sankar)
Keywords: parse, question
Organization: Computer Science Department, Stanford University, Ca , USA
Date: Tue, 18 Jun 1991 17:25:46 GMT

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]
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.