Which one of the following statements is FALSE?
- There exist context-free languages such that all the context-free grammars generating them are ambiguous
-
An unambiguous context-free grammar always has a unique parse tree for each string of the language generated by it
-
Both deterministic and non-deterministic pushdown automata always accept the same set of languages
-
A finite set of string from some alphabet is always a regular language