[Savannah-hackers] savannah.gnu.org: submission of AFfix Grammar ENvironment

[ejv]

A package was submitted to savannah.gnu.org.
This mail was sent to address@hidden, address@hidden

If it already is an official GNU package, it will be approved shortly.
Otherwise it must be discussed on address@hidden for approval. 

Erik J. Verbruggen <address@hidden> described the package as follows:
License: other
Other License: AGFL runtime system: LGPL
AGFL parser generator and lexicon compiler: GPL
CDL3 runtime system: LGPL
CDL3 compiler: GPL
Package: AFfix Grammar ENvironment
System name: afgen

The affix grammar project is about formalism to compile affix grammars to 
executable parsers/programs. It currently consists of two compilers.
 
The AGFL compiler is meant for building executable parsers for possibly 
ambiguous grammars. Natural language (English, Dutch, Arabic) are typically 
ambiguous and therefore cannot be parsed by, for example, yacc. AGFL stands for 
Affix Grammars over Finite Lattices. The formalism is similiar to prolog. The 
main difference is that AGFL uses sets (lattices) as parameters to the grammar 
rules. As AGFL is targeted towards natural language, a lexicon compile is 
included, to make the lexical phase fast. The runtime system, to which 
generated parsers are linked, is consists of an interpreter (among things). The 
interpreter is targeted/tuned to handle many grammar rules and alternatives in 
a efficient way.

The second compiler is the CDL3 compiler. CDL stands for Compiler Description 
Language. The CDL3 compiler can be seen as a \"classical\" compiler. It uses 
(nearly) the same syntax as CDL3, with extension for structure and union data 
types (\"struct\" and \"union\" in C). CDL3 has some powerfull ways to walk 
these data structures, which makes it very-well suited to handle complex and 
large data structures typically found in compilers. The AGFL parser generator 
is written in CDL3.