

PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 
See:
Description
Interface Summary  

NFA.BigState<State>  Certain NFA transformations (ex: NFA.simplify() ) produce NFA s whose states are sets of
original states. 
Class Summary  

NFA<State,A>  NFA models a Nondeterministic Finite Automaton. 
RegExp<A>  RegExp models a regular expression. 
RegExp.Atomic<A>  Regular expression that matches only the 1length string consisting of exactly one specific symbol. 
RegExp.Concat<A>  Regular expression produced by concatenating two regular expressions. 
RegExp.EmptyStr<A>  Regular expressions that matches only the empty string. 
RegExp.None<A>  Regular expression that does not match any string. 
RegExp.Star<A>  The star regular expression. 
RegExp.Union<A>  The regular expression that matches any string matched by at least one of two specific regular expression. 
RegExp.Visitor<A,Res>  Instance of the visitor pattern for RegExp s. 
Classes that model regular expressions and NFAs.
Most of the RegExprelated packages are focused on efficiently parsing strings of characters; they usually take a regular expression and convert it into an NFA (a Nondeterministic Finite Automaton) and later into a DFA (a Deterministic Finite Automaton) that is used for parsing.
Instead, this package offers classes that are parametric in the input alphabet. Currently, the focus is on converting an NFA into a regular expression, but ultimately, we plan to cover the other direction too.
Where to start?
Future plans:


PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 