Related articles |
---|
[8 earlier articles] |
Re: predictive parsing and non-recursive predictive parsing ang.usenet@gmail.com (Aaron Gray) (2008-06-27) |
Re: predictive parsing and non-recursive predictive parsing torbenm@pc-003.diku.dk (2008-06-27) |
Re: predictive parsing and non-recursive predictive parsing kamalpr@hp.com (kamal) (2008-06-27) |
Re: predictive parsing and non-recursive predictive parsing max@gustavus.edu (Max Hailperin) (2008-06-28) |
Re: predictive parsing and non-recursive predictive parsing DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-06-28) |
Re: predictive parsing and non-recursive predictive parsing ang.usenet@gmail.com (Aaron Gray) (2008-06-28) |
Re: predictive parsing and non-recursive predictive parsing max@gustavus.edu (Max Hailperin) (2008-06-28) |
Re: predictive parsing and non-recursive predictive parsing torbenm@pc-003.diku.dk (2008-06-30) |
Re: predictive parsing and non-recursive predictive parsing ang.usenet@gmail.com (Aaron Gray) (2008-06-30) |
From: | Max Hailperin <max@gustavus.edu> |
Newsgroups: | comp.compilers |
Date: | Sat, 28 Jun 2008 19:05:25 -0500 |
Organization: | Compilers Central |
References: | 08-06-053 08-06-055 08-06-061 08-06-071 08-06-074 08-06-075 |
Keywords: | parse |
Posted-Date: | 29 Jun 2008 11:05:09 EDT |
Hans-Peter Diettrich <DrDiettrich1@aol.com> writes:
>> A -> B c
>> A -> D e
>> B -> f f f f f
>> D -> f f f f f
> ... When the language, and consequently also the
> grammar is converted into LL(1), by swapping the terms in A ...
Actually the language already was LL(1), though the grammar wasn't.c
Return to the
comp.compilers page.
Search the
comp.compilers archives again.