|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use org.inxar.syntacs.grammar.regular | |
com.inxar.syntacs.automaton.finite | Defines classes which implement determinitic finite automata and their construction. |
com.inxar.syntacs.grammar.regular | Defines classes which implement regular-expression based grammars. |
com.inxar.syntacs.translator.regexp | Defines classes which implement a Translator for regular
expressions. |
org.inxar.syntacs.automaton.finite | Declares interfaces which model and support deterministic finite automata. |
org.inxar.syntacs.grammar.regular | Declares interfaces which model regular-expression based grammars. |
Classes in org.inxar.syntacs.grammar.regular used by com.inxar.syntacs.automaton.finiteRegularSet
|
The RegularSet interface is an optimized version of
the RegularGrammar object generally used by
DFA construction algorithms. |
Classes in org.inxar.syntacs.grammar.regular used by com.inxar.syntacs.grammar.regularCharClass
|
The CharClass interface is another 'utility' interface
for assembling complex Unions .CharString
|
The CharString interface is a 'utility' regex object
that takes care of the work of concatenating individual intervals.Closure
|
The Closure interface is the abstraction for the
Kleene closure construct ('*').Concatenation
|
The Concatenation interface is the abstraction for the
fundamental concatenation regular construct.Epsilon
|
The Epsilon interface represents the abstract symbol
for 'e', the pattern which matches the empty string.ExpressionTerminator
|
The ExpressionTerminator interface describes a special
pseudo-abstract object that symbolizes the end of a particular
regular expression.Interval
|
The Interval interface abstracts a contiguous bounded
block of characters.Option
|
The Option interface is another 'utility' regex which
abstracts the '?' operator.PositiveClosure
|
The PositiveClosure interface is a 'utility'
RegularExpression which makes it easier to build more
complex concatenation::Kleene closure constructs like
aa* .RegularExpression
|
The RegularExpression interface is a base interface
for all specific RegularExpression constructs.RegularGrammar
|
The RegularGrammar interface represents a factory for
generating regular expressions, typically for the purpose of
constructing RegularTokens .RegularSet
|
The RegularSet interface is an optimized version of
the RegularGrammar object generally used by
DFA construction algorithms.RegularToken
|
The RegularToken interface describes a Token which is
specifically described using a RegularExpression .Union
|
The Union interface is an abstraction over the
RegularExpression alternation object classically known
syntactically by the pipe '|'. |
Classes in org.inxar.syntacs.grammar.regular used by com.inxar.syntacs.translator.regexpRegularExpression
|
The RegularExpression interface is a base interface
for all specific RegularExpression constructs.RegularGrammar
|
The RegularGrammar interface represents a factory for
generating regular expressions, typically for the purpose of
constructing RegularTokens . |
Classes in org.inxar.syntacs.grammar.regular used by org.inxar.syntacs.automaton.finiteRegularSet
|
The RegularSet interface is an optimized version of
the RegularGrammar object generally used by
DFA construction algorithms. |
Classes in org.inxar.syntacs.grammar.regular used by org.inxar.syntacs.grammar.regularCharClass
|
The CharClass interface is another 'utility' interface
for assembling complex Unions .CharString
|
The CharString interface is a 'utility' regex object
that takes care of the work of concatenating individual intervals.Closure
|
The Closure interface is the abstraction for the
Kleene closure construct ('*').Concatenation
|
The Concatenation interface is the abstraction for the
fundamental concatenation regular construct.Epsilon
|
The Epsilon interface represents the abstract symbol
for 'e', the pattern which matches the empty string.Interval
|
The Interval interface abstracts a contiguous bounded
block of characters.Option
|
The Option interface is another 'utility' regex which
abstracts the '?' operator.PositiveClosure
|
The PositiveClosure interface is a 'utility'
RegularExpression which makes it easier to build more
complex concatenation::Kleene closure constructs like
aa* .RegularExpression
|
The RegularExpression interface is a base interface
for all specific RegularExpression constructs.RegularGrammar
|
The RegularGrammar interface represents a factory for
generating regular expressions, typically for the purpose of
constructing RegularTokens .RegularSet
|
The RegularSet interface is an optimized version of
the RegularGrammar object generally used by
DFA construction algorithms.RegularToken
|
The RegularToken interface describes a Token which is
specifically described using a RegularExpression .Union
|
The Union interface is an abstraction over the
RegularExpression alternation object classically known
syntactically by the pipe '|'. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |