mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-12 22:39:31 -06:00
4c99687f21
Fixed treatment of predefined types (Int, String). Added treatment of new reserved words to reading old grammars.
56 lines
1.4 KiB
Haskell
56 lines
1.4 KiB
Haskell
module GetTree where
|
|
|
|
import GFC
|
|
import Values
|
|
import qualified Grammar as G
|
|
import Ident
|
|
import MMacros
|
|
import Macros
|
|
import Rename
|
|
import TypeCheck
|
|
import PGrammar
|
|
import ShellState
|
|
|
|
import Operations
|
|
|
|
import Char
|
|
|
|
-- how to form linearizable trees from strings and from terms of different levels
|
|
--
|
|
-- String --> raw Term --> annot, qualif Term --> Tree
|
|
|
|
string2tree :: StateGrammar -> String -> Tree
|
|
string2tree gr = errVal uTree . string2treeErr gr
|
|
|
|
string2treeErr :: StateGrammar -> String -> Err Tree
|
|
string2treeErr gr s = do
|
|
t <- pTerm s
|
|
let t1 = refreshMetas [] t
|
|
let t2 = qualifTerm abstr t1
|
|
annotate grc t2
|
|
where
|
|
abstr = absId gr
|
|
grc = grammar gr
|
|
|
|
string2Cat, string2Fun :: StateGrammar -> String -> (Ident,Ident)
|
|
string2Cat gr c = (absId gr,identC c)
|
|
string2Fun = string2Cat
|
|
|
|
strings2Cat, strings2Fun :: String -> (Ident,Ident)
|
|
strings2Cat s = (identC m, identC (drop 1 c)) where (m,c) = span (/= '.') s
|
|
strings2Fun = strings2Cat
|
|
|
|
string2ref :: StateGrammar -> String -> Err G.Term
|
|
string2ref gr s = case s of
|
|
'x':'_':ds -> return $ freshAsTerm ds --- hack for generated vars
|
|
'"':_:_ -> return $ G.K $ init $ tail s
|
|
_:_ | all isDigit s -> return $ G.EInt $ read s
|
|
_ | elem '.' s -> return $ uncurry G.Q $ strings2Fun s
|
|
_ -> return $ G.Vr $ identC s
|
|
|
|
string2cat :: StateGrammar -> String -> Err G.Cat
|
|
string2cat gr s =
|
|
if elem '.' s
|
|
then return $ strings2Fun s
|
|
else return $ curry id (absId gr) (identC s)
|