GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-23 01:52:50 -06:00
Code Issues Packages Projects Releases Wiki Activity

Hebrew Letter; news on index

Browse Source
This commit is contained in:
aarne
2005-12-22 18:01:35 +00:00
parent eda7b07087
commit 19c57dbd29
9 changed files with 676 additions and 440 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
bin/jgf
View File

@@ -1,7 +1,7 @@
#! /bin/sh #! /bin/sh
# change the value of GFHOME to the directory where you have the gf binary # change the value of GFHOME to the directory where you have the gf binary
GFHOME=../ GFHOME=/home/aarne/GF
JGUILIB=$GFHOME/src/JavaGUI JGUILIB=$GFHOME/src/JavaGUI
GF=$GFHOME/bin/gf GF=$GFHOME/bin/gf

6
doc/gf-quickstart.html
View File

@@ -29,9 +29,9 @@ When you have downloaded and installed GF:
<ol> <ol>
<li> Copy the files <li> Copy the files
<a href="tutorial/Paleolithic.gf"><tt>Paleolithic.gf</tt></a>, <a href="tutorial/old/Paleolithic.gf"><tt>Paleolithic.gf</tt></a>,
<a href="tutorial/PaleolithicEng.gf"><tt>PaleolithicEng.gf</tt></a>, and <a href="tutorial/old/PaleolithicEng.gf"><tt>PaleolithicEng.gf</tt></a>, and
<a href="tutorial/PaleolithicIta.gf"><tt>PaleolithicIta.gf</tt></a>. <a href="tutorial/old/PaleolithicIta.gf"><tt>PaleolithicIta.gf</tt></a>.
<li> Start GF with the command <li> Start GF with the command
<pre> <pre>

122
doc/old-news.html Normal file
View File

@@ -0,0 +1,122 @@
<html>
<body>
<h1>GF News 2004-2005</h1>
<i>December 9, 2005</i>.
<a href="http://www.cs.chalmers.se/~peb/software.html">
MCFG/GF library for Prolog</a>, by
<a href="http://www.cs.chalmers.se/~peb/">Peter Ljunglöf</a>.
This means that you can use GF grammars as parts of
Prolog programs (in the same way as in Java and Haskell
before).
<br>
<i>December 8, 2005</i>.
A structured <a href="doc/index.html">Documentation page</a> on GF.
<br>
<i>December 1, 2005</i>.
Publicly accessible
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/darcs.html">
Darcs repository</a>
for latest sources and documents. The snapshots are no longer updated.
<br>
<i>September 22, 2005</i>.
<a href="http://www.cs.chalmers.se/~bringert/gf/downloads/snapshots/">
Snapshots</a>: latest source and linux binary packages, for testers
and developers. See
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/gf-history.html">GF history</a> for the latest changes.
<br>
<b>Notice</b> (1/12):
Use the
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/darcs.html">
Darcs repository</a> instead!
<br>
<i>July 1, 2005</i>. GF 2.3 released.
Download from
<a href="http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
The <a href="doc/gf-history.html">GF history</a> lists changes.
The source package on SourceForge also contains a new GUI and some new grammars.
<br>
<i>June 3, 2005</i>. Started a page on
<a href="doc/gf-history.html">history of changes</a>.
These changes will appear soon in releases.
<br>
<i>May 17, 2005</i>. Version 2.2 released. See
<a href="doc/gf2.2-highlights.html">highlights</a>.
Download from
<a href="http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
<br>
<i>May 12, 2005</i>. GF now has a mailing list, to which you can register
<a href="https://lists.sourceforge.net/lists/listinfo/gf-tools-users">here</a>.
GF also has a project page on SourceForge,
<a
href="https://sourceforge.net/projects/gf-tools">
https://sourceforge.net/projects/gf-tools</a>,
but this page does not yet have much content.
<br>
<i>May 9, 2005</i>.
PhD Thesis by
<a href="http://www.cs.chalmers.se/~krijo">Kristofer Johannisson</a>:
<a href="http://www.cs.chalmers.se/~krijo/thesis/thesisA4.pdf">
Formal and Informal Software Specifications</a>.
<br>
<i>March 15, 2005</i>.
Master's thesis by
<a href="http://www.cs.chalmers.se/~bringert/">Björn Bringert</a> on
<a
href="http://www.dtek.chalmers.se/~d00bring/publ/exjobb/embedded-grammars.pdf">
Embedded grammars</a>:
GF grammars that can be used as parts of Java programs. And a
<a
href="http://www.cs.chalmers.se/~bringert/misc/tramdemo.avi">demo film</a>
of a multimodal dialogue system built with embedded grammars.
<br>
<i>November 9, 2004</i>.
PhD Thesis by
<a href="http://www.cs.chalmers.se/~peb">Peter Ljunglöf</a>:
<a href="http://www.cs.chalmers.se/~peb/pubs/p04-PhD-thesis.pdf">
Expressivity and Complexity of the Grammatical Framework</a>.
<br>
<i>November 8, 2004</i>. GF 2.1 released.
Here are the <a
href="doc/gf2-highlights.html">highlights</a>.
Software available on the <a href="../GF2.0/download/gf-download.html">GF 2.1 Download
Page</a>.
Main novelties in 2.1:
multiple inheritance of grammar modules,
speech recognition grammar generation,
lots of bug fixes.
Version 2.0 still available
on the <a href="../GF2.0/download-2.0/gf-download.html">GF 2.0 Download Page</a>.
If you need something from the previous version of the web page, it is
still available:
<a href="http://www.cs.chalmers.se/~aarne/GF1">
GF 1.2</a>.
</body>
<7html>

