Theory Of Computation Test – Question 3

Consider the following statements :

1. There exists a RE language for which there is No Ambiguous grammar possible.
2. There exists a RE language for which there is No Unambiguous grammar.

Which of the above statements is/are correct ?

  • 1.
  • 2.
  • 3.
  • 4.

Leave a Reply

Your email address will not be published. Required fields are marked *