msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

BinTree vs. FiniteMap

Browse Source
This commit is contained in:
aarne
2005-05-30 17:39:43 +00:00
parent fc70965de3
commit 46e796f7cf
16 changed files with 155 additions and 166 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/GF/UseGrammar/Generate.hs
View File

@@ -5,9 +5,9 @@
-- Stability : (stable)
-- Portability : (portable)
--
-- > CVS $Date: 2005/04/21 16:23:46 $
-- > CVS $Author: bringert $
-- > CVS $Revision: 1.14 $
-- > CVS $Date: 2005/05/30 18:39:44 $
-- > CVS $Author: aarne $
-- > CVS $Revision: 1.15 $
--
-- Generate all trees of given category and depth. AR 30\/4\/2004
--
@@ -101,7 +101,7 @@ generate gr ifm cat i mn mt = case mt of
allTrees = genAll i
-- dynamic generation
genAll :: Int -> BinTree (SCat,[[STree]])
genAll :: Int -> BinTree SCat [[STree]]
genAll i = iter i genNext (mapTree (\ (c,_) -> (c,[[]])) gr)
iter 0 f tr = tr
@@ -126,7 +126,7 @@ generate gr ifm cat i mn mt = case mt of
SMeta k -> gen k
_ -> [t]
type SGrammar = BinTree (SCat,[SRule])
type SGrammar = BinTree SCat [SRule]
type SIdent = String
type SRule = (SFun,SType)
type SType = ([SCat],SCat)