Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the empty string)

"dtf" <k301x@yahoo.com>
10 Aug 2004 17:36:31 -0400

From comp.compilers

Related articles
Question re the (non-)equivalence of Z -> z and Z -> z e (e the empty dhalitsky@cumulativeinquiry.com (2004-08-09)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em kwheinri@bsr2.uwaterloo.ca (Kenn Heinrich) (2004-08-10)
*Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em k301x@yahoo.com (dtf)* (2004-08-10)**
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em dhalitsky@cumulativeinquiry.com (2004-08-11)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em cppljevans@cox-internet.com (Larry Evans) (2004-08-11)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em kwheinri@bsr2.uwaterloo.ca (Kenn Heinrich) (2004-08-13)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em dhalitsky@cumulativeinquiry.com (2004-08-13)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em parsersinc@earthlink.net (SLK Parsers) (2004-08-15)
Re: Question re the (non-)equivalence of Z -> z and Z -> z e (e the em dhalitsky@cumulativeinquiry.com (2004-08-23)
[1 later articles]

| List of all articles for this month |

From:	"dtf" <k301x@yahoo.com>
Newsgroups:	comp.compilers
Date:	10 Aug 2004 17:36:31 -0400
Organization:	SLK Parser Generator
References:	04-08-046
Keywords:	parse, theory
Posted-Date:	10 Aug 2004 17:36:31 EDT

The empty string is not a terminal symbol in a grammar. It is a
representation of the lack of a symbol. So G == G'. Rewrite the productions
in yacc format to see the equivalence.

Post a followup to this message

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