forked from GitHub/gf-core
28 lines
963 B
Haskell
28 lines
963 B
Haskell
----------------------------------------------------------------------
|
|
-- |
|
|
-- Module : GF.Speech.PrRegExp
|
|
--
|
|
-- This module prints a grammar as a regular expression.
|
|
-----------------------------------------------------------------------------
|
|
|
|
module GF.Speech.PrRegExp (regexpPrinter,multiRegexpPrinter) where
|
|
|
|
import GF.Grammar.CFG
|
|
import GF.Speech.CFGToFA
|
|
import GF.Speech.PGFToCFG
|
|
import GF.Speech.RegExp
|
|
import PGF2
|
|
|
|
regexpPrinter :: PGF -> Concr -> String
|
|
regexpPrinter pgf cnc = (++"\n") $ prRE id $ dfa2re $ cfgToFA $ pgfToCFG pgf cnc
|
|
|
|
multiRegexpPrinter :: PGF -> Concr -> String
|
|
multiRegexpPrinter pgf cnc = prREs $ mfa2res $ cfgToMFA $ pgfToCFG pgf cnc
|
|
|
|
prREs :: [(String,RE CFSymbol)] -> String
|
|
prREs res = unlines [l ++ " = " ++ prRE id (mapRE showLabel re) | (l,re) <- res]
|
|
where showLabel = symbol (\l -> "<" ++ l ++ ">") id
|
|
|
|
mfa2res :: MFA -> [(String,RE CFSymbol)]
|
|
mfa2res (MFA _ dfas) = [(l, minimizeRE (dfa2re dfa)) | (l,dfa) <- dfas]
|