Verification that a CFL is LL(1) / SLR

Avi Tal <avi.tal@altavista.net>
1 Apr 2000 14:12:49 -0500

          From comp.compilers
Related articles
Verification that a CFL is LL(1) / SLR avi.tal@altavista.net (Avi Tal) (2000-04-01)
Re: Verification that a CFL is LL(1) / SLR torbenm@diku.dk (2000-04-03)
Re: Verification that a CFL is LL(1) / SLR cbrtjr@ix.netcom.com (Charles E. Bortle, Jr.) (2000-04-05)
| List of all articles for this month |
From: Avi Tal <avi.tal@altavista.net>
Newsgroups: comp.compilers
Date: 1 Apr 2000 14:12:49 -0500
Organization: Compilers Central
Keywords: parse, LL(1)

I would like to know if there are methods to verify the following:
1. Given an unambiguous CFL, how do we verify that it has an LL(1) grammar
? / an SLR grammar?
2. Are there algorithms to convert an unambiguous CFG to LL(1) ? / SLR ?
Thanks.
Avi.

Post a followup to this message

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