> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.CB (isCB, isCBM) where
> import qualified Data.Set as Set
> import LTK.FSA
> import LTK.Algebra
>
> isCB :: (Ord n, Ord e) => FSA n e -> Bool
> isCB :: FSA n e -> Bool
isCB = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isCBM (SynMon n e -> Bool) -> (FSA n e -> SynMon n e) -> FSA n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> SynMon n e
forall e n.
(Ord e, Ord n) =>
FSA n e -> FSA ([Maybe n], [Symbol e]) e
syntacticMonoid
>
> isCBM :: (Ord n, Ord e) => SynMon n e -> Bool
> isCBM :: SynMon n e -> Bool
isCBM SynMon n e
m = (SynMon n e -> Set (Set (State ([Maybe n], [Symbol e]))))
-> SynMon n e -> Bool
forall n e. (FSA n e -> Set (Set (State n))) -> FSA n e -> Bool
trivialUnder SynMon n e -> Set (Set (State ([Maybe n], [Symbol e])))
forall e n.
(Ord e, Ord n) =>
FSA ([Maybe n], [Symbol e]) e
-> Set (Set (State ([Maybe n], [Symbol e])))
jEquivalence SynMon n e
m Bool -> Bool -> Bool
&& (Set (State ([Maybe n], [Symbol e]))
i Set (State ([Maybe n], [Symbol e]))
-> Set (State ([Maybe n], [Symbol e])) -> Bool
forall a. Eq a => a -> a -> Bool
== SynMon n e -> Set (State ([Maybe n], [Symbol e]))
forall e n. (Ord e, Ord n) => FSA n e -> Set (State n)
states SynMon n e
m)
> where i :: Set (State ([Maybe n], [Symbol e]))
i = Set (State ([Maybe n], [Symbol e]))
-> Set (State ([Maybe n], [Symbol e]))
-> Set (State ([Maybe n], [Symbol e]))
forall a. Ord a => Set a -> Set a -> Set a
Set.union (SynMon n e -> Set (State ([Maybe n], [Symbol e]))
forall n e. FSA n e -> Set (State n)
initials SynMon n e
m) (SynMon n e -> Set (State ([Maybe n], [Symbol e]))
forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
m)