|GOLD Parser Engine source code is now available GOLDParser@DevinCook.com (2002-03-17)|
|Date:||17 Mar 2002 22:41:04 -0500|
|Keywords:||parse, tools, available|
|Posted-Date:||17 Mar 2002 22:41:04 EST|
About the GOLD Parser
The GOLD Parser is a free parser generator that you can use to develop
your own compilers and emulators. It strives to be a development tool
that can be used with numerous programming languages and on multiple
platforms while maintaining modern design concepts. Modern bottom-up
parsers use a Deterministic Finite Automaton (DFA) for identifying
different classes of tokens and a LALR(1) state machine to parse them.
The actual LALR(1) and DFA algorithms are easy to implement since they
rely on tables to determine actions and state transition.
Consequently, it is the computing of these tables that is both
time-consuming and complex.
The GOLD Parser Builder performs this task; reading from a source
grammar outline and then computing the appropriate tables. This
information is then saved to a Compiled Grammar Table file which can
be, subsequently, loaded by the actual parser engine and used.
Parser Engine Source Code
New! The source code for the GOLD Parser Engine is finally available
to download. The zip file contains the Visual Basic source code used
to implement the ActiveX Engine. In other words, this code includes
the DFA and LALR algorithms.
In the future, the source will be ported to as many programming
languages as possible. If you would like to port the code to another
language, your work will be deeply appreciated.
The parse tree sample project, I posted on Planet Source Code a couple
weeks ago, is included with this download. This is a simple project
which loads a Compiled Grammar Table file and draws a parse tree for a
given input string. The project parses an example grammar called
To download the GOLD Parser Builder, please visit
Enjoy, and happy programming!
- Devin Cook
Return to the
Search the comp.compilers archives again.