639
examples/letter/Letter.gfcm
View File

File diff suppressed because one or more lines are too long

2
examples/letter/README
View File

@@ -30,7 +30,7 @@ For the actual use, type then
and select "Letter" from the "New" menu. and select "Letter" from the "New" menu.
Copyright (c) 2001-2004 Janna Khegai, Aarne Ranta Copyright (c) 2001-2005 Janna Khegai, Alex Kutsela, Aarne Ranta
under GNU General Public License (GPL). under GNU General Public License (GPL).
Document last updated August 3, 2004, by Aarne Ranta. Document last updated August 3, 2004, by Aarne Ranta.

212
examples/letter/letter.HebU.gf Normal file
View File

@@ -0,0 +1,212 @@
include letter.Abs.gf ;
-- (c) Alex Kutsela 2005
flags lexer=textlit ; unlexer=textlit ; coding=utf8 ;
param Gen = masc | fem ;
param Num = sg | pl ;
param Kas = nom | dat | acc ;
param DepNum = depnum | cnum Num ;
param DepGen = depgen | cgen Gen ;
lintype SS = {s : Str} ;
lintype SSDep = {s : Num => Gen => Str} ; -- needs Num and Gen
lintype SSSrc = {s : Str ; n : Num ; g : Gen} ; -- gives Num and Gen
lintype SSSrc2 = {s : Num => Gen => Str ; n : DepNum ; g : DepGen} ; -- gives&needs
lintype SSDep2 = {s : DepNum => DepGen => Num => Gen => Str} ; -- needs Auth's&Rec's
lintype SSSrcGen = {s : Str ; n : Num ; g : Gen} ; -- gives Num and Gen
oper
ss : Str -> SS = \s -> {s = s} ;
regAdj : Str -> Num => Gen => Tok =\s -> table {
sg => table {masc => s; fem => s+"ה"};
pl => table {masc => s+"ים"; fem => s+"ות"}
};
hello : Str -> Num => Str = \s -> table {sg => s ; pl => s} ;
regVerPerf : Str -> Num => Gen => Str = \s ->
table {sg => table {masc => s; fem => s+"ה"};
pl => table {masc => s+"ו"; fem => s+"ו"}
};
ego : Num => Str = table {sg => "אןי" ; pl => "אןחןו" } ;
tu : Num => Gen => Kas => Str =
table {sg => table {fem => table {nom => "את"; dat => "לך"; acc => "אותך"} ;
masc => table {nom => "אתה"; dat => "לך"; acc => "אותך"}
} ;
pl => table {fem => table {nom => "אתן"; dat => "לכן"; acc => "אתכן"} ;
masc => table {nom => "אתם"; dat => "לכם"; acc => "אתכם"}
}
};
hereIam : Num => Str =
table {sg => "הןןי" ; pl => "הןןו" } ;
haveBeen : Str -> Num => Gen => Str = \s ->
table {sg => table {masc => s+"ת"; fem => s+"ת"};
pl => table {masc => s+"תם"; fem => s+"תן"}
};
thatConj = ["ש"] ;
regVer : Str -> Num => Gen => Str = \s ->
table {sg => table {masc => s; fem => s+"ת"};
pl => table {masc => s+"ים"; fem => s+"ות"}
};
constNG : Str -> Num -> Gen -> SSSrc2 = \str,num,gen ->
{s = table {_ => table {_ => str}} ; n = cnum num ; g = cgen gen} ;
dep2num : DepNum -> Num -> Num = \dn,n -> case dn of {
depnum => n ;
cnum cn => cn
} ;
dep2gen : DepGen -> Gen -> Gen = \dg,g -> case dg of {
depgen => case g of {
masc => fem ;
fem => masc
}; -- negative dependence: the author is of opposite sex
cgen cg => cg
} ;
lincat
Letter = SS ;
Recipient = SSSrc ;
Author = SSSrc2 ;
Message = SSDep2 ;
Heading = SSSrc ;
Ending = SSSrc2 ;
Mode = SSDep2 ;
Sentence = SSDep2 ;
NounPhrase = SSSrcGen ;
Position = SSDep ;
lin
MkLetter head mess end =
ss ("," ++ head.s ++ "&-" ++
mess.s ! end.n ! end.g ! head.n ! head.g ++ "&-" ++
end.s ! head.n ! head.g) ;
DearRec rec = {s = rec.s ++ regAdj "יקר" ! rec.n ! rec.g;
n = rec.n;
g = rec.g};
PlainRec rec = rec ;
HelloRec rec = {s = hello "שלום" ! rec.n ++ rec.s ; n = rec.n ; g = rec.g} ;
JustHello rec = {s = hello "שלום" ! rec.n ; n = rec.n ; g = rec.g} ;
ModeSent mode sent =
{s =
table {na => table {xa => table {nr => table {xr =>
mode.s ! na ! xa ! nr ! xr ++ sent.s ! na ! xa ! nr ! xr}}}}
} ;
PlainSent sent = sent ;
FormalEnding auth =
{s =
table {n => table {g =>
[",בכבוד רב &-"] ++
auth.s ! n ! g
}} ;
n = auth.n ; g = auth.g} ;
InformalEnding auth =
{s = table {n => table {g => [",בברכה &-"] ++ auth.s ! n ! g}} ;
n = auth.n ; g = auth.g} ;
ColleagueHe = {s = "עמית" ; n = sg ; g = masc} ;
ColleagueShe = {s = "עמיתה" ; n = sg ; g = fem} ;
ColleaguesHe = {s = "עמיתים" ; n = pl ; g = masc} ;
ColleaguesShe = {s = "עמיתות" ; n = pl ; g = fem} ;
DarlingHe = {s = "אהובי" ; n = sg ; g = masc} ;
DarlingShe = {s = "אהובתי" ; n = sg ; g = fem} ;
NameHe s = {s = s.s ; n = sg ; g = masc} ;
NameShe s = {s = s.s ; n = sg ; g = fem} ;
Honour = {s = table {
na => table {
xa => table {
nr => table {
xr => hereIam ! dep2num na nr ++
regVer "מתכבד" ! dep2num na nr ! dep2gen xa xr ++
["להודיע"] ++ tu ! nr ! xr ! dat ++ thatConj
}
}
}
}
} ;
Regret = {s = table {
na => table {
ga => table {
nr => table {
gr => let {dga = dep2gen ga gr ; dna = dep2num na nr} in
ego ! dna ++ regVer "מצטער" ! dna ! dga ++
["להודיע"] ++ tu ! nr ! gr ! dat ++ thatConj
}
}
}
}
} ;
Dean = constNG ["דיקן"] sg masc ;
President = constNG ["ןשיא"] sg masc ;
Mother = constNG ["אמא"] sg fem ;
Name s = constNG s.s sg masc ; ---
Spouse = {s = table {
sg => table {fem => ["בעלך"] ; masc => ["אישתך"]} ;
pl => table {fem => ["בעליכן"] ; masc => ["ןשותיכם"]}
} ; n = depnum ; g = depgen} ;
BePromoted pos = {s = table {
na => table {
xa => table {
nr => table {
xr => haveBeen "קודמ" ! nr !xr ++ "לתפקיד" ++ "של" ++ pos.s ! nr ! xr
}
}
}
}
} ;
GoBankrupt np =
{s = table
{na => table
{xa => table
{nr => table
{xr => np.s ++ regVerPerf "פשט" ! np.n ! np.g ++ "רגל"}
}
}
}
} ;
ILoveYou = {s = table
{na => table
{ga => table
{nr => table
{gr => let {dga = dep2gen ga gr ; dna = dep2num na nr} in
ego ! dna ++ regVer "אוהב" ! dna ! dga ++
tu ! nr ! gr ! acc}
}
}
}
} ;
Company = {s = ["חברתןו"] ; n = sg ; g = fem} ;
Competitor = {s = ["המתחרה הגרוע ביותר שלןו"] ; n = sg ; g = masc} ;
OurCustomers = {s = ["לקוחותיןו"] ; n = pl ; g = masc} ;
Senior = {s = table
{sg => table {g => ["חבר בכיר"]} ;
pl => table {g => ["חברים בכירים"]}
}
} ;
ProjectManager = {s = table {
sg => table {fem => ["מןהלת פרוייקט"]; masc => ["מןהל פרוייקט"]} ;
pl => table {fem => ["מןהלות פרוייקט"]; mask =>["מןהלי פרוייקט"]}
}
} ;

