{'fraction_non_alphanumeric': 0.024793388429752067, 'fraction_numerical': 0.004591368227731864, 'mean_word_length': 4.647668393782383, '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}}
Strategy for syntax error recovering

This paper describes a new strategy for syntax error recovering for a complier that does not have instruction separators like ‘;’ or opening and closing brackets like ‘{‘and ‘}’: This strategy is based on 4 steps. 1. Find set of tokens (called ACEPTA set) for each non terminal symbol of the grammar 2. During the syntax analysis of each non terminal symbol, eliminate the tokens that are not in the ACEPTA set. 3. Eliminate repeated tokens that are not accepted by the grammar, and 4. Complete symbols in the syntax analysis with the hope that the token that has not been erased later will match with a terminal symbol expected by the syntax analyzer; otherwise the symbol will be eliminated in some particular productions. The strategy for syntax error recovering is a method that can be used in whatever not ambiguous context free grammar including those that use instruction separators like ‘;’. It is implemented with an algorithm and it is much more easy to implement than other strategies for syntax error recovering like those based on stacks.