LTK.Parameters

Many subregular classes are parameterized. In some cases, we know not only how to decide membership, but also the values of these parameters. As a general interface, each parameterization function returns a Maybe [Parameter e], where Nothing means the language is not in the class and Just xs indicates for which parameters this membership holds. The interpretation of the list differs per class; consult the individual functions' documentation for more information.

All arguments should be given in minimal form. This is never checked.

Since: 1.2

Documentation

data Parameter e

A named parameter.

Constructors

PInt String Int

PSymSet String (Set e)

Instances

(Read e, Ord e) => Read (Parameter e)

Defined in LTK.Parameters

Methods

readsPrec :: Int -> ReadS (Parameter e)

readList :: ReadS [Parameter e]

readPrec :: ReadPrec (Parameter e)

readListPrec :: ReadPrec [Parameter e]

Show e => Show (Parameter e)

Defined in LTK.Parameters

Methods

showsPrec :: Int -> Parameter e -> ShowS

show :: Parameter e -> String

showList :: [Parameter e] -> ShowS

Eq e => Eq (Parameter e)

Defined in LTK.Parameters

Methods

(==) :: Parameter e -> Parameter e -> Bool

(/=) :: Parameter e -> Parameter e -> Bool

Ord e => Ord (Parameter e)

Defined in LTK.Parameters

Methods

compare :: Parameter e -> Parameter e -> Ordering

(<) :: Parameter e -> Parameter e -> Bool

(<=) :: Parameter e -> Parameter e -> Bool

(>) :: Parameter e -> Parameter e -> Bool

(>=) :: Parameter e -> Parameter e -> Bool

max :: Parameter e -> Parameter e -> Parameter e

min :: Parameter e -> Parameter e -> Parameter e

pTier :: (Ord n, Ord e) => (FSA n e -> Maybe [Parameter e]) -> FSA n e -> Maybe [Parameter e]

If there are neutral symbols, test a class and prepend to its parameters the set of salient symbols.

pDef :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the length of the longest relevant suffix.

pRDef :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the length of the longest relevant prefix.

pGDef :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the length of the longest relevant suffix or prefix, whichever is longer.

pCB :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Returns an empty parameter list.

pAcom :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the threshold at which symbol counting saturates.

pSL :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the length of the longest relevant substring.

pSP :: (Ord n, Ord e) => FSA n e -> Maybe [Parameter e]

Return the length of the longest relevant subsequence.