> {-# OPTIONS_HADDOCK show-extensions #-}
>
> module LTK.Decide.Definite
> (
> isDef
> , isDefM
> , isRDef
> , isRDefM
>
> , isTDef
> , isTDefM
> , isTRDef
> , isTRDefM
> ) where
> import qualified Data.Set as Set
> import LTK.FSA
> import LTK.Algebra
> import LTK.Tiers (project)
>
>
> isDef :: (Ord n, Ord e) => FSA n e -> Bool
> isDef :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isDef = forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isDefM forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall e n.
(Ord e, Ord n) =>
FSA n e -> FSA ([Maybe n], [Symbol e]) e
syntacticMonoid
>
> isDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isDefM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isDefM SynMon n e
s = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all ((forall a. Eq a => a -> a -> Bool
==Int
1) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Set a -> Int
Set.size forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e.
(Ord n, Ord e) =>
FSA (n, [Symbol e]) e
-> State (n, [Symbol e]) -> Set (State (n, [Symbol e]))
primitiveIdealL SynMon n e
s)
> forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Set a -> [a]
Set.toList forall a b. (a -> b) -> a -> b
$ forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
s
>
>
> isRDef :: (Ord n, Ord e) => FSA n e -> Bool
> isRDef :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isRDef = forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isRDefM forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall e n.
(Ord e, Ord n) =>
FSA n e -> FSA ([Maybe n], [Symbol e]) e
syntacticMonoid
>
> isRDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isRDefM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isRDefM SynMon n e
s = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all ((forall a. Eq a => a -> a -> Bool
==Int
1) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Set a -> Int
Set.size forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e. (Ord n, Ord e) => FSA n e -> State n -> Set (State n)
primitiveIdealR SynMon n e
s)
> forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Set a -> [a]
Set.toList forall a b. (a -> b) -> a -> b
$ forall n e. (Ord n, Ord e) => FSA (n, [Symbol e]) e -> Set (T n e)
idempotents SynMon n e
s
>
> isTDef :: (Ord n, Ord e) => FSA n e -> Bool
> isTDef :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isTDef = forall n e. (Ord n, Ord e) => FSA n e -> Bool
isDef forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
> isTDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTDefM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isTDefM = forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isDefM forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
> isTRDef :: (Ord n, Ord e) => FSA n e -> Bool
> isTRDef :: forall n e. (Ord n, Ord e) => FSA n e -> Bool
isTRDef = forall n e. (Ord n, Ord e) => FSA n e -> Bool
isRDef forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project
>
> isTRDefM :: (Ord n, Ord e) => SynMon n e -> Bool
> isTRDefM :: forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isTRDefM = forall n e. (Ord n, Ord e) => SynMon n e -> Bool
isRDefM forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall n e. (Ord n, Ord e) => FSA n e -> FSA n e
project