developed a version of the GOLD Parser Engine using ANSI C. This implementation of the
Engine is completely platform independent, and has been tested to compile cleanly on
Windows and Linux.
This Engine is designed to be both incredibly fast and use a
minimal amount of memory. This Engine doesn't automatically create a parse tree. This
follows the idea that parsng a large file, while building a parse tree, could consume a
large amount of memory, create memory fragmentation and use more cycles than necessary.
The download also includes a well-commented example program that prints the tokens and
rules as they are matched.