a parser generator for natural languages.
AGFL is a parser generator for natural languages. It can cope with ambiguity, which is a must for natural languages, has a lexicon system and is quite fast. If you don't know what to think of it, think "yacc" (or "bison") without shift-reduce conflicts.
released on 20 January 2014
|License||Verified by||Verified on||Notes|
|License:GPLv2orlater||Kelly Hopkins||11 June 2009|
|License:LGPLv2.1orlater||Kelly Hopkins||11 June 2009|
Leaders and contributors
|Erik J. Verbruggen||Maintainer|
Resources and communication
This entry (in part or in whole) was last reviewed on 26 December 2016.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.