> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.B (isB, isBM, isLB, isLBM, isTLB, isTLBM) where
> import qualified Data.Set as Set
> import LTK.FSA
> import LTK.Algebra
> import LTK.Tiers (project)
>
> isB :: (Ord n, Ord e) => FSA n e -> Bool
> isB :: FSA n e -> Bool
isB = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isBM (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
>
> isBM :: (Ord n, Ord e) => SynMon n e -> Bool
> isBM :: SynMon n e -> Bool
isBM SynMon n e
m = 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) 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
>
> isLB :: (Ord n, Ord e) => FSA n e -> Bool
> isLB :: FSA n e -> Bool
isLB = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLBM (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
>
> isLBM :: (Ord n, Ord e) => SynMon n e -> Bool
> isLBM :: SynMon n e -> Bool
isLBM SynMon n e
m = (T [Maybe n] e -> Bool) -> Set (T [Maybe n] e) -> Bool
forall (s :: * -> *) a. Collapsible s => (a -> Bool) -> s a -> Bool
allS T [Maybe n] e -> Bool
f (SynMon n e -> Set (T [Maybe n] e)
forall e n. (Ord e, Ord n) => FSA n e -> Set (State n)
states SynMon n e
m)
> where f :: T [Maybe n] e -> Bool
f T [Maybe n] e
x = Set (T [Maybe n] e) -> Bool
forall a. Set a -> Bool
Set.null (SynMon n e -> T [Maybe n] e -> Set (T [Maybe n] e)
forall n e. (Ord n, Ord e) => FSA (S n e) e -> T n e -> Set (T n e)
ese SynMon n e
m T [Maybe n] e
x Set (T [Maybe n] e) -> Set (T [Maybe n] e) -> Set (T [Maybe n] e)
forall a. Ord a => Set a -> Set a -> Set a
`Set.difference` Set (T [Maybe n] e)
i)
> i :: Set (T [Maybe n] e)
i = Set (T [Maybe n] e) -> Set (T [Maybe n] e) -> Set (T [Maybe n] e)
forall a. Ord a => Set a -> Set a -> Set a
Set.union (SynMon n e -> Set (T [Maybe n] e)
forall n e. FSA n e -> Set (State n)
initials SynMon n e
m) (SynMon n e -> Set (T [Maybe n] e)
forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
m)
>
> isTLB :: (Ord n, Ord e) => FSA n e -> Bool
> isTLB :: FSA n e -> Bool
isTLB = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLBM (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 (FSA n e -> SynMon n e)
-> (FSA n e -> FSA n e) -> FSA n e -> SynMon n e
forall b c a. (b -> c) -> (a -> b) -> a -> c
. FSA n e -> FSA n e
forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
> isTLBM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTLBM :: SynMon n e -> Bool
isTLBM = SynMon n e -> Bool
forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isLBM (SynMon n e -> Bool)
-> (SynMon n e -> SynMon n e) -> SynMon n e -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SynMon n e -> SynMon n e
forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project