Swedish functor implementation of Base

This commit is contained in:
aarne
2007-10-21 10:45:51 +00:00
parent f668736f36
commit ca3535fd87
10 changed files with 54 additions and 27 deletions

View File

@@ -0,0 +1,22 @@
instance LexBaseSwe of LexBase = open SyntaxSwe, ParadigmsSwe in {
oper
even_A = mkA "jämn" ;
odd_A = invarA "udda" ;
prime_A = mkA "prim" ;
great_A = mkA "stor" "större" "störst" ;
common_A = mkA "gemensam" ;
equal_A2 = mkA2 (invarA "lika") (mkPrep "med") ;
greater_A2 = mkA2 (invarA "större") (mkPrep "än") ; ---
smaller_A2 = mkA2 (invarA "mindre") (mkPrep "än") ; ---
divisible_A2 = mkA2 (mkA "delbar") (mkPrep "med") ;
number_N = mkN "tal" "tal" ;
sum_N2 = mkN2 (mkN "summa") (mkPrep "av") ;
product_N2 = mkN2 (mkN "produkt") (mkPrep "av") ;
divisor_N2 = mkN2 (mkN "delare") (mkPrep "av") ;
none_NP = mkNP (mkPN "inget" neutrum) ; ---
invarA : Str -> A = \x -> mkA x x x x x ; ---
}