Search code examples
context-free-grammarcomputation-theory

what are these arrow operators in context free grammar?


I'm studying context free grammar and I'm curious what the arrow with the star and the arrow without the star mean in parts f and g where:

  • f is false.
  • g is true.

enter image description here


Solution

  • "x ⇒ y" means that y can be derived from x in exactly one application of some production of the grammar. Putting an asterisk over the ⇒ means that y is derived from x via zero or more (but finitely many!) applications of some sequence of productions.