From f9621483a0caeb49512bf4d15420bd05ea57cb22 Mon Sep 17 00:00:00 2001 From: bringert Date: Wed, 20 Dec 2006 20:10:15 +0000 Subject: Use LCLR algorithm for eliminating left-recursion, with lambda terms in SISR for getting trees right. --- src/GF/Speech/CFGToFiniteState.hs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/GF/Speech/CFGToFiniteState.hs') diff --git a/src/GF/Speech/CFGToFiniteState.hs b/src/GF/Speech/CFGToFiniteState.hs index cb32ff73e..47ad4b7fe 100644 --- a/src/GF/Speech/CFGToFiniteState.hs +++ b/src/GF/Speech/CFGToFiniteState.hs @@ -76,7 +76,7 @@ makeRegular g = groupProds $ concatMap trSet (mutRecCats True g) | otherwise = concatMap handleCat csl where csl = Set.toList cs rs = catSetRules g cs - handleCat c = [CFRule c' [] (mkName (c++"-empty"))] -- introduce A' -> e + handleCat c = [CFRule c' [] (mkCFTerm (c++"-empty"))] -- introduce A' -> e ++ concatMap (makeRightLinearRules c) (catRules g c) where c' = newCat c makeRightLinearRules b' (CFRule c ss n) = -- cgit v1.2.3