Compiling Regular Patterns to Sequential Machines

Many programming languages have a pattern matching construct that can be generalized to deal with regular expressions. In this paper, we give a formal model of the shortest match and derive our algorithms from it. This model is based on the metaphor that binding to a variable can be seen as tagging parts of the input with the variable to which they are bound.


    • LAMP-REPORT-2004-009

    Record created on 2006-01-24, modified on 2017-05-12

Related material