This is the context free language interpreter. A rule set like palindrome.rule can be interpreted up until a certain iteration (your computer wouldn't like solving infinite languages I think)

So I'm too lazy to list all options here, some trial and error will be required. The program itself has a '-h' and '--help' option like any normal unix-like program. So goodluck with that.

Variables are written in capitals like in most mathematical representations, non-terminatal symbols are written in lowercase.

In addition to the strict mathematical notation it is ok to seperate rules with '|'

Demonstration

S -> a
S -> bc
S -> TT
S -> lambda
T -> aa
T -> λ

Note that rules can be entered via commandline or file

##Versions

Added in version 3.2:

• shorthands "ctfi" or "./ctfi" is now enough to run the program
• actions the generate function to generate a language is still there but it's also possible to
  • "mini": minify, simplify rules, note that this is fairly elementary
  • "rl2ll": transforms a right linear grammar to a left linear grammar
  • "ll2rl": transforms a left linear grammar to right linear grammar