Re: epsilon-free grammar

Geoff Wozniak <gzw@home.com>
29 Sep 2001 11:00:47 -0400

          From comp.compilers
Related articles
epsilon-free grammar no_email@gmx.at (Jan Horner) (2001-09-26)
Re: epsilon-free grammar torbenm@gna.diku.dk (2001-09-29)
Re: epsilon-free grammar eernst@cs.auc.dk (Erik Ernst) (2001-09-29)
Re: epsilon-free grammar christian.bau@isltd.insignia.com (Christian Bau) (2001-09-29)
Re: epsilon-free grammar gzw@home.com (Geoff Wozniak) (2001-09-29)
Re: epsilon-free grammar adrian@sartre.cs.rhbnc.ac.uk (A Johnstone) (2001-09-30)
| List of all articles for this month |
From: Geoff Wozniak <gzw@home.com>
Newsgroups: comp.compilers
Date: 29 Sep 2001 11:00:47 -0400
Organization: Excite@Home - The Leader in Bankruptcy http://home.com/faster
References: 01-09-113
Keywords: parse, theory
Posted-Date: 29 Sep 2001 11:00:47 EDT

"Jan Horner" <no_email@gmx.at> writes:


> How can I get a EPSILON-free grammar (from a grammar)? I want to
> left-factorize that grammar. I'm reading the Aho-Sethi book but can
> find any solution.
>


There is an exercise (4.20) that addresses this problem. Basically,
you have to think about what nonterminals can end up going to the
epsilon production and go from there. (Hint: think in a bit of a
combinatorical manner)


--
Geoff(rey) Wozniak, Sessional Lecturer
University of Western Ontario
Computer Science Department
London, Ontario, Canada
http://woz.killdash9.org/


GPG Key: http://woz.killdash9.org/misc/woz.gpg

Post a followup to this message

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