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

topological model in Scand main branch

Browse Source
This commit is contained in:
aarne
2005-03-04 15:56:48 +00:00
parent 7cb9e1f2cc
commit 0259b6d6a4
14 changed files with 165 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lib/resource/abstract/Clause.gf
View File

@@ -14,7 +14,7 @@ fun
SPredV : NP -> V -> Cl ; -- "John walks"
SPredPassV : NP -> V -> Cl ; -- "John is seen"
SPredV2 : NP -> V2 -> NP -> Cl ; -- "John sees Mary"
SPredV3 : NP -> V2 -> NP -> NP -> Cl ; -- "John tells Mary everything"
SPredV3 : NP -> V3 -> NP -> NP -> Cl ; -- "John tells Mary everything"
SPredReflV2 : NP -> V2 -> Cl ; -- "John loves himself"
SPredVS : NP -> VS -> S -> Cl ; -- "John says that Mary runs"
SPredVV : NP -> VV -> VPI -> Cl ; -- "John must walk"

2
lib/resource/abstract/ClauseI.gf
View File

@@ -9,7 +9,7 @@ incomplete concrete ClauseI of Clause = open Rules, Verbphrase in {
SPredV np v = PredVP np (UseV v) ;
SPredPassV np v = PredVP np (UsePassV v) ;
SPredV2 np v x = PredVP np (ComplV2 v x) ;
---- SPredV3 np v x y = PredVP np (ComplV3 v x y) ;
SPredV3 np v x y = PredVP np (ComplV3 v x y) ;
SPredReflV2 np v = PredVP np (ComplReflV2 v) ;
SPredVS np v x = PredVP np (ComplVS v x) ;
SPredVV np v x = PredVP np (ComplVV v x) ;