|Regular Language firstname.lastname@example.org (2000-07-23)|
|Re: Regular Language email@example.com (2000-07-27)|
|Re: Regular Language firstname.lastname@example.org (2000-07-29)|
|Date:||27 Jul 2000 21:38:46 -0400|
|Organization:||Deja.com - Before you buy.|
I suppose if you can show that the language grammar has a production
of the form
where B and C are non-terminals you have your proof. Regular
languages have to have no more than a single non terminal on
either side in any production in the grammar, going by
email@example.com (Thomaspan2000) wrote:
> Currently, I use lex and yacc to write a parser for a C-like
> problem is I want to know whether it is regular or not. Since it
> if ...
> else if ...
> else ...
> it is not a regular language. But how to prove? I know lex and yacc
> LALR language and there is also a pumping lemma for regular sets. But
> prove one language is not regular language?
Return to the
Search the comp.compilers archives again.