{'fraction_non_alphanumeric': 0.021636876763875823, 'fraction_numerical': 0.007525870178739417, 'mean_word_length': 5.37125748502994, '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}}
Some implications of APL order-of-execution rules

An implementation of APL is necessarily a rigid encoding of the rules of the language, including a de facto order in which expressions are evaluated. The order of execution is perceived in an APL program by the way in which side effects such as nested specification, specification of global variables within defined functions, and shared variable values affect the outcome of expressions.
 Concern about variation among implementations and distasteful results (see for example, “APL Problems with Order of Execution”, Clark Wiedmann, in the March 1978 issue of Quote Quad) led to a proposed definition for the order of evaluation of APL expressions which received general acceptance at an APL implementors' workshop at Minnowbrook in September 1977.
 The refined “right to left” evaluation rule is examined and compared with other possible choices, through the use of simple APL syntax analysis models, to determine its implications on storage requirements, computation requirements, and mathematical identities.