diff options
Diffstat (limited to 'grammars/aggregation')
| -rw-r--r-- | grammars/aggregation/Abstract.gf | 57 | ||||
| -rw-r--r-- | grammars/aggregation/Aggregation.gf | 5 | ||||
| -rw-r--r-- | grammars/aggregation/English.gf | 18 | ||||
| -rw-r--r-- | grammars/aggregation/transfer.gf | 75 |
4 files changed, 0 insertions, 155 deletions
diff --git a/grammars/aggregation/Abstract.gf b/grammars/aggregation/Abstract.gf deleted file mode 100644 index 719bfe150..000000000 --- a/grammars/aggregation/Abstract.gf +++ /dev/null @@ -1,57 +0,0 @@ --- testing transfer: aggregation by def definitions. AR 12/4/2003 -- 9/10 - --- p "Mary runs or John runs and John walks" | l -transfer=Aggregation --- Mary runs or John runs and walks --- Mary or John runs and John walks - --- The two results are due to ambiguity in parsing. Thus it is not spurious! - -abstract Abstract = { - -cat - S ; NP ; VP ; Conj ; - -fun - Pred : NP -> VP -> S ; - ConjS : Conj -> S -> S -> S ; - ConjVP : Conj -> VP -> VP -> VP ; - ConjNP : Conj -> NP -> NP -> NP ; - - John, Mary, Bill : NP ; - Walk, Run, Swim : VP ; - And, Or : Conj ; - -fun aggreg : S -> S ; -def - aggreg (ConjS c (Pred Q F) B) = aggrAux c Q F B ; - aggreg (ConjS c A B) = ConjS c (aggreg A) (aggreg B) ; - aggreg A = A ; - --- this auxiliary makes pattern matching on NP to test equality - -fun aggrAux : Conj -> NP -> VP -> S -> S ; -def - -- aggregate verbs with shared subject - aggrAux c John F (Pred John G) = Pred John (ConjVP c F G) ; - aggrAux c Mary F (Pred Mary G) = Pred Mary (ConjVP c F G) ; - aggrAux c Bill F (Pred Bill G) = Pred Bill (ConjVP c F G) ; - - -- aggregate subjects with shared verbs - aggrAux c Q Run (Pred R Run) = Pred (ConjNP c Q R) Run ; - aggrAux c Q Walk (Pred R Walk) = Pred (ConjNP c Q R) Walk ; - aggrAux c Q Swim (Pred R Swim) = Pred (ConjNP c Q R) Swim ; - - -- this case takes care of munching - aggrAux c Q F (ConjS e A B) = aggrAux c Q F (aggreg (ConjS e A B)) ; - - aggrAux c Q F B = ConjS c (Pred Q F) (aggreg B) ; - --- unfortunately we cannot test string equality for Name : String -> NP ; --- It would also be tedious to test the equality of complex --- NPs and VPs, but not impossible. - --- have to add these, otherwise constants are not constructor patterns! - -data NP = John | Mary | Bill ; -data VP = Run | Walk | Swim ; -} diff --git a/grammars/aggregation/Aggregation.gf b/grammars/aggregation/Aggregation.gf deleted file mode 100644 index 116629422..000000000 --- a/grammars/aggregation/Aggregation.gf +++ /dev/null @@ -1,5 +0,0 @@ -transfer Aggregation : Abstract -> Abstract = { - - transfer S : S -> S = aggreg ; - -} diff --git a/grammars/aggregation/English.gf b/grammars/aggregation/English.gf deleted file mode 100644 index 21da16b23..000000000 --- a/grammars/aggregation/English.gf +++ /dev/null @@ -1,18 +0,0 @@ -concrete English of Abstract = { - -pattern - Pred np vp = np ++ vp ; - ConjS c A B = A ++ c ++ B ; - ConjVP c A B = A ++ c ++ B ; - ConjNP c A B = A ++ c ++ B ; - - John = "John" ; - Mary = "Mary" ; - Bill = "Bill" ; - Walk = "walks" ; - Run = "runs" ; - Swim = "swims" ; - - And = "and" ; - Or = "or" ; -} diff --git a/grammars/aggregation/transfer.gf b/grammars/aggregation/transfer.gf deleted file mode 100644 index 0f4e12097..000000000 --- a/grammars/aggregation/transfer.gf +++ /dev/null @@ -1,75 +0,0 @@ --- testing transfer: aggregation by def definitions. AR 12/4/2003 - --- p "Mary runs or John runs and John walks" | wt -c aggreg | l --- Mary runs or John runs and walks --- Mary or John runs and John walks --- The two results are due to ambiguity in parsing. Thus it is not spurious! - -flags transfer=aggreg ; - -cat - S ; NP ; VP ; Conj ; - -fun - Pred : NP -> VP -> S ; - ConjS : Conj -> S -> S -> S ; - ConjVP : Conj -> VP -> VP -> VP ; - ConjNP : Conj -> NP -> NP -> NP ; - - John, Mary, Bill : NP ; - Walk, Run, Swim : VP ; - And, Or : Conj ; - -pattern - Pred np vp = np ++ vp ; - ConjS c A B = A ++ c ++ B ; - ConjVP c A B = A ++ c ++ B ; - ConjNP c A B = A ++ c ++ B ; - - John = "John" ; - Mary = "Mary" ; - Bill = "Bill" ; - Walk = "walks" ; - Run = "runs" ; - Swim = "swims" ; - - - And = "and" ; - Or = "or" ; - --- aggregation transformation - -fun aggreg : S -> S ; -def - aggreg (ConjS c (Pred Q F) B) = aggrAux c Q F B ; - aggreg (ConjS c A B) = ConjS c (aggreg A) (aggreg B) ; - aggreg A = A ; - --- this auxiliary makes pattern matching on NP to test equality - -fun aggrAux : Conj -> NP -> VP -> S -> S ; -def - -- aggregate verbs with shared subject - aggrAux c John F (Pred John G) = Pred John (ConjVP c F G) ; - aggrAux c Mary F (Pred Mary G) = Pred Mary (ConjVP c F G) ; - aggrAux c Bill F (Pred Bill G) = Pred Bill (ConjVP c F G) ; - - -- aggregate subjects with shared verbs - aggrAux c Q Run (Pred R Run) = Pred (ConjNP c Q R) Run ; - aggrAux c Q Walk (Pred R Walk) = Pred (ConjNP c Q R) Walk ; - aggrAux c Q Swim (Pred R Swim) = Pred (ConjNP c Q R) Swim ; - - -- this case takes care of munching - aggrAux c Q F (ConjS e A B) = aggrAux c Q F (aggreg (ConjS e A B)) ; - - aggrAux c Q F B = ConjS c (Pred Q F) (aggreg B) ; - --- unfortunately we cannot test string equality for Name : String -> NP ; --- It would also be tedious to test the equality of complex --- NPs and VPs, but not impossible. - --- have to add these, otherwise constants are not constructor patterns! - -data NP = John | Mary | Bill ; -data VP = Run | Walk | Swim ; - |