Generalization of the language version determination problem

  • Authors:
  • K. C. Wong

  • Affiliations:
  • -

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we generalize the language version determination problem by relaxing the assumption of version subset relationship. The search algorithms proposed for the generalized problem involve constant search time using a hash table to implement the search for language versions. The hash table stores version features and their corresponding versions containing them. Maintaining the hash table is done by inserting newly developed versions in the version lists corresponding to those features newly added and those contained in the versions from which the new versions are developed, excluding the features being deleted.