|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:||23 Jul 2000 16:53:04 -0400|
|Keywords:||question, parse, theory|
Currently, I use lex and yacc to write a parser for a C-like language. The
problem is I want to know whether it is regular or not. Since it contains
else if ...
it is not a regular language. But how to prove? I know lex and yacc generates
LALR language and there is also a pumping lemma for regular sets. But how to
prove one language is not regular language?
Return to the
Search the comp.compilers archives again.