> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.CB (isCB, isCBM, isCBs) where
> import Data.Representation.FiniteSemigroup
> import LTK.FSA
> import LTK.Algebra(SynMon)
>
> isCB :: (Ord n, Ord e) => FSA n e -> Bool
> isCB :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isCB = GeneratedAction -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isCBs (GeneratedAction -> Bool)
-> (FSA n e -> GeneratedAction) -> FSA n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> GeneratedAction
forall n e. (Ord n, Ord e) => FSA n e -> GeneratedAction
syntacticSemigroup
>
> isCBM :: (Ord n, Ord e) => SynMon n e -> Bool
> isCBM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isCBM = FSA ([Maybe n], [Symbol e]) e -> Bool
forall n e. (Ord n, Ord e) => FSA n e -> Bool
isCB
>
>
>
> isCBs :: FiniteSemigroupRep s => s -> Bool
> isCBs :: forall s. FiniteSemigroupRep s => s -> Bool
isCBs = (s -> Bool) -> (s -> Bool) -> s -> Bool
forall a. (a -> Bool) -> (a -> Bool) -> a -> Bool
both s -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isJTrivial s -> Bool
forall s. FiniteSemigroupRep s => s -> Bool
isBand