This paper describes a scheme for compressing programs written in a particular programming language—which can be any language that has a formal lexical and syntactic description—in such a way that they can be reproduced exactly. Only syntactically correct programs can be compressed. The scheme is illustrated on the Pascal language, and compression results are given for a corpus of Pascal programs; but it is by no means restricted to Pascal. In fact, we discuss how a "compressor-generator" program can be constructed that creates a compressor automatically from a formal specification of a programming language, in much the same way as a parser generator creates a syntactic parser from a formal language description
It has been a matter of convenience that language codes have utilized statistical aspects of easily ...
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) a...
Abstract: Extended introduction in data compression problems is given in the paper. It is ...
This paper describes a scheme for compressing programs written in a particular programming language—...
The talk focused on a grammar-based technique for identifying redundancy in program code and taking ...
Data compression, the reduction in size of the physical representation of data being stored or trans...
The emergence of computers and their operating systems caused the transmition and storing huge amoun...
In recent years there has been an increasing trend towards the incorporation of computers into a var...
This paper describes a system for compressed code generation. The code of applications is partioned ...
Code-size reduction is an important area of investigation for computer system developers due to the ...
The best general-purpose compression schemes make their gains by estimating a probability distributi...
AbstractThis paper extends the usual notion of abstract program size complexity, studied by Kolmogor...
International audienceThe originality of this work leads in tackling text compression using an unsup...
Dictionary-based compression algorithms include a parsing strategy to transform the input text into ...
Parsing is the process of analysing an input string in order to extract a structured representation ...
It has been a matter of convenience that language codes have utilized statistical aspects of easily ...
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) a...
Abstract: Extended introduction in data compression problems is given in the paper. It is ...
This paper describes a scheme for compressing programs written in a particular programming language—...
The talk focused on a grammar-based technique for identifying redundancy in program code and taking ...
Data compression, the reduction in size of the physical representation of data being stored or trans...
The emergence of computers and their operating systems caused the transmition and storing huge amoun...
In recent years there has been an increasing trend towards the incorporation of computers into a var...
This paper describes a system for compressed code generation. The code of applications is partioned ...
Code-size reduction is an important area of investigation for computer system developers due to the ...
The best general-purpose compression schemes make their gains by estimating a probability distributi...
AbstractThis paper extends the usual notion of abstract program size complexity, studied by Kolmogor...
International audienceThe originality of this work leads in tackling text compression using an unsup...
Dictionary-based compression algorithms include a parsing strategy to transform the input text into ...
Parsing is the process of analysing an input string in order to extract a structured representation ...
It has been a matter of convenience that language codes have utilized statistical aspects of easily ...
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) a...
Abstract: Extended introduction in data compression problems is given in the paper. It is ...