System.RegularExpressions Module

The System.RegularExpressions contains a minimal implementation of a regular expression matching engine.

Example

This sgrep program searches a regular expression pattern from the given text files. The pattern is represented as an NFA . Names of files can contain wildcards * and ?.

Grammars

Regular Expression Lexical Grammar
Regular Expression Grammar

Namespaces

RexTokens
System
RegularExpressions

Files

System.RegularExpressions/Algorithm.cm
System.RegularExpressions/Context.cm
System.RegularExpressions/Match.cm
System.RegularExpressions/Nfa.cm
System.RegularExpressions/RexApi.cm
System.RegularExpressions/RexClassMap.cm
System.RegularExpressions/RexLexer.cm
System.RegularExpressions/RexLexer.lexer
System.RegularExpressions/RexParser.cm
System.RegularExpressions/RexParser.parser
System.RegularExpressions/RexTokens.cm
System.RegularExpressions/Symbol.cm
System.RegularExpressions/TokenValueParsers.cm

Classes

public static class RexClassMap
public class RexLexer
public static class RexParser