Context-free grammars are represented as a set of rules inspired from attempts to model natural languages.[1] The rules are absolute and have a typical syntax representation known as Backus–Naur form.