{-# LANGUAGE DeriveDataTypeable #-}

module Grammars where

import Data.Data (Data, Typeable)
import Data.List.NonEmpty (NonEmpty)
import Data.Set (Set)
import qualified Data.Set as Set

import qualified Data.Text as Text
import Data.Text (Text)

newtype NonTerminal =
    NonTerminal Text
    deriving (NonTerminal -> NonTerminal -> Bool
(NonTerminal -> NonTerminal -> Bool)
-> (NonTerminal -> NonTerminal -> Bool) -> Eq NonTerminal
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: NonTerminal -> NonTerminal -> Bool
$c/= :: NonTerminal -> NonTerminal -> Bool
== :: NonTerminal -> NonTerminal -> Bool
$c== :: NonTerminal -> NonTerminal -> Bool
Eq, Eq NonTerminal
Eq NonTerminal
-> (NonTerminal -> NonTerminal -> Ordering)
-> (NonTerminal -> NonTerminal -> Bool)
-> (NonTerminal -> NonTerminal -> Bool)
-> (NonTerminal -> NonTerminal -> Bool)
-> (NonTerminal -> NonTerminal -> Bool)
-> (NonTerminal -> NonTerminal -> NonTerminal)
-> (NonTerminal -> NonTerminal -> NonTerminal)
-> Ord NonTerminal
NonTerminal -> NonTerminal -> Bool
NonTerminal -> NonTerminal -> Ordering
NonTerminal -> NonTerminal -> NonTerminal
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: NonTerminal -> NonTerminal -> NonTerminal
$cmin :: NonTerminal -> NonTerminal -> NonTerminal
max :: NonTerminal -> NonTerminal -> NonTerminal
$cmax :: NonTerminal -> NonTerminal -> NonTerminal
>= :: NonTerminal -> NonTerminal -> Bool
$c>= :: NonTerminal -> NonTerminal -> Bool
> :: NonTerminal -> NonTerminal -> Bool
$c> :: NonTerminal -> NonTerminal -> Bool
<= :: NonTerminal -> NonTerminal -> Bool
$c<= :: NonTerminal -> NonTerminal -> Bool
< :: NonTerminal -> NonTerminal -> Bool
$c< :: NonTerminal -> NonTerminal -> Bool
compare :: NonTerminal -> NonTerminal -> Ordering
$ccompare :: NonTerminal -> NonTerminal -> Ordering
Ord, Int -> NonTerminal -> ShowS
[NonTerminal] -> ShowS
NonTerminal -> String
(Int -> NonTerminal -> ShowS)
-> (NonTerminal -> String)
-> ([NonTerminal] -> ShowS)
-> Show NonTerminal
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [NonTerminal] -> ShowS
$cshowList :: [NonTerminal] -> ShowS
show :: NonTerminal -> String
$cshow :: NonTerminal -> String
showsPrec :: Int -> NonTerminal -> ShowS
$cshowsPrec :: Int -> NonTerminal -> ShowS
Show)

newtype Terminal =
    Terminal Text
    deriving (Terminal -> Terminal -> Bool
(Terminal -> Terminal -> Bool)
-> (Terminal -> Terminal -> Bool) -> Eq Terminal
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Terminal -> Terminal -> Bool
$c/= :: Terminal -> Terminal -> Bool
== :: Terminal -> Terminal -> Bool
$c== :: Terminal -> Terminal -> Bool
Eq, Eq Terminal
Eq Terminal
-> (Terminal -> Terminal -> Ordering)
-> (Terminal -> Terminal -> Bool)
-> (Terminal -> Terminal -> Bool)
-> (Terminal -> Terminal -> Bool)
-> (Terminal -> Terminal -> Bool)
-> (Terminal -> Terminal -> Terminal)
-> (Terminal -> Terminal -> Terminal)
-> Ord Terminal
Terminal -> Terminal -> Bool
Terminal -> Terminal -> Ordering
Terminal -> Terminal -> Terminal
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Terminal -> Terminal -> Terminal
$cmin :: Terminal -> Terminal -> Terminal
max :: Terminal -> Terminal -> Terminal
$cmax :: Terminal -> Terminal -> Terminal
>= :: Terminal -> Terminal -> Bool
$c>= :: Terminal -> Terminal -> Bool
> :: Terminal -> Terminal -> Bool
$c> :: Terminal -> Terminal -> Bool
<= :: Terminal -> Terminal -> Bool
$c<= :: Terminal -> Terminal -> Bool
< :: Terminal -> Terminal -> Bool
$c< :: Terminal -> Terminal -> Bool
compare :: Terminal -> Terminal -> Ordering
$ccompare :: Terminal -> Terminal -> Ordering
Ord, Int -> Terminal -> ShowS
[Terminal] -> ShowS
Terminal -> String
(Int -> Terminal -> ShowS)
-> (Terminal -> String) -> ([Terminal] -> ShowS) -> Show Terminal
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Terminal] -> ShowS
$cshowList :: [Terminal] -> ShowS
show :: Terminal -> String
$cshow :: Terminal -> String
showsPrec :: Int -> Terminal -> ShowS
$cshowsPrec :: Int -> Terminal -> ShowS
Show)

