non-deterministic finite state machine tool
Enter a context free grammar in the box below by defining its productions. Use S as the start symbol and nothing for the empty word. For example:
S -> SS
S -> n
S -> a

You can also use the pipe notation for multiple rules, like S-> SS | | a will give three rules: S to SS, S to epsilon, and S to a
context-free grammar