msyds/gf-rgl
1
0
Fork 0
forked from GitHub/gf-rgl
Code Pull Requests Activity

concatenation string patterns

Browse Source
This commit is contained in:
aarne
2006-01-06 21:49:25 +00:00
parent 9cebca6e10
commit 9f91bd2136
2 changed files with 14 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
prelude/Predef.gf
View File

@@ -10,6 +10,7 @@ resource Predef = {
oper Int : Type = variants {} ; -- the type of integers oper Int : Type = variants {} ; -- the type of integers
oper Ints : Int -> Type = variants {} ; -- the type of integers from 0 to n oper Ints : Int -> Type = variants {} ; -- the type of integers from 0 to n
oper CC : Tok -> Tok -> Tok = variants {} ; -- concatenation; used in patterns
oper length : Tok -> Int = variants {} ; -- length of string oper length : Tok -> Int = variants {} ; -- length of string
oper drop : Int -> Tok -> Tok = variants {} ; -- drop prefix of length oper drop : Int -> Tok -> Tok = variants {} ; -- drop prefix of length
oper take : Int -> Tok -> Tok = variants {} ; -- take prefix of length oper take : Int -> Tok -> Tok = variants {} ; -- take prefix of length

27
resource-1.0/german/ResGer.gf
View File

@@ -195,25 +195,23 @@ resource ResGer = ParamGer ** open Prelude in {
VP : Type = { VP : Type = {
s : Agr => VPForm => { s : Agr => VPForm => {
fin : Str ; -- V1 hat ---s1 fin : Str ; -- V1 hat
inf : Str -- V2 gesagt ---s4 inf : Str -- V2 gesagt
} ; } ;
a1 : Polarity => Str ; -- A1 nicht ---s3 a1 : Polarity => Str ; -- A1 nicht
n2 : Agr => Str ; -- N2 dich ---s5 n2 : Agr => Str ; -- N2 dich
a2 : Str ; -- A2 heute ---s6 a2 : Str ; -- A2 heute
ext : Str -- S-Ext dass sie kommt ---s7 ext : Str -- S-Ext dass sie kommt
} ; } ;
predV : Verb -> VP = \verb -> predV : Verb -> VP = \verb ->
let let
vfin : Tense -> Agr -> Str = \t,a -> vfin : Tense -> Agr -> Str = \t,a -> verb.s ! vFin t a ;
verb.s ! vFin t a ;
vpart = verb.s ! VPastPart APred ; vpart = verb.s ! VPastPart APred ;
vinf = verb.s ! VInf ; vinf = verb.s ! VInf ;
vHaben = auxPerfect verb ; vHaben = auxPerfect verb ;
hat : Tense -> Agr -> Str = \t,a -> hat : Tense -> Agr -> Str = \t,a -> vHaben ! vFin t a ;
vHaben ! vFin t a ;
haben : Str = vHaben ! VInf ; haben : Str = vHaben ! VInf ;
wird : Agr -> Str = \a -> werden_V.s ! VPresInd a.n a.p ; wird : Agr -> Str = \a -> werden_V.s ! VPresInd a.n a.p ;
@@ -340,10 +338,6 @@ resource ResGer = ParamGer ** open Prelude in {
} }
} ; } ;
conjThat : Str = "daß" ;
conjThan : Str = "als" ;
reflPron : Agr => Str = table { reflPron : Agr => Str = table {
{n = Sg ; p = P1} => "mich" ; {n = Sg ; p = P1} => "mich" ;
{n = Sg ; p = P2} => "dich" ; {n = Sg ; p = P2} => "dich" ;
@@ -353,6 +347,11 @@ resource ResGer = ParamGer ** open Prelude in {
{n = Pl ; p = P3} => "sich" {n = Pl ; p = P3} => "sich"
} ; } ;
conjThat : Str = "daß" ;
conjThan : Str = "als" ;
-- For $Numeral$. -- For $Numeral$.
-- --
-- mkNum : Str -> Str -> Str -> Str -> {s : DForm => CardOrd => Str} = -- mkNum : Str -> Str -> Str -> Str -> {s : DForm => CardOrd => Str} =