Grammar analysis

vbdis@aol.com (VBDis)
20 Nov 2004 21:39:51 -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: vbdis@aol.com (VBDis)
Newsgroups: comp.compilers
Date: 20 Nov 2004 21:39:51 -0500
Organization: AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com
Keywords: parse, question
Posted-Date: 20 Nov 2004 21:39:51 EST

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?


DoDi

Post a followup to this message

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