5
examples/letter/mkLetter.gfs
View File

@@ -1,13 +1,14 @@
-- to make a multilingual gfcm grammar for rapid loading. AR 29/1/2004 -- to make a multilingual gfcm grammar for rapid loading. AR 29/1/2004
-- to run: gf2+ <mkLetter.gfs -- to run: gf <mkLetter.gfs
i -old -abs=Letter -cnc=English letter.Eng.gf i -old -abs=Letter -cnc=English letter.Eng.gf
i -old -abs=Letter -cnc=French letter.Fra.gf i -old -abs=Letter -cnc=French letter.Fra.gf
i -old -abs=Letter -cnc=Swedish letter.Sve.gf i -old -abs=Letter -cnc=Swedish letter.Sve.gf
i -old -abs=Letter -cnc=Finnish letter.Fin.gf i -old -abs=Letter -cnc=Finnish letter.Fin.gf
i -old -abs=Letter -cnc=Russian letter.RusU.gf i -old -abs=Letter -cnc=Russian letter.RusU.gf
i -old -abs=Letter -cnc=Hebrew letter.HebU.gf
s s
pm | wf Letter.gfcm pm -utf8 | wf Letter.gfcm

126
index.html
View File

@@ -35,124 +35,7 @@ now up to date for version 2.4.
<p> <p>
<font size="1"> <a href="doc/old-news.html">News 2004-2005</a>.
<i>December 9, 2005</i>.
<a href="http://www.cs.chalmers.se/~peb/software.html">
MCFG/GF library for Prolog</a>, by
<a href="http://www.cs.chalmers.se/~peb/">Peter Ljunglöf</a>.
This means that you can use GF grammars as parts of
Prolog programs (in the same way as in Java and Haskell
before).
<br>
<i>December 8, 2005</i>.
A structured <a href="doc/index.html">Documentation page</a> on GF.
<br>
<i>December 1, 2005</i>.
Publicly accessible
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/darcs.html">
Darcs repository</a>
for latest sources and documents. The snapshots are no longer updated.
<br>
<i>September 22, 2005</i>.
<a href="http://www.cs.chalmers.se/~bringert/gf/downloads/snapshots/">
Snapshots</a>: latest source and linux binary packages, for testers
and developers. See
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/gf-history.html">GF history</a> for the latest changes.
<br>
<b>Notice</b> (1/12):
Use the
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/darcs.html">
Darcs repository</a> instead!
<br>
<i>July 1, 2005</i>. GF 2.3 released.
Download from
<a href="http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
The <a href="doc/gf-history.html">GF history</a> lists changes.
The source package on SourceForge also contains a new GUI and some new grammars.
<br>
<i>June 3, 2005</i>. Started a page on
<a href="doc/gf-history.html">history of changes</a>.
These changes will appear soon in releases.
<br>
<i>May 17, 2005</i>. Version 2.2 released. See
<a href="doc/gf2.2-highlights.html">highlights</a>.
Download from
<a href="http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
<br>
<i>May 12, 2005</i>. GF now has a mailing list, to which you can register
<a href="https://lists.sourceforge.net/lists/listinfo/gf-tools-users">here</a>.
GF also has a project page on SourceForge,
<a
href="https://sourceforge.net/projects/gf-tools">
https://sourceforge.net/projects/gf-tools</a>,
but this page does not yet have much content.
<br>
<i>May 9, 2005</i>.
PhD Thesis by
<a href="http://www.cs.chalmers.se/~krijo">Kristofer Johannisson</a>:
<a href="http://www.cs.chalmers.se/~krijo/thesis/thesisA4.pdf">
Formal and Informal Software Specifications</a>.
<br>
<i>March 15, 2005</i>.
Master's thesis by
<a href="http://www.cs.chalmers.se/~bringert/">Björn Bringert</a> on
<a
href="http://www.dtek.chalmers.se/~d00bring/publ/exjobb/embedded-grammars.pdf">
Embedded grammars</a>:
GF grammars that can be used as parts of Java programs. And a
<a
href="http://www.cs.chalmers.se/~bringert/misc/tramdemo.avi">demo film</a>
of a multimodal dialogue system built with embedded grammars.
<br>
<i>November 9, 2004</i>.
PhD Thesis by
<a href="http://www.cs.chalmers.se/~peb">Peter Ljunglöf</a>:
<a href="http://www.cs.chalmers.se/~peb/pubs/p04-PhD-thesis.pdf">
Expressivity and Complexity of the Grammatical Framework</a>.
<br>
<i>November 8, 2004</i>. GF 2.1 released.
Here are the <a
href="doc/gf2-highlights.html">highlights</a>.
Software available on the <a href="../GF2.0/download/gf-download.html">GF 2.1 Download
Page</a>.
Main novelties in 2.1:
multiple inheritance of grammar modules,
speech recognition grammar generation,
lots of bug fixes.
Version 2.0 still available
on the <a href="../GF2.0/download-2.0/gf-download.html">GF 2.0 Download Page</a>.
If you need something from the previous version of the web page, it is
still available:
<a href="http://www.cs.chalmers.se/~aarne/GF1">
GF 1.2</a>.
</font>
</p><h2>What is GF?</h2> </p><h2>What is GF?</h2>
@@ -279,6 +162,13 @@ information on compiler requirements.
<p> <p>
The publicly accessible
<a href="http://www.cs.chalmers.se/Cs/Research/Language-technology/darcs/GF/doc/darcs.html">
Darcs repository</a>
has the latest sources and documents.
<p>
For Java programmers: GF grammars can be embedded in Java programs by using the For Java programmers: GF grammars can be embedded in Java programs by using the
<a href="http://www.cs.chalmers.se/~bringert/gf/gf-java.html"> <a href="http://www.cs.chalmers.se/~bringert/gf/gf-java.html">
Embedded GF Interpreter</a>. Embedded GF Interpreter</a>.

2
src/GF/Shell/ShellCommands.hs
View File

@@ -210,7 +210,7 @@ optionsOfCommand co = case co of
CPrintMultiGrammar -> both "utf8 utf8id" "printer" CPrintMultiGrammar -> both "utf8 utf8id" "printer"
CPrintSourceGrammar -> both "utf8" "printer" CPrintSourceGrammar -> both "utf8" "printer"
CHelp _ -> opts "all defs filter length lexer unlexer printer transform depth number" CHelp _ -> opts "all alts atoms coding defs filter length lexer unlexer printer probs transform depth number"
CImpure ICEditSession -> both "f" "file" CImpure ICEditSession -> both "f" "file"
CImpure ICTranslateSession -> both "f langs" "cat" CImpure ICTranslateSession -> both "f langs" "cat"