{'fraction_non_alphanumeric': 0.01854974704890388, 'fraction_numerical': 0.0, 'mean_word_length': 5.347593582887701, '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}}
The Effects Of Local Variable Optimisation In A C-Based Stack Processor Environment

Stack based processors, traditionally associated with the FORTH language, have many advantages not reflected in contemporary RISC and CISC register file processors. However, current trends indicate that high level languages, such as C, may become important for future real time and distributed systems. If the advantages of stack processor hardware are to be retained, the issue of efficient HLL execution in a stack based context must be investigated. Local Variable management, and its efficient support in hardware, are a prime concern in developing efficient stack based computation for HLL's. Recent work by Phil Koopman has suggested that local variables may be virtually eliminated by compiler optimisation techniques. In this paper we present results from an initial investigation of Koopman`s intra-block algorithm and examine its impact on the data stack behaviour of compiled C, an area previously ignored. Consideration is also given to the application of generalised data scheduling in a FORTH context. The results are presented, and their implications for processor design are discussed.