changed names of resource-1.3; added a note on homepage on release

doc/gf3-release.html

@@ -0,0 +1,73 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<HTML>
+<HEAD>
+<META NAME="generator" CONTENT="http://txt2tags.sf.net">
+<TITLE>GF 3.0</TITLE>
+</HEAD><BODY BGCOLOR="white" TEXT="black">
+<P ALIGN="center"><CENTER><H1>GF 3.0</H1>
+<FONT SIZE="4">
+<I>Krasimir Angelov, Björn Bringert, and Aarne Ranta</I><BR>
+</FONT></CENTER>
+
+<P>
+GF Version 3.0 is a major revision of GF. The source language is a superset of the
+language in 2.9, which means backward compatibility. But the target languages, the
+compiler implementation, and the functionalities (e.g. the shell) have undergone
+radical changes. 
+</P>
+<P>
+The release of GF 3.0 is projected for 27 June. As usual, the developing sources
+are available all the time via Darcs.
+</P>
+<H2>New features</H2>
+<P>
+Here is a summary of the main novelties visible to the user:
+</P>
+<UL>
+<LI><B>Size</B>: the source code and the executable binary size have gone 
+  down to about the half of 2.9.
+<LI><B>Portability</B>: the new back end format PGF (Portable Grammar Format) is
+  much simpler than the old GFC format, and therefore easier to port to new
+  platforms.
+<LI><B>Multilingual web page support</B>: as an example of portability, GF 3.0 provides a
+  compiler from PGF to JavaScript. There are also JavaScript libraries for creating
+  translators and syntax editors as client-side web applications.
+<LI><B>Incremental parsing</B>: there is a possibility of word completion when
+  input strings are sent to the parser.
+<LI><B>Application programmer's interfaces</B>: both source-GF and PGF formats,
+  the shell, and the compiler are accessible via high-level APIs.
+<LI><B>Resource library version 1.4</B>: more coverage, more languages; some of
+  the new GF language features are exploited.
+</UL>
+
+<H2>Non-supported features</H2>
+<P>
+There are some features of GF 2.9 that will <I>not</I> work in the 2.7 June release.
+</P>
+<UL>
+<LI>Java Editor GUI: we now see the JavaScript editor as the main form of 
+  syntax editing.
+<LI>Pre-module multi-file grammar format: the grammar format of GF before version 2.0 
+  is still supported, but its include mechanism is not; this means that grammars 
+  consisting of multiple files have to be concatenated before use.
+<LI>Probabilistic GF grammars.
+<LI>Some output formats: LBNF.
+<LI>Some GF shell commands: while the main ones will be supported with their familiar
+  syntax and options, some old commands have not been included.
+</UL>
+
+<P>
+Users who want to have these features are welcome to contact us, 
+and even more welcome to contribute code that restores them!
+</P>
+<H2>GF language extensions</H2>
+<P>
+Operations for defining patterns.
+</P>
+<P>
+Inheritance of overload groups.
+</P>
+
+<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
+<!-- cmdline: txt2tags -thtml gf3-release.txt -->
+</BODY></HTML>

examples/tutorial/hello/hello.gfs

@@ -1,4 +1,4 @@
 import HelloEng.gf
 import HelloFin.gf
 import HelloIta.gf
-linearize -multi Hello World
+linearize Hello World

examples/tutorial/semantics/Base.gf

@@ -30,7 +30,7 @@ fun
 
 -- lexicon
 
-  UseInt  : Int -> PN ;
+  UseInt : Int -> PN ;
 
   Number : CN ;
   Even, Odd, Prime : AP ;

examples/tutorial/semantics/BaseI.gf

@@ -32,7 +32,7 @@ lin
   And = and_Conj ;
   Or  = or_Conj ;
 
-  UseInt i = symb i ;
+  UseInt i = symb (i ** {lock_Int = <>}) ; ---- terrible to need this
 
   Number = mkCN number_N ;
 
@@ -46,15 +46,15 @@ lin
  
   Sum     = prefix sum_N2 ;
   Product = prefix product_N2 ;
