From ba13ff08d2dd38de9abdb8b59125b73471404d44 Mon Sep 17 00:00:00 2001 From: bringert Date: Thu, 30 Nov 2006 22:50:25 +0000 Subject: Added the beginnings of GFCC to JavaScript conversion. --- src/GF/Canon/CanonToGFCC.hs | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) (limited to 'src/GF/Canon/CanonToGFCC.hs') diff --git a/src/GF/Canon/CanonToGFCC.hs b/src/GF/Canon/CanonToGFCC.hs index 32e608f6b..8c8ceaa77 100644 --- a/src/GF/Canon/CanonToGFCC.hs +++ b/src/GF/Canon/CanonToGFCC.hs @@ -12,7 +12,7 @@ -- GFC to GFCC compiler. AR Aug-Oct 2006 ----------------------------------------------------------------------------- -module GF.Canon.CanonToGFCC (prCanon2gfcc) where +module GF.Canon.CanonToGFCC (prCanon2gfcc, mkCanon2gfcc) where import GF.Canon.AbsGFC import qualified GF.Canon.GFC as GFC @@ -41,8 +41,10 @@ import Debug.Trace ---- -- the main function: generate GFCC from GFCM. prCanon2gfcc :: CanonGrammar -> String -prCanon2gfcc = - Pr.printTree . canon2gfcc . reorder . utf8Conv . canon2canon . normalize +prCanon2gfcc = Pr.printTree . prCanon2gfcc + +mkCanon2gfcc :: CanonGrammar -> C.Grammar +mkCanon2gfcc = canon2gfcc . reorder . utf8Conv . canon2canon . normalize -- This is needed to reorganize the grammar. GFCC has its own back-end optimization. -- But we need to have the canonical order in tables, created by valOpt -- cgit v1.2.3