Java program that takes a grammar as an input and gives a table as an output.

You will need Java to be installed in order to use the program.

To run this program on a grammar file, you first need to compile it with compile for Windows or ./compile for Linux. Then you can use the command g2t <file> [options] for Windows or ./g2t <file> [options] for Linux. You can generate a jar file using build for Windows or ./build for Linux. For Linux only, you can also generate a .deb package file using ./mkpkg. Note that you may need to use sudo to execute the commands.

Terminals and non-terminals are automatically determined. They can be any symbol apart from the end of file symbol $ Non-alphanumerical symbols are automatically determined to be terminals, and they are always separated. Empty words (epsilon) are written as ^

• -s, --show-states: Shows all states of the finite state machine
• -n, --no-table: Prevents the table from exporting
• -q, --quiet: Quiet mode, only show errors
• -c, --compact: Merge states to remove doubles when no ambiguity
• -o<name>, --output=name: Output file name (default: <file>)
• -p[N], --optimize-csv[=N]: Optimize CSV file with level N (default: 1)

0. No optimization
1. Remove ERROR actions
2. Remove leading commas and state number
3. Replace action type by a single character, replace arrow by equals and removes "I" in states
4. Replace REDUCE action rules by the non-terminal to reduce to and the number of stack pop to do
5. Remove first space after the first letter and replace non-terminals by their index at the top

// S, NonTerm and OtherNonTerm are automatically detected to be non-terminals
# a, b, c, d, e, f, \= and + are automatically detected to be terminals
/*
With an anti-slash,
you can escape the following characters: | ; = \
*/

S = a NonTerm b | c;
NonTerm = d NonTerm | e \= a OtherNonTerm;
OtherNonTerm = f NonTerm + e | ^;