|GOLD Parser News: C# and Delphi source code is now available firstname.lastname@example.org (2002-05-08)|
|Date:||8 May 2002 00:15:08 -0400|
|Posted-Date:||08 May 2002 00:15:08 EDT|
GOLD Parser News: 2002-05-06
The GOLD Parser has had a great first few months (since version 1.0.20
was released). The source code for the GOLD Parser Engine is now
available for the Microsoft .NET Platform (thanks to Marcus Klimstra)
and to Borland Delphi (thanks to Martin van der Geer). In addition,
the Engine is available for Java (thanks to Matthew Hawkins).
About the GOLD Parser
The GOLD Parser is a free, open source, parser generator that you can use
to develop your own compilers and emulators.
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.
Unlike common compiler-compilers, the GOLD Parser does not require you to
embed your grammar directly into your source code. Instead, the Builder
analyzes the grammar description and saves the parse tables to a separate
This information can be, subsequently, loaded by the actual parser engine
The GOLD Parser now currently supports:
* Microsoft .NET (All languages)
* Borland Delphi
Parser Engine Source Code
In the future, the source will be ported to as many additional
programming languages as possible. If you would like to port
the code to another language, your work will be deeply appreciated.
The GOLD Parser Engine source code is now available for:
* Visual Basic
To download the GOLD Parser Builder, please visit
---> http://www.DevinCook.com/GOLDParser <---
Enjoy, and happy programming!
- Devin Cook
Return to the
Search the comp.compilers archives again.