Premium
Lattice structure segmentation of ALGOL‐like programs
Author(s) -
Kawai Satoru
Publication year - 1979
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.4380090608
Subject(s) - merge (version control) , computer science , segmentation , tree structure , usable , lattice (music) , data structure , scheme (mathematics) , programming language , theoretical computer science , market segmentation , algorithm , artificial intelligence , parallel computing , mathematics , physics , mathematical analysis , world wide web , acoustics , marketing , business
Abstract A segmentation scheme for ALGOL‐like programs is presented. This scheme, based on the separate compilation facility of the language ALGOL 68C, enables the programmers to use a branch‐and‐merge (lattice) structure in segmenting their programs, besides the tree which is the only one structure usable in ALGOL 68C programming. The necessity of this scheme is explained and the way of its implementation is described. The effectiveness of this scheme compared with tree structure segmentation is shown in terms of the recompilation cost of an example program of reasonably large size which has been resegmented from the tree to the lattice structure with no addition or duplication of codes.