-  GCD nps = mkNP (mkDet (mkQuantSg defQuant) (mkOrd great_A)) 
+  GCD nps = mkNP (mkDet DefArt (mkOrd great_A)) 
               (mkCN common_A (mkCN divisor_N2 (mkNP and_Conj nps))) ;
 
   WhatIs np = mkPhr (mkQS (mkQCl whatSg_IP (mkVP np))) ;
-  WhichAre cn ap = mkPhr (mkQS (mkQCl (mkIP whichPl_IDet cn) (mkVP ap))) ;
+  WhichAre cn ap = mkPhr (mkQS (mkQCl (mkIP which_IQuant cn) (mkVP ap))) ;
   QuestS s = mkPhr (mkQS (mkQCl s)) ;
 
-  Yes = yes_Phr ;
+  Yes = mkPhr yes_Utt ;
-  No = no_Phr ;
+  No = mkPhr no_Utt ;
 
   Value np = mkPhr (mkUtt np) ;
   Many list = mkNP and_Conj list ;
@@ -65,6 +65,6 @@ lin
 
 oper
   prefix : G.N2 -> G.ListNP -> G.NP = \n2,nps -> 
-    mkNP defSgDet (mkCN n2 (mkNP and_Conj nps)) ;
+    mkNP DefArt (mkCN n2 (mkNP and_Conj nps)) ;
   
 }

examples/tutorial/smart/SmartEng.gf

@@ -1,6 +1,6 @@
 --# -path=.:prelude
 
-concrete Toy1Eng of Toy1 = open Prelude in {
+concrete SmartEng of Smart = open Prelude in {
 
 -- grammar Toy1 from the Regulus book
 

examples/tutorial/smart/SmartFre.gf

@@ -1,6 +1,6 @@
 --# -path=.:prelude
 
-concrete Toy1Fre of Toy1 = open Prelude in {
+concrete SmartFre of Smart = open Prelude in {
 
 -- grammar Toy1 from the Regulus book
 

examples/tutorial/syntax/Syntax.gf

@@ -10,17 +10,17 @@ oper
 
   mkS = overload {
     mkS : Pol -> NP -> VP -> S
-       = PredVP ;
+       = \p,np,vp -> UseCl p (PredVP np vp) ;
     mkS : NP -> VP -> S
-       = PredVP PPos ;
+       = \np,vp -> UseCl PPos (PredVP np vp) ;
     mkS : Pol -> NP -> V2 -> NP -> S
-       = \p,np,v,o -> PredVP p np (ComplV2 v o) ;
+       = \p,np,v,o -> UseCl p (PredVP np (ComplV2 v o)) ;
     mkS : NP -> V2 -> NP -> S
-       = \np,v,o -> PredVP PPos np (ComplV2 v o) ;
+       = \np,v,o -> UseCl PPos (PredVP np (ComplV2 v o)) ;
     mkS : Pol -> NP -> AP -> S
-       = \p,np,ap -> PredVP p np (ComplAP ap) ;
+       = \p,np,ap -> UseCl p (PredVP np (ComplAP ap)) ;
     mkS : NP -> AP -> S
-       = \np,ap -> PredVP PPos np (ComplAP ap) ;
+       = \np,ap -> UseCl PPos (PredVP np (ComplAP ap)) ;
     } ;
 
   mkNP : Det -> CN -> NP 

homepage.html

@@ -52,6 +52,14 @@ December 21, 2007.
 
 </p><h2>News</h2>
 
+<i>June 25, 2008</i>.
+<a href="doc/gf3-release.html">GF 3.0</a>
+coming soon! Version 2.9f is now frozen and no longer
+available in darcs. But <a href="download/GF-2.9f.tgz">here</a> is a tarball
+with the final version of 2.9 sources. 
+
+<p>
+
 <i>March 20, 2008</i>. Ten years of GF! 
 <ul>
   <li> <a href="doc/nancy-slides.pdf">The first public talk</a> at INRIA Nancy,