Grammar Input Window

The grammar input window allows you to create a grammar, in order to use one of the 4 available algorithms that will convert it into an automaton.
To obtain a grammar input window click on the "grammar conversion" button located in the bottom of the main menu.
Each line in the window corresponds to one of the rules of the grammar. Note that all Variables must be uppercase letters and all terminals lowercase letters. The lambda/epsilon symbol is implicitly used on all blank fields. The start symbol will be the variable on the left side of the first rule.
To create a grammar, simply fill in all the textfields, one rule per line, with no spaces. If there aren't enough lines, use the "add inputs" option in the menu bar. To clear the entire window and restart use the "clear" option in the menu bar.
Once the grammar has been created. It can be converted into a PDA or FSA by choosing one of the 4 available algorithms and clicking on the corresponding button at the bottom of the window. If the grammar isn't in the required form for that conversion an error message will appear. Else an FSA or PDA window will appear, with the stub machine to complete. The "solve", "check done" and "expand" buttons will be available exactly as in NFA to DFA mode. There are four algorithms that can be chosen from:

- Context Free Grammar to PDA. (LL mode)
- Context Free Grammar to PDA. (LR mode)
- Greibach Normal Form grammar to PDA.
- Regular grammar (left linear) to FSA.

Grammars can also be loaded and saved using the "load", "save" and "save as" options in the menubar.