type CfgString = [Either Terminal NonTerminal]

-- |The type of a context-free production. The left and right items correspond respectively to the left and right hand sides of a production rule.
type CfgProduction = (NonTerminal, CfgString)

-- |The type of a context-free grammar. On the left the starting non-terminal, and on the right is the set of productions in the grammar.
type ContextFree = (NonTerminal, Set CfgProduction)

-- |The type of a distfix precedence production.
--
-- Int parameters are precedences.
--
-- NonEmpty Text parameters are lists of terminal symbols expressed as strings.
-- A particular data constructor implies a corresponding interspersal pattern of non-terminals in the terminal list when the production is interpreted.
-- For example,
--
-- > Infixl 1 (fromList ["?", ":"])
-- corresponds to the left-associative production, E -> E ? E : E.
data PrecedenceProduction
    = Prefix Int (NonEmpty Text)
    | Postfix Int (NonEmpty Text)
    | Infixl Int (NonEmpty Text)
    | Infixr Int (NonEmpty Text)
    | Closed (NonEmpty Text)
    deriving (PrecedenceProduction -> PrecedenceProduction -> Bool
(PrecedenceProduction -> PrecedenceProduction -> Bool)
-> (PrecedenceProduction -> PrecedenceProduction -> Bool)
-> Eq PrecedenceProduction
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c/= :: PrecedenceProduction -> PrecedenceProduction -> Bool
== :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c== :: PrecedenceProduction -> PrecedenceProduction -> Bool
Eq, Eq PrecedenceProduction
Eq PrecedenceProduction
-> (PrecedenceProduction -> PrecedenceProduction -> Ordering)
-> (PrecedenceProduction -> PrecedenceProduction -> Bool)
-> (PrecedenceProduction -> PrecedenceProduction -> Bool)
-> (PrecedenceProduction -> PrecedenceProduction -> Bool)
-> (PrecedenceProduction -> PrecedenceProduction -> Bool)
-> (PrecedenceProduction
    -> PrecedenceProduction -> PrecedenceProduction)
-> (PrecedenceProduction
    -> PrecedenceProduction -> PrecedenceProduction)
-> Ord PrecedenceProduction
PrecedenceProduction -> PrecedenceProduction -> Bool
PrecedenceProduction -> PrecedenceProduction -> Ordering
PrecedenceProduction
-> PrecedenceProduction -> PrecedenceProduction
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: PrecedenceProduction
-> PrecedenceProduction -> PrecedenceProduction
$cmin :: PrecedenceProduction
-> PrecedenceProduction -> PrecedenceProduction
max :: PrecedenceProduction
-> PrecedenceProduction -> PrecedenceProduction
$cmax :: PrecedenceProduction
-> PrecedenceProduction -> PrecedenceProduction
>= :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c>= :: PrecedenceProduction -> PrecedenceProduction -> Bool
> :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c> :: PrecedenceProduction -> PrecedenceProduction -> Bool
<= :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c<= :: PrecedenceProduction -> PrecedenceProduction -> Bool
< :: PrecedenceProduction -> PrecedenceProduction -> Bool
$c< :: PrecedenceProduction -> PrecedenceProduction -> Bool
compare :: PrecedenceProduction -> PrecedenceProduction -> Ordering
$ccompare :: PrecedenceProduction -> PrecedenceProduction -> Ordering
Ord, Int -> PrecedenceProduction -> ShowS
[PrecedenceProduction] -> ShowS
PrecedenceProduction -> String
(Int -> PrecedenceProduction -> ShowS)
-> (PrecedenceProduction -> String)
-> ([PrecedenceProduction] -> ShowS)
-> Show PrecedenceProduction
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [PrecedenceProduction] -> ShowS
$cshowList :: [PrecedenceProduction] -> ShowS
show :: PrecedenceProduction -> String
$cshow :: PrecedenceProduction -> String
showsPrec :: Int -> PrecedenceProduction -> ShowS
$cshowsPrec :: Int -> PrecedenceProduction -> ShowS
Show, Typeable, Typeable PrecedenceProduction
Typeable PrecedenceProduction
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g)
    -> PrecedenceProduction
    -> c PrecedenceProduction)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c PrecedenceProduction)
