Regular Expressions
- Formalism to describe certain formal languages (regular languages, type
3, Chomsky
1956)
- Can be implemented with finite state automata
- Very widely used in text search and pattern matching
- Matching:
- as a test
- to extract the matching piece
- to extract the pieces before or after the markup
- to extract some parts of the match
- Substitution:
- to replace the match with something else
