Re: Regular grammar from CFG?

vbdis@aol.com (VBDis)
8 Sep 2004 00:06:51 -0400

          From comp.compilers
Related articles
Regular grammar from CFG? netsch@ti.com (Lorin Netsch) (2004-09-03)
Re: Regular grammar from CFG? newsserver_mails@bodden.de (Eric Bodden) (2004-09-07)
Re: Regular grammar from CFG? vannoord@let.rug.nl (2004-09-07)
Re: Regular grammar from CFG? brosgol@worldDOTstd.com (Ben Brosgol) (2004-09-08)
Re: Regular grammar from CFG? vbdis@aol.com (2004-09-08)
Re: Regular grammar from CFG? friedrich.neurauter@eunet.at (Friedrich Neurauter) (2004-09-08)
Re: Regular grammar from CFG? cdc@maxnet.co.nz (Carl Cerecke) (2004-09-08)
Re: Regular grammar from CFG? neal.wang@gmail.com (2004-09-13)
Re: Regular grammar from CFG? scavadini@ucse.edu.ar (2004-09-13)
| List of all articles for this month |
From: vbdis@aol.com (VBDis)
Newsgroups: comp.compilers
Date: 8 Sep 2004 00:06:51 -0400
Organization: AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com
References: 04-09-035
Keywords: parse
Posted-Date: 08 Sep 2004 00:06:51 EDT

"Lorin Netsch" <netsch@ti.com> schreibt:


>Can anyone tell me how to determine if a given CFG can be represented
>as a regular grammar?


You may have a look at the thesis and related work of Cristina Çifuentes. She
describes how interval analysis can be used to determine whether a CFG is
reducible, and IMO this is what you want to determine?


DoDi


Post a followup to this message

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