Q: CFG and regular languages

"Salvador Valerio Cavadini" <scavadini@ucse.edu.ar>
22 Sep 2002 12:22:23 -0400

          From comp.compilers
Related articles
Q: CFG and regular languages scavadini@ucse.edu.ar (Salvador Valerio Cavadini) (2002-09-22)
Re: Q: CFG and regular languages adrian@sartre.cs.rhbnc.ac.uk (A Johnstone) (2002-09-25)
Re: Q: CFG and regular languages hannah@schlund.de (Hannah Schroeter) (2002-09-25)
Re: Q: CFG and regular languages debray@CS.Arizona.EDU (Saumya K. Debray) (2002-09-25)
Re: Q: CFG and regular languages bonzini@gnu.org (Paolo Bonzini) (2002-09-29)
Re: Q: CFG and regular languages whopkins@alpha2.csd.uwm.edu (Mark) (2002-09-29)
| List of all articles for this month |
From: "Salvador Valerio Cavadini" <scavadini@ucse.edu.ar>
Newsgroups: comp.compilers
Date: 22 Sep 2002 12:22:23 -0400
Organization: Compilers Central
Keywords: parse, theory, question, comment
Posted-Date: 22 Sep 2002 12:22:23 EDT

Hi


I'm looking for an algorithm for determine if a context free grammar
generates a regular language. Any idea?


Thanks


--
Salvador Valerio Cavadini
Centro de Investigación y Desarrollo de Software (CIDESOFT)
Facultad de Matemática Aplicada
Universidad Católica de Santiago del Estero (Argentina)
email: scavadini@ucse.edu.ar
web: http://www.ucse.edu.ar/fma/staff/svcavadini
[Hmmn. Would it suffice to check that there's no direct or indirect
recursion in the rules? -John]

Post a followup to this message

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