Rai, S and Shankar, P (2003) Efficient statistical modeling for the compression of tree structured intermediate code. In: Computer Journal, 46 (5). pp. 476-486.
![[img]](http://eprints.iisc.ac.in/style/images/fileicons/application_pdf.png) |
PDF
Efficient_Statistical.pdf - Published Version Restricted to Registered users only Download (156kB) | Request a copy |
Official URL: http://comjnl.oxfordjournals.org/content/46/5/476....
Abstract
We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.
| Item Type: | Journal Article |
|---|---|
| Publication: | Computer Journal |
| Publisher: | Oxford University Press |
| Additional Information: | Copyright of this article belongs to Oxford University Press. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 19 Aug 2011 06:50 |
| Last Modified: | 19 Aug 2011 06:50 |
| URI: | http://eprints.iisc.ac.in/id/eprint/40033 |
Actions (login required)
 |
View Item |
