forked from GitHub/gf-rgl
60 lines
1.2 KiB
Plaintext
60 lines
1.2 KiB
Plaintext
concrete AdjectiveDut of Adjective = CatDut ** open ResDut, Prelude in
|
|
{
|
|
|
|
|
|
flags optimize=all_subs ;
|
|
|
|
lin
|
|
|
|
PositA a = {
|
|
s = a.s ! Posit ;
|
|
isPre = True
|
|
} ;
|
|
ComparA a np = {
|
|
s = \\af => a.s ! Compar ! af ++ "dan" ++ np.s ! NPNom ;
|
|
isPre = True
|
|
} ;
|
|
-- CAdvAP ad ap np = {
|
|
-- s = \\af => ad.s ++ ap.s ! af ++ ad.p ++ np.s ! Nom ;
|
|
-- isPre = False
|
|
-- } ;
|
|
-- UseComparA a = {
|
|
-- s = \\af => a.s ! Compar ! af ;
|
|
-- isPre = True
|
|
-- } ;
|
|
-- AdjOrd a = {
|
|
-- s = a.s ;
|
|
-- isPre = True
|
|
-- } ;
|
|
--
|
|
---- $SuperlA$ belongs to determiner syntax in $Noun$.
|
|
--
|
|
-- ComplA2 a np = {
|
|
-- s = \\af => a.s ! Posit ! af ++ appPrep a.c2 np.s ;
|
|
-- isPre = True
|
|
-- } ;
|
|
--
|
|
-- ReflA2 a = {
|
|
-- s = \\af => a.s ! Posit ! APred ++ appPrep a.c2 (reflPron ! agrP3 Sg) ; --- agr
|
|
-- isPre = True
|
|
-- } ;
|
|
--
|
|
-- SentAP ap sc = {
|
|
-- s = \\a => ap.s ! a ++ sc.s ;
|
|
-- isPre = False
|
|
-- } ;
|
|
--
|
|
-- AdAP ada ap = {
|
|
-- s = \\a => ada.s ++ ap.s ! a ;
|
|
-- isPre = ap.isPre
|
|
-- } ;
|
|
--
|
|
-- UseA2 a = {
|
|
-- s = a.s ! Posit ;
|
|
-- isPre = True
|
|
-- } ;
|
|
--
|
|
--}
|
|
|
|
}
|