p1, p2,...` are hard-coded.
+Record and tuple patterns
++Record types of parameter types are also parameter types. +A typical example is a record of agreement features, e.g. French +
+
+ oper Agr : PType = {g : Gender ; n : Number ; p : Person} ;
+
+
+Notice the term PType rather than just Type referring to
+parameter types. Every PType is also a Type.
+
+Pattern matching is done in the expected way, but it can moreover +utilize partial records: the branch +
+
+ {g = Fem} => t
+
+
+in a table of type Agr => T means the same as
+
+ {g = Fem ; n = _ ; p = _} => t
+
++Tuple patterns are translated to record patterns in the +same way as tuples to records; partial patterns make it +possible to write, slightly surprisingly, +
+
+ case <g,n,p> of {
+ <Fem> => t
+ ...
+ }
+
+
+
Prefix-dependent choices
The construct exemplified in @@ -2024,7 +2064,7 @@ This very example does not work in all situations: the prefix } ;
- +Predefined types and operations
GF has the following predefined categories in abstract syntax: @@ -2047,11 +2087,11 @@ they can be used as arguments. For example: -- e.g. (StreetAddress 10 "Downing Street") : Address
- -More features of the module system
-Interfaces, instances, and functors
+More features of the module system
+Interfaces, instances, and functors
+Resource grammars and their reuse
A resource grammar is a grammar built on linguistic grounds, @@ -2104,17 +2144,19 @@ The rest of the modules (black) come from the resource.
Restricted inheritance and qualified opening
-More concepts of abstract syntax
+Restricted inheritance and qualified opening
-Dependent types
+More concepts of abstract syntax
-Higher-order abstract syntax
+Dependent types
-Semantic definitions
+Higher-order abstract syntax
+Semantic definitions
+ +List categories
+Transfer modules
Transfer means noncompositional tree-transforming operations. @@ -2133,9 +2175,9 @@ See the transfer language documentation for more information.
- +Practical issues
- +Lexers and unlexers
Lexers and unlexers can be chosen from
@@ -2171,7 +2213,7 @@ Given by help -lexer, help -unlexer:
Efficiency of grammars
Issues: @@ -2182,7 +2224,7 @@ Issues:
