Premium
Syntax‐directed compression of program files
Author(s) -
Katajainen Jyrki,
Penttonen Martti,
Teuhola Jukka
Publication year - 1986
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380160307
Subject(s) - computer science , parsing , programming language , abstract syntax tree , syntax , symbol (formal) , prolog , encoder , compression (physics) , table (database) , data compression , representation (politics) , tree (set theory) , parse tree , abstract syntax , natural language processing , arithmetic , artificial intelligence , database , operating system , mathematics , mathematical analysis , materials science , politics , political science , law , composite material
Parsing can be applied to compress source programs. A suitably encoded parse tree, together with the symbol table, constitutes a very compact representation of the program. The paper reports a Prolog implementation of the method, including automatic, syntax‐directed, encoder and decoder generators. The test results show compression gains of 50–60 per cent.