cleaning up resource module structure

lib/resource-1.0/abstract/Lex.gf

@@ -1,62 +0,0 @@
---1 Test lexicon
-
--- This lexicon is used when developing a grammar, and called by
--- [Test Test.html]. The full lexicon is divided between
--- [Structural Structural.html], [Basic Basic.html], and [Numeral Numeral.html].
-
-abstract Lex = Cat ** {
-
--- Words of open classes
-
-  fun
-    walk_V  : V ;
-    help_V2 : V2 ;
-    show_V3 : V3 ;
-    want_VV : VV ;
-    claim_VS : VS ;
-    ask_VQ : VQ ;
-
-    dog_N : N ;
-    son_N2 : N2 ;
-    way_N3 : N3 ;
-
-    warm_A : A ;
-    close_A2 : A2 ;
-
--- Structural words
-
-
-    only_Predet, all_Predet : Predet ;
-
-    this_Quant : QuantSg ;
-    these_Quant : QuantPl ;
-    
-    i_Pron, he_Pron, we_Pron : Pron ;
-
-    whoSg_IP, whoPl_IP : IP ;
-
-    when_IAdv, where_IAdv, why_IAdv : IAdv ;
-
-    whichSg_IDet, whichPl_IDet : IDet ;
-
-    here_Adv : Adv ;
-
-    very_AdA : AdA ;
-
-    always_AdV : AdV ;
-
-    forty_Numeral : Numeral ;
-
-    in_Prep, of_Prep : Prep ;
-
-    and_Conj : Conj ;
-    either7or_DConj : DConj ;
-
-    but_PConj : PConj ;
-
-    if_Subj, because_Subj : Subj ;
-   
-    please_Voc : Voc ;
-
-    more_CAdv, less_CAdv : CAdv ;
-}

lib/resource-1.0/abstract/SeqConjunction.gf

@@ -1,40 +0,0 @@
---1 Conjunctions of left-recursive lists
-
-abstract SeqConjunction = Cat ** {
-
--- This module is for backward compatibility with API 0.9.
--- To be used instead of [Conjunction Conjunction.html].
-
-  fun
-
-    ConjS    : Conj -> SeqS -> S ;        -- "John walks and Mary runs"
-    ConjAP   : Conj -> SeqAP -> AP ;      -- "even and prime"
-    ConjNP   : Conj -> SeqNP -> NP ;      -- "John or Mary"
-    ConjAdv  : Conj -> SeqAdv -> Adv ;    -- "quickly or slowly"
-
-    DConjS   : DConj -> SeqS -> S ;       -- "either John walks or Mary runs"
-    DConjAP  : DConj -> SeqAP -> AP ;     -- "both even and prime"
-    DConjNP  : DConj -> SeqNP -> NP ;     -- "either John or Mary"
-    DConjAdv : DConj -> SeqAdv -> Adv ;   -- "both badly and slowly"
-
-
--- these are rather uninteresting
-
-    TwoS : S -> S -> SeqS ;
-    AddS : SeqS -> S -> SeqS ;
-    TwoAdv : Adv -> Adv -> SeqAdv ;
-    AddAdv : SeqAdv -> Adv -> SeqAdv ;
-    TwoNP : NP -> NP -> SeqNP ;
-    AddNP : SeqNP -> NP -> SeqNP ;
-    TwoAP : AP -> AP -> SeqAP ;
-    AddAP : SeqAP -> AP -> SeqAP ;
-
--- we use right-associative lists instead of GF's built-in lists
-
-  cat
-    SeqS ; 
-    SeqAdv ; 
-    SeqNP ; 
-    SeqAP ;
-
-}

lib/resource-1.0/abstract/Test.gf

@@ -1,26 +0,0 @@
---1 The Reduced Top Module of the Resource Grammar
-
--- This grammar is just a collection of the different modules,
--- and one that can be imported when one wants to test a reduced version
--- of the grammar. The complete top module is [Lang Lang.html].
-
--- The main constructs missing are tenses of sentences, numerals, and 
--- comprehensive lexicon.
-
-abstract Test = 
-  Noun,
-  Verb, 
-  Adjective,
-  Adverb,
-  Sentence, 
-  Question,
-  Relative,
-  Conjunction,
-  Phrase,
-  Untensed, 
-  -- Tensed,
-  -- Structural,
-  -- Basic,
-  -- Numeral,
-  Lex 
-  ** {} ;

lib/resource-1.0/abstract/Untensed.gf

@@ -1,14 +0,0 @@
---1 Untensed forms of sentences, questions, and relative clauses
-
--- This module defines just positive and negative present tense forms.
--- Am alternative with full variation in polarity, tense, and anteriority is
--- given in [Untensed Untensed.html].
-
-abstract Untensed = Cat ** {
-
-  fun
-    PosCl,  NegCl  : Cl  -> S ;
-    PosQCl, NegQCl : QCl -> QS ;
-    PosRCl, NegRCl : RCl -> RS ;
-
-}