tinyap is a recursive descent parser with backup that outputs an abstract syntax tree (AST). Unlike in most parsers, the grammar is data. Tinyap uses an AST that represents a grammar to parse its input text. The factory default for the grammar is tinyap's grammar description language itself, so one can parse a grammar description and directly use the parse output to parse some other text written in the described language. Tinyap also features a plugin mechanism for grammars, which allows for dynamic modular grammars. Finally, it provides an interface to walk down the ASTs and to write external plugins to visit the nodes. License: GNU General Public License v2 Changes: Support was added for the repetition operators *, ?, and +. That is, tinyap now supports EBNF-style grammars. A sexier dialect named "short", which gets rid of angle brackets around non-terminals, was added.

	Read more at FreshMeat
	www.pheedo.com/click.phdo?i=26199386758217895ba6b3fab3195e6d