A Functional Program for Regular Expressions Matching

Abstract of Invited Talk
  • Thomas Wilke
Conference paper

DOI: 10.1007/978-3-642-22321-1_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Wilke T. (2011) A Functional Program for Regular Expressions Matching. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

Abstract

Regular expressions [4] and tools to handle them, especially tools for regular expression matching—an early one is described in the seminal paper [5] by Ken Thompson—, are one of the major achievements of formal language and automata theory. Google counts 303,000 results for “regular expressions matching” (May 4, 2011); there are numerous command line tools for working with regular expressions such as grep; Google released a regular expression C++ library not long ago [3]; almost every programming language provides support for regular expressions; and even the text editor I am using to produce the source code of this LaTeX document has an extensive regular expression library.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas Wilke
    • 1
  1. 1.Institut für InformatikChristian-Albrechts-Universität zu KielGermany

Personalised recommendations