0
14kviews
Convert the following grammar to GNF

S => ABA | AB | BA | AA | A | B - A => aA | b - B => bB | b -

1 Answer
1
244views
  • A CFG G = (V, T, R, S) is said to be in GNF if every production is of the form

    A → aα, where a ∈ T and α ∈ V∗

    i.e., α is a string of zero or more variables.

  • Definition: A production U ∈ R is said …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.