Regular Language from a CFG

Salvador Cavadini <scavadini@ucse.edu.ar>
12 May 2002 00:09:27 -0400

          From comp.compilers
Related articles
Regular Language from a CFG scavadini@ucse.edu.ar (Salvador Cavadini) (2002-05-12)
| List of all articles for this month |
From: Salvador Cavadini <scavadini@ucse.edu.ar>
Newsgroups: comp.compilers
Date: 12 May 2002 00:09:27 -0400
Organization: Compilers Central
Keywords: syntax, theory, question
Posted-Date: 12 May 2002 00:09:27 EDT

Hi


On 11 Mar 2002, ANDREI Stefan <stefan@infoiasi.ro> in "Re: Definition
of a regular grammar" wrote:


>Theorem. "The language generated by a context free grammar over
>a set of terrminals with only one letter in the terminal alphabet
>is regular."


Can anyone point me an algorithm to find the regular language (RE, RG
or FSA) from a CFG over a set of terrminals with only one letter in
the terminal alphabet?


thanks
 


Salvador V. Cavadini
Centro de Investigación y Desarrollo de Software
Facultad de Matemática Aplicada
Universidad Católica de Santiago del Estero (Argentina)
www.ucse.edu.ar/fma/sepa

Post a followup to this message

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