GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-04 08:42:50 -06:00
Code Issues Packages Projects Releases Wiki Activity

Added regexps grammar printer. This is a first step towards recursion-free SRGS.

Browse Source
This commit is contained in:
bringert
2007-06-20 16:08:23 +00:00
parent a029232eef
commit 13b8bab5fe
4 changed files with 21 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
src/GF/Speech/PrRegExp.hs
View File

@@ -8,7 +8,7 @@
-- This module prints a grammar as a regular expression.
-----------------------------------------------------------------------------
module GF.Speech.PrRegExp (regexpPrinter) where
module GF.Speech.PrRegExp (regexpPrinter,multiRegexpPrinter) where
import GF.Conversion.Types
import GF.Infra.Ident
@@ -20,3 +20,16 @@ import GF.Compile.ShellState (StateGrammar)
regexpPrinter :: Options -> StateGrammar -> String
regexpPrinter opts s = prRE $ dfa2re $ cfgToFA opts s
multiRegexpPrinter :: Options -> StateGrammar -> String
multiRegexpPrinter opts s = prREs $ mfa2res $ cfgToMFA opts s
prREs :: [(String,RE (MFALabel String))] -> String
prREs res = unlines [l ++ " = " ++ prRE (mapRE showLabel re) | (l,re) <- res]
where showLabel (MFASym s) = s
showLabel (MFASub l) = "<" ++ l ++ ">"
mfa2res :: MFA String -> [(String,RE (MFALabel String))]
mfa2res (MFA start dfas) =
[("START",f start)] ++ [(l,f dfa) | (l,dfa) <- dfas]
where f = minimizeRE . dfa2re