|Verification that a CFL is LL(1) / SLR firstname.lastname@example.org (Avi Tal) (2000-04-01)|
|Re: Verification that a CFL is LL(1) / SLR email@example.com (2000-04-03)|
|Re: Verification that a CFL is LL(1) / SLR firstname.lastname@example.org (Charles E. Bortle, Jr.) (2000-04-05)|
|From:||Avi Tal <email@example.com>|
|Date:||1 Apr 2000 14:12:49 -0500|
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 ?
Return to the
Search the comp.compilers archives again.