GOLD parsing system
| GOLD parsing system
|
|
|---|---|
 |
|
|
|
| Basic data
|
|
| Maintainer | Devin Cook |
| Current version |
5.2.0 ( August 18, 2012 ) |
| operating system | Windows |
| category | Parser |
| License | zlib license |
| www.goldparser.org | |
The GOLD Parsing System (Grammar Oriented Language Developer) is free software (under zlib license ) for creating parsers and interpreters for formal languages , e.g. script languages . The parser works according to the LALR principle. To define the syntax of the programming language, a grammar is stored in Backus-Naur form .
The software consists of the following components:
- The builder is used to translate a formal grammar written in the so-called GOLD metalanguage into parse tables. The builder is part of an integrated development environment that also contains a generator for program skeletons and an interactive test environment for grammars.
- The translated grammar is provided by the builder as a file.
- The engine transfers the text to be parsed to automata using the parse tables . Engines are available for various target platforms and programming languages . Engines (sometimes several) are available for the following platforms: C , C ++ , .NET , Java , D , Delphi , Visual Basic Classic , Python .
When parsing a source text, the individual symbols of a rule are read until it is complete. The rule is then reduced. When reducing, the rule becomes a symbol of the superordinate rule. This creates a tree structure, the so-called "derivation tree". This reflects the logical structure of the source text. The tree structure is not part of the GOLD parsing system. Rather, the parser informs the caller about the symbols read and the reductions. It is up to the application to build a suitable tree.