removed src for 2.9

1 files changed, 0 insertions, 98 deletions

diff --git a/src/GF/Parsing/CFG/PInfo.hs b/src/GF/Parsing/CFG/PInfo.hs
deleted file mode 100644
index f877b225e..000000000
--- a/src/GF/Parsing/CFG/PInfo.hs
+++ /dev/null
@@ -1,98 +0,0 @@
----------------------------------------------------------------------
--- |
--- Maintainer  : PL
--- Stability   : (stable)
--- Portability : (portable)
---
--- > CVS $Date: 2005/05/09 09:28:45 $ 
--- > CVS $Author: peb $
--- > CVS $Revision: 1.5 $
---
--- CFG parsing, parser information
------------------------------------------------------------------------------
-
-module GF.Parsing.CFG.PInfo
-    (CFParser, CFPInfo(..), buildCFPInfo) where
-
-import GF.System.Tracing
-import GF.Infra.Print
-
-import GF.Formalism.Utilities
-import GF.Formalism.CFG
-import GF.Data.SortedList
-import GF.Data.Assoc
-
-----------------------------------------------------------------------
--- type declarations
-
--- | the list of categories = possible starting categories
-type CFParser c n t = CFPInfo c n t 
-		    -> [c]
-		    -> Input t
-		    -> CFChart c n t
-
-------------------------------------------------------------
--- parser information
-
-data CFPInfo c n t
-    = CFPInfo { grammarTokens        :: SList t,
-		nameRules            :: Assoc n            (SList (CFRule c n t)),
-		topdownRules         :: Assoc c            (SList (CFRule c n t)),
-		bottomupRules        :: Assoc (Symbol c t) (SList (CFRule c n t)),
-		emptyLeftcornerRules :: Assoc c            (SList (CFRule c n t)),
-		emptyCategories      :: Set c,
-		cyclicCategories     :: SList c,
-		-- ^ ONLY FOR DIRECT CYCLIC RULES!!!
-		leftcornerTokens     :: Assoc c (SList t)
-		-- ^ DOES NOT WORK WITH EMPTY RULES!!!
-	      }
-
-buildCFPInfo :: (Ord c, Ord n, Ord t) => CFGrammar c n t -> CFPInfo c n t
-
--- this is not permanent...
-buildCFPInfo grammar = traceCalcFirst grammar $
-		       tracePrt "CFG.PInfo - parser info" (prt) $
-		       pInfo' (filter (not . isCyclic) grammar)
-
-pInfo' grammar = CFPInfo grToks nmRules tdRules buRules elcRules emptyCats cyclicCats leftToks 
-    where grToks          = union [ nubsort [ tok | Tok tok <- rhs ] | 
-				    CFRule _ rhs _ <- grammar ]
-	  nmRules         = accumAssoc id [ (name, rule) | 
-					    rule@(CFRule _ _ name) <- grammar ]
-	  tdRules         = accumAssoc id [ (cat,  rule) | 
-					    rule@(CFRule cat _ _) <- grammar ]
-	  buRules         = accumAssoc id [ (next, rule) | 
-					    rule@(CFRule _ (next:_) _) <- grammar ]
-	  elcRules        = accumAssoc id $ limit lc emptyRules
-	  leftToks        = accumAssoc id $ limit lc $ 
-			    nubsort [ (cat, token) | 
-				      CFRule cat (Tok token:_) _ <- grammar ]
-	  lc (left, res)  = nubsort [ (cat, res)   | 
-				      CFRule cat _ _ <- buRules ? Cat left ]
-	  emptyRules      = nubsort [ (cat, rule)  | 
-				      rule@(CFRule cat [] _) <- grammar ]
-	  emptyCats       = listSet $ limitEmpties $ map fst emptyRules
-	  limitEmpties es = if es==es' then es else limitEmpties es'
-	      where es'   = nubsort [ cat | CFRule cat rhs _ <- grammar, 
-				      all (symbol (\e -> e `elem` es) (const False)) rhs ]
-	  cyclicCats      = nubsort [ cat | CFRule cat [Cat cat'] _ <- grammar, cat == cat' ]
-
-isCyclic (CFRule cat [Cat cat'] _) = cat==cat'
-isCyclic _ = False
-
-
-----------------------------------------------------------------------
--- pretty-printing of statistics
-
-instance (Ord c, Ord n, Ord t) => Print (CFPInfo c n t) where
-    prt pI = "[ tokens=" ++ sl grammarTokens ++
-	     "; names=" ++ sla nameRules ++ 
-	     "; tdCats=" ++ sla topdownRules ++
-	     "; buCats=" ++ sla bottomupRules ++ 
-	     "; elcCats=" ++ sla emptyLeftcornerRules ++
-	     "; eCats=" ++ sla emptyCategories ++
-	     -- "; cCats=" ++ sl cyclicCategories ++
-	     -- "; lctokCats=" ++ sla leftcornerTokens ++ 
-	     " ]"
-	where sla f = show $ length $ aElems $ f pI
-	      sl  f = show $ length $ f pI