QUESTION 1 All ambiguous context-free grammars have equivalent unambiguous context-free grammars. True False QUESTION 2 Some of context-free language can be generated by a regular expression. True O False QUESTION 3 There is at least one equivalent push-down automata for every regular expression True False