{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0, 'mean_word_length': 5.443037974683544, '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}}
Regex Parsons: Using Horizontal Parsons Problems to Scaffold Learning Regex

Regular expressions (regex) are a popular text processing method used in programming. They are widely used in data analysis, web scraping, and input validation, and are supported by all mainstream programming languages. However, both students and even professional programmers perceive writing regex as difficult. Meanwhile, Parsons problems are a type of code completion problem used for introductory level programming education, and they can be a more efficient way to practice programming. Since regex is also a formal language, we created a horizontal version of Parsons problems to support teaching regex. We present results from an evaluation study in a MOOC comparing solving Parsons regex problems versus traditional regex problems. A higher percentage of students in the Parsons condition completed the practice and posttest. There was no significant difference in the learning gain from pretest to posttest between the conditions.