Why the characterisitic language of a CFG is regular?

hajhossein81@yahoo.com (Hossein Hojjat)
2 Jul 2003 00:36:29 -0400

          From comp.compilers
Related articles
Why the characterisitic language of a CFG is regular? hajhossein81@yahoo.com (2003-07-02)
Re: Why the characterisitic language of a CFG is regular? Xavier.Nicollin@imag.fr (Xavier Nicollin) (2003-07-03)
| List of all articles for this month |
From: hajhossein81@yahoo.com (Hossein Hojjat)
Newsgroups: comp.compilers
Date: 2 Jul 2003 00:36:29 -0400
Organization: http://groups.google.com/
Keywords: parse, question
Posted-Date: 02 Jul 2003 00:36:29 EDT

Hi!


I've seen in the most of the compiler texts that the viable prefixes of
a CFG form a regular language.Then they attempt to build DFA/NFA for recognizing
this language, but the don't give a proof or an intuition why this language
is regular.Does anyone have an idea about the reason of this regularity?


Thanks


    Hossein Hojjat
  Tehran University,
Institute of Electrotechnique

Post a followup to this message

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