{'fraction_non_alphanumeric': 0.03561253561253561, 'fraction_numerical': 0.0, 'mean_word_length': 5.113043478260869, '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}}
Left-most derivation and shadow-pushdown automata for context-sensitive languages

In this paper left-most derivation for context-sensitive grammars is presented based on Penttonen one-sided normal-form. The derivations using grammars in normal form are represented by tree-like graphs. Left-most derivation is defined in the sense of constructing the derivation graph. The concept of the well-known pushdown automata is generalised. A special-type of automata, the so-called shadow-pushdown automata are presented. The work of the automata is based on the left-most derivation of context-sensitive languages. The class of shadow-pushdown automata characterizes exactly the context-sensitive languages.