Source: agfl
Section: misc
Priority: optional
Maintainer: PP Spiertz <pspiertz@sci.kun.nl>
Build-Depends: debhelper (>> 3.0.0), libglib1.2-dev, cdl3 (>> 1.2.3)
Standards-Version: 3.5.2

Package: agfl
Architecture: any
Depends: cdl3 (>> 1.2.3), ${shlibs:Depends}
Description: parser generator for natural language grammars
 AGFL (Affix Grammars over Finite Lattices) is a two-level grammar 
 formalism. This implementation compiles grammars and lexicons into 
 a natural text parser.
 .
 The AGFL parser generator can build executable parsers for possibly 
 ambiguous grammars. Natural languages (English, Dutch, Arabic) are 
 typically ambiguous and therefore cannot be parsed by, for example, yacc. 
 The formalism is similar 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 compiler is 
 included, to make the lexical phase fast. Generated parsers are linked
 to a run-time system, which consists mainly of an optimized interpreter.

