{'fraction_non_alphanumeric': 0.014230271668822769, 'fraction_numerical': 0.0, 'mean_word_length': 4.908396946564886, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Automatic Generation of Test Cases

The machine production of programs for testing certain aspects of programming products has been achieved. The system has been successfully used on a number of products to establish their reliability in accepting new test cases without error. The input to the system is a syntax definition in a formal notation. The construction of such a definition for a high-level language is an exacting task. It yields important bonuses by deepening knowledge of the structure of the language and showing up obscurities or ambiguities in the existing documentation, Definitions exist for ECMA Algol, FORTRAN IV, and a major subset of PL/I. The future effort required to adapt the definitions to particular versions of these languages should be small.