Free parser generator software for linux

Dragon is a powerful parser generator. It produces a consequent, object-oriented, integrated scanner and parser solution. Dragon parser generator also scales for very large grammar defintions. Since dragon parses LR(1) grammars, the generation algorithm is quite CPU intensive.
Using LR(1) instead of LALR decreases efficiency of the parser, but avoids some reduce/reduce conflicts in some cases. Dragon provides a very clean and structured way for the integration of application specific context code. Dragon combines the lexical and syntactical analysis and the corresponding code generation.
Enhancements:
- The switch option -y was added to switch between a dynamically allocated parse table or a static parse table.
- An escape feature was added for special token definitions.

Password List Generator is a good tool to create passwords list with makepasswd and save to file.

Gnome Password Generator is a GUI based secure password generator. The project allows the user to generate a specified number of random passwords of a specified length. The program requires Python version 2.4 or greater, PyGTK version 2.4 or greater, and Gnome-Python for Gnome 2.

Knitting Pattern Generator is a Python script to convert image files (PNG, GIF, BMP, etc.) into knitting patterns.

Usage:

python kpg.py myimage.png

Spherical Harmonics Generator provides an OpenGL-based interface to spherical harmonics.

Spherical Harmonics Generator is a useful visualization tool in chemistry and physics courses, especially when explaining orbitals and wave function components. Models are fully zoomable and dragable. Parameters can be chosen from a menu at runtime.

XML::Parser::EasyTree is an easier tree style for XML::Parser.

SYNOPSIS

use XML::Parser;
use XML::Parser::EasyTree;
$XML::Parser::Easytree::Noempty=1;
my $p=new XML::Parser(Style=>EasyTree);
my $tree=$p->parsefile(something.xml);

XML::Parser::EasyTree adds a new "built-in" style called "EasyTree" to XML::Parser. Like XML::Parsers "Tree" style, setting this style causes the parser to build a lightweight tree structure representing the XML document. This structure is, at least in this authors opinion, easier to work with than the one created by the built-in style.
When the parser is invoked with the EasyTree style, it returns a reference to an array of tree nodes, each of which is a hash reference.

All nodes have a type key whose value is the type of the node: e for element nodes, t for text nodes, and p for processing instruction nodes. All nodes also have a content key whose value is a reference to an array holding the elements child nodes for element nodes, the string value for text nodes, and the data value for processing instruction nodes. Element nodes also have an attrib key whose value is a reference to a hash of attribute names and values. Processing instructions also have a target key whose value is the PIs target.

EasyTree nodes are ordinary Perl hashes and are not objects. Contiguous runs of text are always returned in a single node.

The reason the parser returns an array reference rather than the root elements node is that an XML document can legally contain processing instructions outside the root element (the xml-stylesheet PI is commonly used this way).

If the parsers Namespaces option is set, element and attribute names will be prefixed with their (possibly empty) namespace URI enclosed in curly brackets.