Why could the DFA constructed in most compiler books recognize all the pefixes of a CFL?

Volition2k@yahoo.com (Tim Carmack)
30 Sep 2003 23:56:32 -0400

          From comp.compilers
Related articles
Why could the DFA constructed in most compiler books recognize all t Volition2k@yahoo.com (2003-09-30)
Re: Why could the DFA constructed in most compiler books recognize all venkatesha.murthy@windriver.com (Venkatesha Murthy) (2003-10-04)
Re: Why could the DFA constructed in most compiler books recognize all Volition2k@yahoo.com (2003-10-08)
Re: Why could the DFA constructed in most compiler books recognize all Volition2k@yahoo.com (2003-10-12)
| List of all articles for this month |
From: Volition2k@yahoo.com (Tim Carmack)
Newsgroups: comp.compilers
Date: 30 Sep 2003 23:56:32 -0400
Organization: Compilers Central
Keywords: parse, theory, question
Posted-Date: 30 Sep 2003 23:56:32 EDT

I have read many textbooks on compiling theory and all of them
teach me how to construct a DFA to recognize all viable prefixes
of a CFL but without strict proof concerning why all these prefixes
constitute a regualr language and the DFA constructed could recognize
this regular language. Even the dragon book fails to prove this.


Could any friends give me a cocrete proof of this? I feel this
is important for a student to understand the LR algorithm.


Post a followup to this message

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