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) |
From: | vannoord@let.rug.nl |
Newsgroups: | comp.compilers |
Date: | 7 Sep 2004 23:56:51 -0400 |
Organization: | Rijksuniversiteit Groningen |
References: | 04-09-035 |
Keywords: | parse |
Posted-Date: | 07 Sep 2004 23:56:51 EDT |
Lorin Netsch <netsch@ti.com> wrote:
> Can anyone tell me how to determine if a given CFG can be represented
> as a regular grammar?
this problem is undecidable
GJ
--
Gertjan van Noord Alfa-informatica, RUG, Postbus 716, 9700 AS Groningen
vannoord at let dot rug dot nl http://www.let.rug.nl/~vannoord
Return to the
comp.compilers page.
Search the
comp.compilers archives again.