Package laser.regularlanguage.util

Utility classes commonly useful for regular languages (RLs).

See:
          Description

Interface Summary
RLFactory<L extends LabelInterface> The RLFactory interface provides helper methods for converting between FSAs and REs.
 

Class Summary
AbstractRegularLanguages<L extends LabelInterface> The AbstractRegularLanguages class contains various methods for manipulating regular languages (RLs) represented as REs and FSAs.
AbstractREtoDFAVisitor<L extends LabelInterface> The AbstractREtoDFAVisitor class allows an RE with a right end MarkerNode to be visited.
DefaultRLFactory<L extends LabelInterface> The DefaultRLFactory class helps users to convert between FSAs and REs.
FSAtoREConverter<L extends LabelInterface> The FSAtoREConverter class converts from the given FSA to the corresponding RE.
GNFA<L extends LabelInterface> The GNFA class represents a generalized nondeterministic finite automaton (GNFA).
MarkerNode<L extends LabelInterface> MarkerNode is the special end of regular expression node that is needed in the RE to DFA algorithm.
RegularLanguages<L extends LabelInterface> The RegularLanguages class contains various methods for manipulating regular languages (RLs) represented as REs and FSAs.
REtoDFABuilder<L extends LabelInterface> The REtoDFABuilder class builds a Deterministic Finite State Automaton (DFA) from the given (basic) Regular Expresion (RE).
REtoDFAConverter<L extends LabelInterface> The REtoDFAConverter class converts from the given RE to its corresponding DFA.
REtoDFAInfo The REtoDFAInfo class contains the information needed for the RE to DFA algorithm.
REtoDFAInfoPrinter<L extends LabelInterface> The REtoDFAInfoPrinter class for each TreeNode within the RE parse tree prints out its associated REToDFAInfo Object.
REtoDFAParser<L extends LabelInterface> The REtoDFAParser class converts from the input RE to its corresponding DFA.
REtoFSAConverter<L extends LabelInterface> The REtoFSAParser class converts from the given RE to the corresponding FSA.
REtoFSAParser<L extends LabelInterface> The REtoFSAParser class reads in the given RE from the specified input and converts the RE to the corresponding FSA.
REtoNFAConverter<L extends LabelInterface> The REtoNFAConverter class converts from a basic Regular Expression (RE) to a Non-Deterministic Finite State Automaton (NFA).
StringFSAtoREConverter The StringFSAtoREParser class converts from each input FSA to its corresponding RE.
StringREtoDFAParser The StringREtoDFAParser class converts from each input RE to its corresponding DFA.
StringREtoFSAParser The StringREtoFSAParser class converts from each input RE to its corresponding FSA.
StringRLFactory The StringRLFactory class helps users to convert between FSAs and REs that use StringLabels.
 

Package laser.regularlanguage.util Description

Utility classes commonly useful for regular languages (RLs).

The AbstractRegularLanguages class contains the utility methods commonly useful for RLs. See both Aho et. al. and Sipser for the high-level algorithms.

REFERENCES

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Massachusetts. 1986.

Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 20 Park Plaza, Boston, Massachusetts 02116. 1997.