Regular Language (Thomaspan2000)
23 Jul 2000 16:53:04 -0400

          From comp.compilers

Related articles
Regular Language (2000-07-23)
Re: Regular Language (2000-07-27)
Re: Regular Language (2000-07-29)
| List of all articles for this month |

From: (Thomaspan2000)
Newsgroups: comp.compilers
Date: 23 Jul 2000 16:53:04 -0400
Organization: AOL
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
if ...
else if ...
else ...
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?


Post a followup to this message

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