Nothing Special   »   [go: up one dir, main page]

skip to main content
article

RegeXeX: an interactive system providing regular expression exercises

Published: 07 March 2007 Publication History

Abstract

This paper presents RegeXeX (Regular expression exercises), an interactive system for teaching students to write regular expressions. The system poses problems (prose descriptions of languages), students enter solutions (regular expressions defining these languages), and the system provides feedback. What is novel in this system is the type of feedback: students are not merely told that a submitted regular expression is wrong, they are given examples of strings that the expression either matches and shouldn't or does not match and should, and asked to try again. Additionally, student responses need only be equivalent to the solution, not identical. Results of classroom experience with this system are also reported, and demonstrate its effectiveness in teaching students to write regular expressions with little or no instructor interaction.RegeXeX is a freely available, portable system, written in C++ and using the Qt library for its GUI. It is distributed with several exercise sets, but is designed so instructors can easily write their own. The system logs student work and offers facilities for submitting log-files to instructors as well, allowing for automatic grading, or in-depth analysis of student performance and evolution of responses throughout the exercise set.

References

[1]
P. Azalov, M. Cullen, and R. Rinish. Reexpress: A tutor for regular expressions mentoring with technology. In Proceedings of SIGITE'04, page 268, October 2004.
[2]
S. Ohlson. Learning from performance errors. Psychological Review, 103(2):241--262, 1996.
[3]
S. H. Rodger, B. Bressler, T. Finley, and S. Reading. Turning automata theory into a hands-on course. In Proceedings of the 37th ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE 2006), Houston, Texas, pages 379--383. ACM Press, New York, 2006.

Cited By

View all
  • (2023)Using Micro Parsons Problems to Scaffold the Learning of Regular ExpressionsProceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 110.1145/3587102.3588853(457-463)Online publication date: 29-Jun-2023
  • (2021)Regex Parsons: Using Horizontal Parsons Problems to Scaffold Learning RegexProceedings of the 21st Koli Calling International Conference on Computing Education Research10.1145/3488042.3489968(1-3)Online publication date: 17-Nov-2021
  • (2018)Internet-Based Education: A New Milestone for Formal Language and Automata CoursesInformation Technology – New Generations10.1007/978-3-319-77028-4_28(195-200)Online publication date: 2018
  • Show More Cited By

Index Terms

  1. RegeXeX: an interactive system providing regular expression exercises

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 39, Issue 1
        March 2007
        581 pages
        ISSN:0097-8418
        DOI:10.1145/1227504
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCSE '07: Proceedings of the 38th SIGCSE technical symposium on Computer science education
          March 2007
          634 pages
          ISBN:1595933611
          DOI:10.1145/1227310
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 07 March 2007
        Published in SIGCSE Volume 39, Issue 1

        Check for updates

        Author Tags

        1. education
        2. regular expressions
        3. theory of computing

        Qualifiers

        • Article

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)3
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 25 Nov 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2023)Using Micro Parsons Problems to Scaffold the Learning of Regular ExpressionsProceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 110.1145/3587102.3588853(457-463)Online publication date: 29-Jun-2023
        • (2021)Regex Parsons: Using Horizontal Parsons Problems to Scaffold Learning RegexProceedings of the 21st Koli Calling International Conference on Computing Education Research10.1145/3488042.3489968(1-3)Online publication date: 17-Nov-2021
        • (2018)Internet-Based Education: A New Milestone for Formal Language and Automata CoursesInformation Technology – New Generations10.1007/978-3-319-77028-4_28(195-200)Online publication date: 2018
        • (2016)Buy one get one freeJournal of Computing Sciences in Colleges10.5555/2904446.290446931:6(90-96)Online publication date: 1-Jun-2016
        • (2015)Using ConceptGrid as an easy authoring technique to check natural language responsesInternational Journal of Learning Technology10.5555/2782683.278268610:1(50-70)Online publication date: 1-May-2015
        • (2007)Formal languages through web forms and regular expressionsACM SIGCSE Bulletin10.1145/1345375.134542439:4(100-104)Online publication date: 1-Dec-2007
        • (2024)Exploring a Self-Replication Algorithm to Flexibly Match PatternsIEEE Access10.1109/ACCESS.2024.335531912(13553-13570)Online publication date: 2024
        • (2014)Functional Automata - Formal Languages for Computer Science StudentsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.170.2170(19-32)Online publication date: 12-Dec-2014
        • (2009)Increasing engagement in automata theory with JFLAPACM SIGCSE Bulletin10.1145/1539024.150901141:1(403-407)Online publication date: 4-Mar-2009
        • (2009)Increasing engagement in automata theory with JFLAPProceedings of the 40th ACM technical symposium on Computer science education10.1145/1508865.1509011(403-407)Online publication date: 4-Mar-2009
        • Show More Cited By

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media