| Related articles |
|---|
| Tree grammar venug@sasi.com (R Venugopal) (1997-12-10) |
| Re: Tree grammar anton@mips.complang.tuwien.ac.at (1997-12-12) |
| From: | R Venugopal <venug@sasi.com> |
| Newsgroups: | comp.compilers |
| Date: | 10 Dec 1997 00:46:29 -0500 |
| Organization: | Compilers Central |
| Keywords: | architecture, question |
Hi!
Do you know of any systematic procedure to write the
production rules of a tree grammar which specifies the instructions of
a new processor? It is intended that these production rules be used
as input by a tree pattern matching generator such as iburg to produce
a code selector for the processor. Also, is there any technique for
proving the soundness and completeness of the specified grammar with
respect to the architecture considered?
Venu.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.