|Grammar analysis email@example.com (2004-11-20)|
|Re: Grammar analysis firstname.lastname@example.org (Lasse =?ISO-8859-1?Q?Hiller=F8e?= Petersen) (2004-11-26)|
|Re: Grammar analysis email@example.com (Alexey Demakov) (2004-11-28)|
|Re: Grammar analysis firstname.lastname@example.org (2004-11-29)|
|Re: Grammar analysis email@example.com (Lasse =?ISO-8859-1?Q?Hiller=F8e?= Petersen) (2004-12-01)|
|Re: Grammar analysis firstname.lastname@example.org (2004-12-01)|
|Date:||1 Dec 2004 23:17:32 -0500|
|Organization:||AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com|
|Posted-Date:||01 Dec 2004 23:17:32 EST|
"Alexey Demakov" <email@example.com> schreibt:
>It means that computation of set is finished when a number of elements
>stops to increase after some step of algorithm.
I know what it means, but doesn't this suggest that the order of the
algorithm itself could be reduced? Such algorithms smell like brute
force to me, try and try and try ... until you succeed.
[No, it's guaranteed to converge. -John]
Return to the
Search the comp.compilers archives again.