Re: Grammar analysis

"Alexey Demakov" <demakov@ispras.ru>
28 Nov 2004 23:20:17 -0500

          From comp.compilers
Related articles
Grammar analysis vbdis@aol.com (2004-11-20)
Re: Grammar analysis lhp+news@toft-hp.dk (Lasse =?ISO-8859-1?Q?Hiller=F8e?= Petersen) (2004-11-26)
Re: Grammar analysis demakov@ispras.ru (Alexey Demakov) (2004-11-28)
Re: Grammar analysis vbdis@aol.com (2004-11-29)
Re: Grammar analysis lhp+news@toft-hp.dk (Lasse =?ISO-8859-1?Q?Hiller=F8e?= Petersen) (2004-12-01)
Re: Grammar analysis vbdis@aol.com (2004-12-01)
| List of all articles for this month |
From: "Alexey Demakov" <demakov@ispras.ru>
Newsgroups: comp.compilers
Date: 28 Nov 2004 23:20:17 -0500
Organization: Compilers Central
References: 04-11-090
Keywords: parse, theory
Posted-Date: 28 Nov 2004 23:20:17 EST

From: "VBDis" <vbdis@aol.com>
> I'm just about to implement an grammar analyzer, and wonder about some
> of the algorithms described in the according literature.
>
> The computation of the First and Follow sets is not trivial,
> nonetheless I don't understand the "repeat until nothing changes"
> loops. Are these abbreviations of otherwise higher order algorithms,
> or did I miss newer and more straight algorithms?


It means that computation of set is finished when a number of elements
stops to increase after some step of algorithm.


Regards,
Alexey


-----
Alexey Demakov
TreeDL: Tree Description Language: http://treedl.sourceforge.net
RedVerst Group: http://www.unitesk.com


Post a followup to this message

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