Re: polynomial evaluation in GF(2) and common subexpression elimination

"drizzle" <drizzle76@gmail.com>
23 Jun 2005 22:05:50 -0400

          From comp.compilers

Related articles
polynomial evaluation in GF(2) and common subexpression elimination panneton@hotmail.com (rng) (2005-06-21)
Re: polynomial evaluation in GF(2) and common subexpression eliminatio DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2005-06-23)
Re: polynomial evaluation in GF(2) and common subexpression eliminatio drizzle76@gmail.com (drizzle) (2005-06-23)
Re: polynomial evaluation in GF(2) and common subexpression eliminatio emailamit@gmail.com (Amit Gupta) (2005-06-24)
Re: polynomial evaluation in GF(2) and common subexpression eliminatio cfc@shell01.TheWorld.com (Chris F Clark) (2005-06-26)
| List of all articles for this month |

From: "drizzle" <drizzle76@gmail.com>
Newsgroups: comp.compilers
Date: 23 Jun 2005 22:05:50 -0400
Organization: http://groups.google.com
References: 05-06-101
Keywords: optimize

Your problem is not a case for common subexpression elimination but
rather it is similar to the problem of instruction selection. A simple
adaptation of that might be useful in your case. If you refer to any
compiler textbook say for example Andrew Appel, you will find that
instruction selection is about finding minimum cost cover for a tree.
In other words, represent your input as a tree of simplest units and
then find instructions to cover single or multiple nodes belonging to
the tree. In case you are more familiar with logic circuits, the same
technique (tree matching) is used to find a minimal cost cover using
components from a library for a digital circuit represented using
simplest gates. ( refer Hatchel and somenzi or any good digital design
book)


Post a followup to this message

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