Grammar-based compression of interpreted code

Communications of the ACM

Volumn 46, Issue 8, 2003, Pages 61-66

  Evans, William S ^a   Fraser, Christopher W ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYTECODES; HUFFMAN FIXED-TO-VARIABLE LENGTH CODING; PROBABILISTIC GRAMMAR; TUNSTALL VARIABLE-TO-FIXED LENGTH CODING;

C (PROGRAMMING LANGUAGE); COMPUTATIONAL GRAMMARS; COMPUTER SOFTWARE; CONTEXT FREE LANGUAGES; DATA COMPRESSION; DECODING; EMBEDDED SYSTEMS; ENCODING (SYMBOLS); HIGH LEVEL LANGUAGES; PROBABILITY; PROGRAM INTERPRETERS; RANDOM ACCESS STORAGE; REDUCED INSTRUCTION SET COMPUTING; ROM; TREES (MATHEMATICS);

BINARY CODES;

EID: 4243169130     PISSN: 00010782     EISSN: None     Source Type: Journal    
DOI: 10.1145/859670.859699     Document Type: Review

References (12)

1. Cameron, R.D. Source encoding using syntactic information models. IEEE Transactions on Information Theory 34, 4 (1988), 843-850.
2. Choueka, Y., Klein, S.T., and Perl, Y. Efficient variants of Huffman codes in high level languages. In Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1985), 122-130.
3. Clausen, L., Schultz, U., Consel, C., and Muller, G. Java bytecode compression for low-end embedded systems. ACM TOPLAS 22, 3 (May 2000), 471-489.
4. Ernst, J., Evans, W., Fraser, C.W., Lucco, S., and Proebsting, T.A. Code compression. In Proceedings of the ACM SIGPLAN'97 Conference on Programming Language Design and Implementation, 358-365.
5. Evans, W. and Fraser, C.W. Bytecode compression via profiled grammar rewriting. In Proceedings of the ACM SIGPLAN'01 Conference on Programming Language Design and Implementation, 148-155.
6. Hoogerbrugge, J., Augusteijn, L., Trum, J., and van de Weil, R. A code compression system based on pipelined interpreters. Software-Practice and Experience 29, 11 (1999), 1005-1023.
7. Latendresse, M. Automatic generation of compact programs and virtual machines for Scheme. In Proceedings of the Workshop on Scheme and Functional Programming 2000, 45-52.
8. Liao, S., Devadas, S., and Keutzer, K. A text-compression-based method for code size minimization in embedded systems. ACM Transactions on Design Automation of Electronic Systems 4, 1 (Jan. 1999), 12-38.
9. Proebsting, T.A. Optimizing an ANSI C interpreter with superoperators. In Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Jan. 1995), 322-332.
10. Stone, R.G. On the choice of grammar and parser for the compact analytical encoding of programs. Computer Journal 29, 4 (1986), 307-314.
11. Thompson, R.A. and Booth, T.L. Encoding of probabilistic contextfree languages. In Z. Kohavi and A. Paz, Eds, Theory of Machines and Computations. Academic Press, 1971.
12. Tunstall, B.P. Synthesis of Noiseless Compression Codes. Ph.D. dissertation, Georgia Institute of Technology, 1967.