Compiled Grammar Table (.cgt) File

Overview

One of the primary goals of the GOLD Parsing System is to support any number of programming languages. To accomplish this, the logic used to construct parse tables is logically removed from the algorithms that do the actual parsing.

When a grammar is analyzed by the GOLD Builder, parse tables are constructed for the Deterministic Finite Automata (DFA) and LALR algorithms. Both the DFA and LALR algorithms are simple automatas, and can be easily implemented in different programming languages with a minimum of code. The Engine has already been implemented in Visual Basic, C++, C#, ANSI C, Java and Delphi.

Once the parse tables are constructed, they can be saved to a Compiled Grammar Table file (.cgt). This file is platform and programming language independent. As a result, different implementations of the Engine can load the file and use its information.

This documentation contains information on the CGT file format and contents.