Translating linearization functions to Haskell: move a common record type to PGF.Haskell

Move the Haskell representation of the common linearization type {s:T} to the
shared module PGF.Haskell, so that the same overloaded projection function
proj_s can be used for all concrete syntaxes.
This commit is contained in:
hallgren
2015-01-19 12:43:32 +00:00
parent eab989c1d7
commit 240ba80209
2 changed files with 27 additions and 4 deletions

View File

@@ -38,11 +38,16 @@ concrete2haskell opts gr cenv absname cnc modinfo =
"--- Linearization types and linearization functions ---" $$ "--- Linearization types and linearization functions ---" $$
vcat (map ppDef defs) $$ "" $$ vcat (map ppDef defs) $$ "" $$
"--- Type classes for projection functions ---" $$ "--- Type classes for projection functions ---" $$
vcat (map labelClass (S.toList (S.unions (map S.fromList rs)))) $$ "" $$ vcat (map labelClass (S.toList labels)) $$ "" $$
"--- Record types ---" $$ "--- Record types ---" $$
vcat (map recordType rs) vcat (map recordType recs)
where where
rs = S.toList (S.insert [ident2label (identS "s")] (records rhss)) labels = S.difference (S.unions (map S.fromList recs)) common_labels
recs = S.toList (S.difference (records rhss) common_records)
common_records = S.fromList [[label_s]]
common_labels = S.fromList [label_s]
label_s = ident2label (identS "s")
rhss = map (snd.snd) defs rhss = map (snd.snd) defs
defs = sortBy (compare `on` fst) . defs = sortBy (compare `on` fst) .
concatMap (toHaskell gId gr absname cenv) . concatMap (toHaskell gId gr absname cenv) .

View File

@@ -1,10 +1,14 @@
-- | Auxiliary types and functions for use with grammars translated to Haskell -- | Auxiliary types and functions for use with grammars translated to Haskell
-- with gf -output-format=haskell -haskell=concrete -- with @gf -output-format=haskell -haskell=concrete@
{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, FlexibleInstances #-}
module PGF.Haskell where module PGF.Haskell where
import Control.Applicative((<$>))
import Data.Char(toUpper) import Data.Char(toUpper)
import Data.List(isPrefixOf) import Data.List(isPrefixOf)
import qualified Data.Map as M import qualified Data.Map as M
-- ** Concrete syntax
-- | For enumerating parameter values used in tables -- | For enumerating parameter values used in tables
class EnumAll a where enumAll :: [a] class EnumAll a where enumAll :: [a]
@@ -42,3 +46,17 @@ fromStr = from False False
toUpper1 s = s toUpper1 s = s
pick alts def r = head ([str|(ps,str)<-alts,any (`isPrefixOf` r) ps]++[def]) pick alts def r = head ([str|(ps,str)<-alts,any (`isPrefixOf` r) ps]++[def])
-- *** Common record types
-- | Overloaded function to project the @s@ field from any record type
class Has_s r a | r -> a where proj_s :: r -> a
-- | Haskell representation of the GF record type @{s:t}@
data R_s t = R_s t deriving (Eq,Ord,Show)
instance (EnumAll t) => EnumAll (R_s t) where
enumAll = (R_s <$> enumAll)
instance Has_s (R_s t) t where proj_s (R_s t) = t
-- | Coerce from any record type @{...,s:t,...}@ field to the supertype @{s:t}@
to_R_s r = R_s (proj_s r)