-> (PrecedenceProduction -> Constr)
-> (PrecedenceProduction -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c PrecedenceProduction))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c PrecedenceProduction))
-> ((forall b. Data b => b -> b)
    -> PrecedenceProduction -> PrecedenceProduction)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r)
-> (forall u.
    (forall d. Data d => d -> u) -> PrecedenceProduction -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> PrecedenceProduction -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> PrecedenceProduction -> m PrecedenceProduction)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> PrecedenceProduction -> m PrecedenceProduction)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> PrecedenceProduction -> m PrecedenceProduction)
-> Data PrecedenceProduction
PrecedenceProduction -> Constr
PrecedenceProduction -> DataType
(forall b. Data b => b -> b)
-> PrecedenceProduction -> PrecedenceProduction
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u.
Int -> (forall d. Data d => d -> u) -> PrecedenceProduction -> u
forall u.
(forall d. Data d => d -> u) -> PrecedenceProduction -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c PrecedenceProduction
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g)
-> PrecedenceProduction
-> c PrecedenceProduction
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c PrecedenceProduction)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c PrecedenceProduction)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> PrecedenceProduction -> m PrecedenceProduction
gmapQi :: forall u.
Int -> (forall d. Data d => d -> u) -> PrecedenceProduction -> u
$cgmapQi :: forall u.
Int -> (forall d. Data d => d -> u) -> PrecedenceProduction -> u
gmapQ :: forall u.
(forall d. Data d => d -> u) -> PrecedenceProduction -> [u]
$cgmapQ :: forall u.
(forall d. Data d => d -> u) -> PrecedenceProduction -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> PrecedenceProduction -> r
gmapT :: (forall b. Data b => b -> b)
-> PrecedenceProduction -> PrecedenceProduction
$cgmapT :: (forall b. Data b => b -> b)
-> PrecedenceProduction -> PrecedenceProduction
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c PrecedenceProduction)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c PrecedenceProduction)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c PrecedenceProduction)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c PrecedenceProduction)
dataTypeOf :: PrecedenceProduction -> DataType
$cdataTypeOf :: PrecedenceProduction -> DataType
toConstr :: PrecedenceProduction -> Constr
$ctoConstr :: PrecedenceProduction -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c PrecedenceProduction
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c PrecedenceProduction
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g)
-> PrecedenceProduction
-> c PrecedenceProduction
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g)
-> PrecedenceProduction
-> c PrecedenceProduction
Data)

-- |The type of a distfix precedence grammar. The following must be true of any parameter to `Aasam.m`.
--
--      * All precedences must be positive integers.
--      * No initial word may also be a subsequent word of another production.
--      * No initial sequence of words may also be the whole sequence of another production.
--      * No precedence of a production of one fixity may also be the precedence of a production of another fixity.
--      * The set of precedences must be either empty or the set of integers between 1 and greatest precedence, inclusive.
type Precedence = Set PrecedenceProduction